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 条
  • [1] AN ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    KAREL, C
    SWEENEY, DW
    [J]. OPERATIONS RESEARCH, 1963, 11 : B48 - B48
  • [2] Hybrid genetic algorithm for solving Traveling Salesman Problem with sorted population
    Yugay, Olga
    Kim, Insoo
    Kim, Beomjune
    Ko, Franz I. S.
    [J]. THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 1024 - 1028
  • [3] A New Hybrid Discrete Firefly Algorithm for Solving the Traveling Salesman Problem
    Mohsen, Abdulqader M.
    Al-Sorori, Wedad
    [J]. APPLIED COMPUTING AND INFORMATION TECHNOLOGY, 2017, 695 : 169 - 180
  • [4] A hybrid method for solving traveling salesman problem
    Zarei, Bager
    Meybodi, M. R.
    Abbaszadeh, Mortaza
    [J]. 6TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS, 2007, : 394 - +
  • [5] A Dragonfly Algorithm for Solving Traveling Salesman Problem
    Hammouri, Abdelaziz I.
    Abu Samra, Enas Tawfiq
    Al-Betar, Mohammed Azmi
    Khalil, Raid M.
    Alasmer, Ziad
    Kanan, Monther
    [J]. 2018 8TH IEEE INTERNATIONAL CONFERENCE ON CONTROL SYSTEM, COMPUTING AND ENGINEERING (ICCSCE 2018), 2018, : 136 - 141
  • [6] Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm
    Kaur, D.
    Murugappan, M. M.
    [J]. 2008 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1 AND 2, 2008, : 1 - 6
  • [7] A hybrid Behavior based ant colony algorithm for solving traveling salesman problem
    Li Mao
    Feng Bian
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 898 - 901
  • [8] A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem
    Pop, Petrica
    Oliviu, Matei
    Sabo, Cosmin
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2017, 2017, 10334 : 149 - 160
  • [9] An Improved Hybrid Algorithm for Traveling Salesman Problem
    Bai, Qiuying
    Li, Guizhi
    Sun, Qiheng
    [J]. 2015 8TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI), 2015, : 806 - 809
  • [10] A hybrid evolutionary algorithm for traveling salesman problem
    White, CM
    Yen, GG
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1473 - 1478
12345