Solving TSP with novel local search heuristic genetic algorithms

Proceedings - 4th International Conference on Natural Computation, ICNC 2008

Volumn 1, Issue , 2008, Pages 670-674

  Jianxin, Zhang ^a,b   Chaonan, Tong ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b INNER MONGOLIA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; DIESEL ENGINES; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; TRAVELING SALESMAN PROBLEM;

CROSSOVER OPERATIONS; HYBRID GENETIC ALGORITHMS; LOCAL EXTREMUM; LOCAL SEARCH HEURISTIC; LOCAL SEARCH METHODS; MUTATION OPERATIONS; NEIGHBORHOOD MODELS; NEW IDEAS; POPULATION DIVERSITIES; SELF-ADAPTIVE; STANDARD GENETIC ALGORITHMS; SYMMETRIC TRAVELING SALESMAN PROBLEMS;

CONVERGENCE OF NUMERICAL METHODS;

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

References (11)

1. Ahuja R K, Ergun Ö, Orlin J B. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 2002,123(1-3):75-102
2. Gamboa D, Rego C, Glover F. Data structures and ejection chains for solving large-scale traveling salesman problems. European Journal of Operational Research, 2005, 160(1):154-171
3. Applegate D, Cook W, Rohe A. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 2003,15(1):82-92
4. Meer K. Simulated annealing versus Metropolis for a TSP instance. Information Processing Letters, 2007,104(6):216-219
5. Ning Yang, Ping Li, Baisha Mei. An angle-based crossover tabu search for the traveling salesman problem. In: Proceedings of the Third International Conference on Natural Computation, Haikou, China,2007,4:512-516
6. Peng Gang, Nakatsuru Takeshi. Efficiency of local genetic algorithm in parallel processing. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Dalian, China, 2005:620-623
7. Katayama K, Sakamoto H. The Efficiency of Hybrid Mutation Genetic Algorithm for the Travelling Salesman Problem. Mathematical and Computer Modelling. 2000,30:197-203
8. Chatterjee S, Carrera C, Lynch L A. Genetic algorithms and traveling salesman problems. European Journal of Operational Reserch, 1996,93(3):490-510
9. Takahashi R. Solving the traveling salesman problem through genetic algorithms with changing crossover operators. In: Proceedings of the Fourth International Conference on Machine Learning and Applications, Los Angeles, CA, USA, 2005:319-324
10. http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html
11. Yingzi Wei, Yulan Hu, Kanfeng Gu. Parallel search strategies for TSPs using a greedy genetic algorithm. In: Proceedings of the Third International Conference on Natural Computation, Haikou, China,2007, 3:786-790