Improving EAX with restricted 2-opt

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1471-1476

  Chan, Chen Hsiung ^a   Lee, Sheng An ^a   Kao, Cheng Yan ^a   Tsai, Huai Kuang ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b GENOMICS RESEARCH CENTER   (Taiwan)

Author keywords

Combinatorial optimization; Edge assembly crossover (eax); Genetic algorithms; Local search; Restricted 2 opt; Traveling salesman problem (tsp)

Indexed keywords

GENETIC ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; RANDOM NUMBER GENERATION;

COMBINATORIAL OPTIMIZATION; EDGE ASSEMBLY CROSSOVER (EAX); LOCAL SEARCH; RESTRICTED 2-OPT; TRAVELING SALESMAN PROBLEM (TSP);

MATHEMATICAL OPERATORS;

EID: 32444439237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068242     Document Type: Conference Paper

References (12)

1. T. Yamada and N. Ryohei, Scheduling by Genetic Local Search with Multi-Step Crossover, In Parallel Problem Solving from Nature - PPSN IV, LNCS 1141, W. Ebeling, et al., Eds., Springer-Verlag, 1996, 960-969.
2. F. Alizadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser, Physical mapping of chromosomes: A combinatorial problem in molecular biology., Proc. 4th ACM-SIAM Symp. Discrete Algorithms (SODA), 52-76, 1993.
3. H. Bohr and S. Brunak, A Traveling Salesman Approach to Protein Conformation, Complex Systems, 3, 9-28, 1989.
4. 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, 133-140, 1989.
5. 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, 529-534, 1996.
6. Y. Nagata and S. Kobayashi, Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem., Proc. of the 7th Int. Conf. on Genetic Algorithms, 450-457, 1997.
7. H.-K. Tsai, J.-M. Yang, and C.-Y. Kao, Solving Traveling Salesman Problems by Combining Global and Local Search Mechanisms., Proc. of the 2002 Confess on Evolutionary Computation, 12920-12925, 2002.
8. Y. Nagata, The EAX Algorithm Considering Diversity Loss, In Parallel Problem Solving from Nature - PPSN VIII, LNCS 3242, X. Yao, et al., Eds., Springer-Verlag, 2004, 332-341.
9. J. Watson, C. Ross, V. Eisele, J. Denton, J. Bins, C. Guerra, D. Whitley, and A. Howe, The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt, In Parallel Problem Solving from Nature - PPSN V, LNCS 1498, A. E. Eiben, et al., Eds., Springer-Verlag, 1998, 823-832.
10. Y. Nagata, Genetic Algorithm for Traveling Salesman Problem using Edge Assembly Crossover: its Proposal and Analysis., Ph.D. Thesis, Tokyo Institute of Technology, 2000.
11. H.-K. Tsai, J.-M. Yang, Y.-F. Tsai, and C.-Y. Kao, An Evolutionary Algorithms for Large Traveling Salesman Problems, IEEE Trans. Systems, Man, and Cybernetics Part B : Cybernetics, 34, 1718-1729, 2004.
12. K. Ikeda and S. Kobayashi, Deterministic Multi-Step Crossover Fusion: A Handy Crossover Composition for GAs, In Parallel Problem Solving from Nature - PPSN VII, LNCS 2439, J. J. Merelo, et al., Eds., Springer-Verlag, 2002, 162-171.