New genetic crossover operator for the TSP

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3070, Issue , 2004, Pages 480-485

  Soak, Sang Moon ^a   Ahn, Byung Ha ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

CROSSOVER OPERATORS; CYCLE CROSSOVER (CX); ORDER CROSSOVER (OX); POSITION-BASED CROSSOVER (PBX);

GENETIC ALGORITHMS;

EID: 9444235657     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24844-6_71     Document Type: Conference Paper

References (13)

1. D. Goldberg : Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading, MA (1989).
2. J. Grefenstette, R. Gopal, B. Rosmaita, D. Gucht : Genetic Algorithms for the Traveling Salesman Problem. First Int. Conf. on GA & App's, (1985) 160-168.
3. K. Maekawa, N. Mori, H. Tamaki, H. Kita, Y. Nishikawa : A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule. Proc. of IEEE Int. Conf. on EC, (1996) 529-534.
4. K. Katayama, H. Hirabayashi, H. Narihisa : Performance Analysis of a New Genetic Cross-over for the Traveling Salesman Problem. IEICE TRANS. FUNDAMENTALS, VOL. E81-A, NO. 5 (1998) 738-750.
5. K. Mathias, D. Whitley : Genetic operators, the fitness landscape and the traveling salesman problem. Proc. Parallel Problem Solving from Nature II, (1992) 219-228.
6. R. Yang : Solving Large Traveling Salesman Problems with Small Populations. Genetic Algorithms in Engineering Systems: Innov's and App's, (1997) 157-162.
7. M. Yamamura, I. Ono, S. Kobayashi : Character-preserving genetic algorithms for traveling salesman problem. Jour, of Japan Society for AI, vol. 6, (1992) 1049-1059.
8. L. Yang, D.A. Stacey : Solving the Traveling Salesman Problem Using the Enhanced Ge-netic Algorithm. LNCS, Vol.2056, Springer-Verlag, 307-316.
9. K.D. Boese : Cost Versus Distance In the Traveling Salesman Problem. Tech. Rep. TR-950018, UCLA CS Department, (1995).
10. D. Whitley, T. Starkweather, D. Fuquay : Scheduling problems and traveling salesman: the genetic edge recombination and operator. Proc. 3rd Int. Conf. GA and their Applications, (1989) 133-140. 441-456.
11. P. Moscato : On Genetic Crossover Operators for Relative Order Preservation. Caltech Concurrent Computation Program, C3P Report 778, (1989).
12. B. Preisleben, P. Merz : A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesmen Problems. IEEE Int. Conf. on EC, (1996) 616-621.
13. TSPLIB. Web Site, http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/ TSPLIB95/TSPLIB.html