Improved genetic algorithm for solving TSP

Kongzhi yu Juece/Control and Decision

Volumn 29, Issue 8, 2014, Pages 1483-1488

  Yu, Ying Ying ^a   Chen, Yan ^a   Li, Tao Ying ^a  

^a DALIAN MARITIME UNIVERSITY   (China)

Author keywords

Adaptive adjustment; Genetic algorithm; Greedy method; Traveling salesman problem

Indexed keywords

GENETIC ALGORITHMS; STRUCTURAL OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

ADAPTIVE ADJUSTMENT; CROSS-OVER PROBABILITY; CROSSOVER OPERATOR; FITNESS VALUES; GLOBAL OPTIMAL SOLUTIONS; GREEDY METHOD; MUTATION PROBABILITY; TRADITIONAL GENETIC ALGORITHMS;

HEURISTIC METHODS;

EID: 84906954499     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: 10.13195/j.kzyjc.2013.0598     Document Type: Article

References (16)

1. Gao H C, Feng B Q, Zhu L. Reviews of the meta-heuristic algorithm for TSP[J]. Control and Decision, 2006, 21(3): 241-247.
2. Ji J Z, Huang Z, Liu C N. A fast ant colony optimization algorithm for traveling salesman problems[J]. J of Computer Research and Development, 2009, 46(6): 968-978.
3. Liu Z H, Zhang Y J, Zhang J, et al. Using combination of ant algorithm and immune algorithm to solve TSP[J]. Control and Decision, 2010, 25(5): 695-700.
4. Yannis Marinakis, Magdalene Marinaki. A hybrid multiswarm particle swarm optimization algorithm for the probabilistic traveling salesman problem[J]. Computers and Operations Research, 2010, 37(3): 432-442.
5. Darrell Whitley, Doug Hains, Adele Howe. A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover[C]. Proc of the 11th Int Conf on Parallel Problem Solving from Nature. Berlin: Springer Heidelberg, 2010, 6283: 566-575.
6. Zakir H Ahmed. Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator[J]. Int J of Biometrics and Bioinformatics, 2010, 3(6): 96-105.
7. Murat Albayrak, Novruz Allahverdi. Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms[J]. Expert Systems with Applications, 2011, 38(3): 1313-1320.
8. Baidu Baike. Traveling saleman problem[EB/OL]. (2014-3-17). http://baike.baidu.com/view/1162183.htm.
9. Lin W, Delgadofiras Y G, Gause D C, et al. Hybrid Newton-Raphson genetic algorithm for the travelling salesman problem[J]. Cybernetics and Systems, 1995, 26(4): 387-412.
10. Ren ZW, San Y. Improved adaptive genetic algorithm and its application research in parameter identification[J]. J of System Simulation, 2006, 18(1): 41-43.
11. Mu A H, Zhou S L, Yu X L. Research on fast selfadaptive genetic algorithm and its simulation[J]. J of System Simulation, 2004, 10(1): 122-125.
12. Deng X X. Research and improvement on genetic algorithm for solving TSP[D]. Shenyang: College of Information Science and Engineering, Northeastern University, 2008.
13. Srinivas M, Patnail K L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Trans on System, Man and Cybernetics, 1994, 24(4): 656-667.
14. Ren H Y, Chen F X. Improvement of adaptive genetic algorithms and application in line simplification[J]. Computer Engineering and Application, 2012, 48(11): 152-155.
15. Xiang Z Y, Liu Z C, Shen P A. An improved adaptive genetic algorithm based on evolutionary stages[J]. J of Wuhan University: Engineering, 2008, 41(1): 133-136.
16. Peng D P, Lin Z Y, Wang J Q. An improved genetic algorithm for TSP problem[J]. Computer Engineering and Applications, 2006, 42(13): 91-93.