The EAX algorithm considering diversity loss

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

Volumn 3242, Issue , 2004, Pages 332-341

  Nagata, Yuichi ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; GENETIC ALGORITHMS; OPTIMAL SYSTEMS; POPULATION STATISTICS; TRAVELING SALESMAN PROBLEM;

BENCH-MARK PROBLEMS; DIVERSITY LOSS; OPTIMAL SOLUTIONS; POPULATION DIVERSITY; POPULATION SIZES; SMALL POPULATION;

PROBLEM SOLVING;

EID: 35048902533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_34     Document Type: Article

References (11)

1. Y. Nagata and S. Kobayashi, Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem, Proc. of the 7th Int. Conference on Genetic Algorithms, pp. 450-457, 1997.
2. P. Merz and B. Freisleben: Genetic Local Search for the TSP: New Results, Proc. of the 1997 IEEE Int. Conf. on Evolutionary Computation, pp.159-163 (1997).
3. D. Whitley, T. Starkweather, and D. Fuquay, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator, Proc. of the 3rd Int. Conference on Genetic Algorithms, pp. 133-140, 1989.
4. H.K. Tsai, J.M. Yang, and C.Y. Kao, Solving Traveling Salesman Problems by Combining Global and Local Search Mechanisms, Proc. of the the 2002 Congress on Evolutionary Computation, pp. 12920-1295, 2002.
5. J. Watson, C. Poss D. Whitley and so on, The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt, Proc. of the fifth Int. Conference on Parallel Probrem Solving from Nature, pp. 823-833, 2000.
6. Y. Nagata, Criteria for designing crossovers for TSP, Proc. of the 2004 Congress on Evolutionary Computation, , (to be appeared), 2004.
7. Y. Nagata, Genetic Algorithm for Traveling Salesman Problem using Edge Assembly Crossover: its Proposal and Analysis, Doctoral thesis, 2000.
8. K. Maekawa, N. Mori, H. Kita, and H.Nishikawa, A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule, Proc. 1996 IEEE Int. Conference on Evolutionary Computation, pp. 529-534, 1996.
9. K. Ideda and S. Kobayashi, Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs, Proc. of the seventh Int. Conference on Parallel Probrem Solving from Nature, pp. 162-171, 2002.
10. T. Yamada and N. Ryohei, Scheduling by Genetic Local Search with Multi-Step Crossover, Proc. of the fourth Int. Conference on Parallel Probrem Solving from Nature, 1996.
11. TSPLIB95, http://www.iwr.uni-heidelberg.de/iwr/compt/soft/TSPLIB95/ TSPLIB.html.