Parallel search strategies for TSPs using a greedy genetic algorithm

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volumn 3, Issue , 2007, Pages 786-790

  Yingzi, Wei ^a   Yulan, Hu ^a   Kanfeng, Gu ^b,c  

^a SHENYANG LIGONG UNIVERSITY   (China)

^b SHENYANG INSTITUTE OF AUTOMATION   (China)

^c UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ENCLOSURE COMPETITION; GREEDY GENETIC ALGORITHMS; GREEDY HEURISTICS; PARALLEL SEARCH STRATEGIES;

CONVERGENCE OF NUMERICAL METHODS; HEURISTIC ALGORITHMS; PARALLEL ALGORITHMS; SEARCH ENGINES; TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 38049019826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.537     Document Type: Conference Paper

References (11)

1. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA. 1989.
2. Goldberg D.E. and Lingle, RJ., "Alleles, loci, and the traveling salesman problem," Proceedings of the International Conference on Genetic Algorithms, London, pp. 154-159, 1985.
3. G. Andal Jayalakshmi and S. Sathiamoorthy, "A Hybrid Genetic Algorithm: A New Approach to Solve Traveling Salesman Problem," International Journal of Computational Engineering Science Vol. 2, No. 2, 2001, pp. 339-355.
4. J. Grefenstette, R. Gopal, R. Rosmaita, and D. Gucht, "Genetic algorithms for the traveling salesman problem," Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Eribaum Associates, Mahwah, NJ, 1985.
5. Whitley D., Starkweather, T., Fuquay, D., "Scheduling problems and traveling salesmen: the genetic edge recombination operator," Proceedings of the Third International Conference on Genetic Algorithms, Los Altos, CA, pp. 133-140, 1989.
6. Bryan A. Norman and James C. Bean, "A genetic algorithm methodology for complex scheduling problems," Naval Research Logistics Vol. 46, No. 2, pp. 199-211, 1999.
7. Paul K. Bergey and Cliff Ragsdale, "Modified differential evolution: a greedy random strategy for genetic recombination," Omega, Vol. 33, No. 3, pp. 255-265, 2005.
8. G. Reinelt, TSPLIB, University of Heidelberg, http://www.iwr.uni- heidelberg.de/iwr/comopt/soft/ TSPLIB95/TSPLIB.html, 1996.
9. Andrzej Jaszkiewicz "Genetic local search for multiobjective combinatorial optimization," European Journal of Operational Research, Vol. 137, No. 1, pp. 50-71, 2002.
10. Forbes J. Burkowski, "Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem," Parallel Computing, Vol. 30, No. 5-6, pp. 803-816, 2004.
11. Chatterjee S., Carrera C. and Lynch L., "Genetic algorithms and traveling salesman problems," European Journal of Operational Research vol. 93, No. 3, pp. 490-510, 1996