A novel genetic algorithm for traveling salesman problem based on neighborhood code

ICINIS 2009 - Proceedings of the 2nd International Conference on Intelligent Networks and Intelligent Systems

Volumn , Issue , 2009, Pages 429-432

  Yang, Jin Qiu ^a,b   Yang, Jian Gang ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Combinatorial optimization; Genetic algorithm; Neighborhood code; Traveling salesman problem

Indexed keywords

CROSSOVER AND MUTATION; MUTATION OPERATORS; NEIGHBORHOOD CODE; NOVEL GENETIC ALGORITHM; TRAVELING SALESMAN;

COMBINATORIAL OPTIMIZATION; ENCODING (SYMBOLS); GENETIC ALGORITHMS; INTELLIGENT NETWORKS; INTELLIGENT SYSTEMS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 77949520911     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICINIS.2009.116     Document Type: Conference Paper

References (19)

1. Korte B.H., Jens V, Combinatorial optimization: theory and algorithms, Springer, New York, 2008
2. G. Finke, A. Claus, E. Gunn, "A two-commodity network flow approach to the traveling salesman problem", Congress Numerantium 41, 1984, pp. 167-178.
3. P. Miliotis, "Using cutting planes to solve the symmetric traveling salesman problem", Mathematical programming 15, 1978, pp. 177-188.
4. S. Lin, B.W. Kernighan, "An effective heuristic algorithm for traveling salesman problem", Operations Research, 1973, pp. 498-516.
5. S. Kirkpatrick, C.D. Gelatt Jr., M.P, Vecchi, "Configuration space analysis of traveling salesman problem", Journal Physique 46 , 1985, pp. 1277-1292.
6. B. Shirrish, J. Nigel, M.R. Kabuka, "A Boolean neural network approach for the traveling salesman problem", IEEE Transactions on Computers 42 ,1993, pp. 1271-1278.
7. F. Glover, Artificial intelligence. "heuristic frameworks and tabu search", Managerial & Decision Economics 11 , 1990, pp. 365-378.
8. R. Wong, "Integer programming formulations of the traveling salesman problem", Proceedings of the IEEE International Conference of Circuits and Computers, 1980, pp. 149-152.
9. D. Goldberg, R. Lingle, Alleles, "Loci, and the Traveling Salesman Problem. First International Conference on Genetic Algorithms and Their Applications", 1985, pp. 154-159
10. H. Braun, "On Traveling Salesman Problems by Genetic Algorithms", 1st Workshop on Parallel Problem Solving from Nature, Oct, 1990, pp. 129-133
11. Holland J. H, Adaptation in natural and artificial systems, Univ of Michigan Press, Ann Arbor Mich, 1975
12. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, MA: Addison Wesley, 1989
13. L. Davis, "Applying Adaptive Algorithms to Epistatic Domains", Proc. International Joint Conference on Artificial Intelligence, 1985
14. I. Oliver, D. Smith, J. Holland, "A Study of Permutation Crossover Operators on the Traveling Salesman Problem", Proc. Second International Conference on Genetic Algorithms and their Applications, 1985
15. D. Whitley, T. Starkweather, D. Shaner, Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. Handbook of Genetic Algorithms, Van Nostrand, 1990
16. Lv J., Feng B.Q., Li B., "Study on the Recognition and Utilization of Building Block in the Iterations of Genetic Algorithm", Journal of Xi'an Jiaotong University, Feb.2006, pp. 133-137
17. University of Heidelberg. TSPLIB: library of sample instances for the TSP(EB/OL). http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/ 2004-10-20
18. Wang L.Y., Zhang J., Li H. "An Improved Genetic Algorithm for TSP", Machine Learning and Cybernetics, 2007 International Conference on Volume 2, 19-22 Aug. 2007, pp. 925-928
19. Tsujimura, Y., Gen, M., "Entropy-based genetic algorithm for solving TSP", Knowledge-Based Intelligent Electronic Systems, 1998. Proceedings KES '98. 1998 Second International Conference on Volume 2, 21-23 April 1998, pp. 285-290