Modified edge recombination operators of genetic algorithms for the traveling salesman problem

IECON Proceedings (Industrial Electronics Conference)

Volumn 1, Issue , 2000, Pages 2815-2820

  Nguyen, H D ^a   Yoshihara, I ^a   Yasunaga, M ^b  

^a UNIVERSITY OF MIYAZAKI   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Crossover; Edge Recombination; Genetic Algorithms; Traveling Salesman Problem

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; INDUSTRIAL ELECTRONICS;

CROSSOVER; EDGE RECOMBINATION; FAILURE RATE; RECOMBINATION OPERATORS;

TRAVELING SALESMAN PROBLEM;

EID: 84968828986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IECON.2000.972444     Document Type: Conference Paper

References (8)

1. D. Whitley, T. Starkweather, and D. Shaner, "Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination", In Handbook of Genetic Algorithms, Van Nostrand, 1990.
2. K. Mathias and D. Whitley, "Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem", In Parallel Problem Solving from Nature, R. Manner and B. Manderick, eds.pp. 219-228, North Holland-Elsevier., 1992.
3. J. Dzubera and D. Whitley, "Advanced Correlation Analysis of Operators for the Traveling Salesman Problem", In Parallel Problem Solving from Nature - PPSN III, Y. Davidor, H.P. Schwefel and R. Manner, eds. pp. 68-77, Springer-Verlag, 1994.
4. H. Sengoku and I. Yoshihara, "GA Based Optimization of Heuristic Search", IPSJ, vol.37, no.10, pp.1811-1820, 1996 (in Japanese).
5. H. Sengoku and I. Yoshihara, "A Fast TSP Solver Using GA on JAVA", In proc. of Third Int. Symposium on Artificial Life, and Robotics (AROB-III),pp.283-288, 1998.
6. D. E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning", Addison-Wesley, 1989.
7. Home page of GENITOR group, http://www.cs.colostate.edu/~genitor/
8. G. Reinelt, the TSPLIB home page, http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95