The coordination of parallel search with common components

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3533 LNAI, Issue , 2005, Pages 619-627

  Chen, Stephen ^a   Pitt, Gregory ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Combinatorial Optimization; Genetic Algorithms; Heuristic Search; Parallel Algorithms; Simulated Annealing; Traveling Salesman Problem

Indexed keywords

ANNEALING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; HEURISTIC SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 26944461967     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11504894_87     Document Type: Conference Paper

References (20)

1. Boese, K.D.: Models for Iterative Global Optimization. Ph.D. diss., Computer Science Department, University of California at Los Angeles (1996)
2. Chen, S.: SAGA: Demonstrating the Benefits of Commonality-Based Crossover Operators in Simulated Annealing. Working paper. School of Analytical Studies and Information Technology, York University (2003)
3. Chen, S., Smith, S.F.: Putting the "Genetics" back into Genetic Algorithms (Reconsidering the Role of Crossover in Hybrid Operators), In: Banzhaf W., Reeves, C. (eds.): Foundations of Genetic Algorithms 5, Morgan Kaufmann (1999)
4. Chen, S., Smith, S.F.: Introducing a New Advantage of Crossover: Commonality-Based Selection. In GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann (1999)
5. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)
6. Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. Wiley (1966)
7. Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley (1989)
8. Hiroyasu, T., Miki, M., Ogura, M.: Parallel Simulated Annealing using Genetic Crossover. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. ACTA Press (2000)
9. Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan Press (1975)
10. Johnson, D.S., McGeoch, L.A.: Experimental Analysis of Heuristics for the STSP. In: Gutin G., Punnen A.P. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers (2002)
11. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. In Science, Vol. 220 (1983) 671-680
12. Mühlenbein, H.: Evolution in Time and Space-The Parallel Genetic Algorithm. In: Rawlins, G. (ed.): Foundations of Genetic Algorithms. Morgan Kaufmann (1991)
13. Norman, M.G., Moscato, P.: A Competitive and Cooperative Approach to Complex Combinatorial Search, Caltech Concurrent Computation Program, C3P Report 790 (1989)
14. Radcliffe, N.J.: Forma Analysis and Random Respectful Recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (1991)
15. Radcliffe, N.J., Surry, P.D.: Formal memetic algorithms. In: Fogarty, T. (ed.): Evolutionary Computing: AISB Workshop. Springer-Verlag (1994)
16. Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag (1994)
17. Sanvicente, H., Frausto-Solís, J.: MPSA: A Methodology to Parallel Simulated Annealing and its Application to the Traveling Salesman Problem. In Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence. Springer-Verlag (2002)
18. Schwefel, H.-P.: Numerical Optimization of Computer Models. Wiley (1981)
19. Syswerda, G: Uniform Crossover in Genetic Algorithms. In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann (1989)
20. Wendt, O., König, W.: Cooperative Simulated Annealing: How much cooperation is enough? Technical Report, No. 1997-3, School of Information Systems and Information Economics at Frankfurt University (1997)