Optimization and Improvement of Genetic Algorithms Solving Traveling Salesman Problem

被引:0
|
作者
Zhang, Liping [1 ]
Yao, Min [1 ]
Zheng, Nenggan [1 ]
机构
[1] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Peoples R China
关键词
TSP; Genetic Algorithms; Crossover Operator; Cycle Crossover; Greedy Crossover;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traveling Salesman Problem (TSP) is a typical NP-complete problem, of which the search space increases with the number of cities. Genetic Algorithm (GA) is an efficient optimization algorithm characterized with explicit parallelism and robustness, applicable to TSP. In this paper, we compare the performance of the existing GAs in searching the solution for TSP and find a superior combination of crossover and mutation method. Then, the improvements in the Cycle Crossover and Greedy Cross-Cycle Crossover are proposed. Finallyl experimental results show that the new Cycle Crossover and Greedy Crossover algorithms perform much better than the original ones.
引用
收藏
页码:327 / 332
页数:6
相关论文
共 50 条
  • [1] Traveling Salesman Problem of Optimization based on Genetic Algorithms
    Ellili, Walid
    Samet, Mounir
    Kachouri, Abdennaceur
    [J]. 2017 INTERNATIONAL CONFERENCE ON SMART, MONITORED AND CONTROLLED CITIES (SM2C), 2017, : 123 - 127
  • [2] A synergetic approach to genetic algorithms for solving traveling salesman problem
    Qu, LS
    Sun, RX
    [J]. INFORMATION SCIENCES, 1999, 117 (3-4) : 267 - 283
  • [3] Genetic algorithms for the traveling salesman problem
    Potvin, JY
    [J]. ANNALS OF OPERATIONS RESEARCH, 1996, 63 : 339 - 370
  • [4] Solving traveling salesman problems by genetic algorithms
    LEE Heow Pueh
    LIM Siak Piang
    LEE Kwok Hong
    [J]. Progress in Natural Science:Materials International, 2003, (02) : 57 - 63
  • [5] ON SOLVING TRAVELING SALESMAN PROBLEMS BY GENETIC ALGORITHMS
    BRAUN, H
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 496 : 129 - 133
  • [6] Solving traveling salesman problems by genetic algorithms
    Liang, YC
    Ge, HW
    Zhou, CG
    Lee, HP
    Lin, WZ
    Lim, SP
    Lee, KH
    [J]. PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (02) : 135 - 141
  • [7] Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm
    Gao, Shang
    [J]. DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 597 - 602
  • [8] Solving traveling salesman problem (TSP) with pseudo-parallel genetic algorithms
    Liu, Jun
    Wang, Jie-Sheng
    [J]. Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2007, 24 (02): : 279 - 282
  • [9] A multiple-searching approach to genetic algorithms for solving traveling salesman problem
    Tsai, CF
    Tsai, CW
    Chen, CP
    Lin, FC
    [J]. PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 362 - 366
  • [10] Solving the Traveling Salesman Problem through Genetic Algorithms with changing crossover operators
    Takahashi, R
    [J]. ICMLA 2005: FOURTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2005, : 319 - 324