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 条
  • [1] A hybrid Elastic Net method for solving the traveling salesman problem
    Zhang, WD
    Bai, YP
    [J]. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2005, 15 (02) : 447 - 453
  • [2] Hybrid Algorithm for Solving Traveling Salesman Problem
    Zhao, Ping
    Xu, Degang
    [J]. 2019 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS AND TECHNOLOGIES (AIAAT 2019), 2019, 646
  • [3] Evolutionary Method for Solving the Traveling Salesman Problem
    Oliinyk, Andrii
    Fedorchenko, Ievgen
    Stepaneko, Alexander
    Rud, Mykyta
    Goncharenko, Dmytro
    [J]. 2018 INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE: PROBLEMS OF INFOCOMMUNICATIONS SCIENCE AND TECHNOLOGY (PIC S&T), 2018, : 331 - 338
  • [4] Ones Assignment Method for Solving Traveling Salesman Problem
    Basirzadeh, Hadi
    [J]. JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2014, 10 (04): : 258 - 265
  • [5] An elastic net method for solving the traveling salesman problem
    Chen, Jiu-Sheng
    Zhang, Xiao-Yu
    Chen, Jing-Jie
    [J]. 2007 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, VOLS 1-4, PROCEEDINGS, 2007, : 608 - 612
  • [6] A Hybrid Heuristic Approach for Solving the Generalized Traveling Salesman Problem
    Pop, Petrica C.
    Iordache, Serban
    [J]. GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 481 - 488
  • [7] Solving Traveling Salesman Problem with Hybrid Estimation of Distribution Alorithm
    Song, Libo
    Liu, Chang
    Zhu, Jun
    Shi, Haibo
    [J]. 2017 IEEE 7TH ANNUAL INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2017, : 886 - 891
  • [8] Solving the clustered traveling salesman problem via traveling salesman problem methods
    Lu, Yongliang
    Hao, Jin-Kao
    Wu, Qinghua
    [J]. PEERJ COMPUTER SCIENCE, 2022, 7
  • [9] Hybrid Nested Partitions Method for the Traveling Salesman Problem
    Zong, Decai
    Wang, Kangkang
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2013), 2014, 277 : 55 - 67
  • [10] SOLVING TRAVELING-SALESMAN PROBLEM
    TELEMTAY.MM
    [J]. ENGINEERING CYBERNETICS, 1972, 10 (06): : 1023 - 1029