Hybrid Algorithm for Solving Traveling Salesman Problem

被引：2
|
作者：
Zhao, Ping [1 ]
Xu, Degang [1 ]
机构：
[1] Henan Univ Technol, Sch Informat Sci & Engn, Zhengzhou, Peoples R China
来源：
2019 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS AND TECHNOLOGIES (AIAAT 2019) | 2019年 / 646卷
关键词：
D O I：
10.1088/1757-899X/646/1/012032
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The basic genetic algorithm has the disadvantages of falling into local optimum and slow convergence. To solve this problem, a hybrid algorithm combining simulated annealing strategy is proposed. The cooling process in simulated annealing is used to complete the iterative process in the hybrid algorithm. The algorithm is used to solve the traveling salesman problem. The results show that the convergence speed and accuracy of the hybrid algorithm is significantly better than the basic genetic algorithm.
引用
收藏
页数：6
相关论文
共 50 条
  • [41] Solving Asymmetric Traveling Salesman Problem using Genetic Algorithm
    Birtane Akar, Sibel
    Sahingoz, Ozgur Koray
    [J]. 2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 1655 - 1659
  • [42] Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
    Xu, Shuhui
    Wang, Yong
    Huang, Aiqin
    [J]. ALGORITHMS, 2014, 7 (02): : 229 - 242
  • [43] An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem
    Wang, Zicheng
    Geng, Xiutang
    Shao, Zehui
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (07) : 1680 - 1686
  • [44] DJAYA: A discrete Jaya algorithm for solving traveling salesman problem
    Gunduz, Mesut
    Aslan, Murat
    [J]. APPLIED SOFT COMPUTING, 2021, 105
  • [45] Solving traveling salesman problem by using a local evolutionary algorithm
    Xuan, W
    Li, YX
    [J]. 2005 IEEE International Conference on Granular Computing, Vols 1 and 2, 2005, : 318 - 321
  • [46] The performances of a general optimization algorithm in solving traveling salesman problem
    Ancau, M.
    [J]. Annals of DAAAM for 2005 & Proceedings of the 16th International DAAAM Symposium: INTELLIGENT MANUFACTURING & AUTOMATION: FOCUS ON YOUNG RESEARCHES AND SCIENTISTS, 2005, : 5 - 6
  • [47] Dynamic Local Search Algorithm for Solving Traveling Salesman Problem
    Ghandeshtani, Kambiz Shojaee
    Taghadosi, Mojtaba Behnam
    Seyedkashi, Seyed Mohammad Hossein
    Shojaii, Keyvan
    [J]. PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING COMPUTING AND APPLICATIONS IN SCIENCES (ADVCOMP 2010), 2010, : 53 - 58
  • [48] Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem
    Rahman, Md. Azizur
    Islam, Ariful
    Ali, Lasker Ershad
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2021, 21 (04): : 33 - 40
  • [49] A distance matrix based algorithm for solving the traveling salesman problem
    Wang, Shengbin
    Rao, Weizhen
    Hong, Yuan
    [J]. OPERATIONAL RESEARCH, 2020, 20 (03) : 1505 - 1542
  • [50] Discrete Social Spider Algorithm for Solving Traveling Salesman Problem
    Khosravanian, Asieh
    Rahmanimanesh, Mohammad
    Keshavarzi, Parviz
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2021, 20 (03)
12345