A hybrid method for solving traveling salesman problem

被引:4
|
作者
Zarei, Bager [1 ]
Meybodi, M. R. [2 ]
Abbaszadeh, Mortaza [1 ]
机构
[1] Islamic Azad Univ, Dept Comp Engn, Shabestar Branch, Tehran, Iran
[2] Amirkabir Univ, Dept Comp Engn & IT, Tehran, Iran
关键词
D O I
10.1109/ICIS.2007.24
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the important problems in graphs theory is TSP. Both learning automata and genetic algorithms acre search tools which are used for solving many NP-Complete problems. In this paper a hybrid algorithm is proposed to solve TSP. This algorithm uses both GA and LA simultaneously to search in state space. It has been shown that the speed of reaching to answer increases remarkably using LA and GA simultaneously in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of hybrid algorithm over LA and GA.
引用
收藏
页码:394 / +
页数:2
相关论文
共 50 条
  • [21] A Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Drone
    Gunay-Sezer, Noyan Sebla
    Cakmak, Emre
    Bulkan, Serol
    [J]. SYSTEMS, 2023, 11 (05):
  • [22] Development of the Software for Solving the Knapsack Problem by Solving the Traveling Salesman Problem
    Sheveleva, Anna M.
    Belyaev, Sergey A.
    [J]. PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 652 - 656
  • [23] SOLVING THE DYNAMIC TRAVELING SALESMAN GAME PROBLEM
    Belousov, A. A.
    Berdyshev, Yu. I.
    Chentsov, A. G.
    Chikrii, A. A.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2010, 46 (05) : 718 - 723
  • [24] A hybrid heuristic for the traveling salesman problem
    Baraglia, R
    Hidalgo, JI
    Perego, R
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2001, 5 (06) : 613 - 622
  • [25] GEOMETRIC APPROACHES TO SOLVING TRAVELING SALESMAN PROBLEM
    NORBACK, JP
    LOVE, RF
    [J]. MANAGEMENT SCIENCE, 1977, 23 (11) : 1208 - 1223
  • [26] Solving the traveling salesman problem on a quantum annealer
    Warren, Richard H.
    [J]. SN APPLIED SCIENCES, 2020, 2 (01):
  • [27] 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
  • [28] Learning to cooperate in solving the traveling salesman problem
    Qi, DH
    Sun, R
    [J]. INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2005, 15 (1-2) : 151 - 162
  • [29] Solving the time dependent traveling salesman problem
    Li, FY
    Golden, B
    Wasil, E
    [J]. NEXT WAVE IN COMPUTING, OPTIMIZATION, AND DECISION TECHNOLOGIES, 2005, 29 : 163 - 182
  • [30] Solving the traveling salesman problem with interdiction and fortification
    Lozano, Leonardo
    Smith, J. Cole
    Kurz, Mary E.
    [J]. OPERATIONS RESEARCH LETTERS, 2017, 45 (03) : 210 - 216