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
来源：
6TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS | 2007年
关键词：
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 条
  • [41] Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm
    Yousefikhoshbakht, Majid
    [J]. COMPLEXITY, 2021, 2021
  • [42] Solving the asymmetric traveling salesman problem with periodic constraints
    Paletta, G
    Triki, C
    [J]. NETWORKS, 2004, 44 (01) : 31 - 37
  • [43] The Quantum Approximate Algorithm for Solving Traveling Salesman Problem
    Ruan, Yue
    Marsh, Samuel
    Xue, Xilin
    Liu, Zhihao
    Wang, Jingbo
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03): : 1237 - 1247
  • [44] An Improved Genetic Algorithm for Solving the Traveling Salesman Problem
    Chen, Peng
    [J]. 2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 397 - 401
  • [45] A New Approach for Solving the Generalized Traveling Salesman Problem
    Pop, P. C.
    Matei, O.
    Sabo, C.
    [J]. HYBRID METAHEURISTICS, 2010, 6373 : 62 - +
  • [46] SOLVING TRAVELING SALESMAN PROBLEM BY INTEGER LINEAR PROGRAMMING
    MARTIN, GT
    [J]. OPERATIONS RESEARCH, 1966, S 14 : B71 - &
  • [47] Traveling salesman problem parallelization by solving clustered subproblems
    Romanuke, Vadim
    [J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2023, 48 (04) : 453 - 481
  • [48] A new approach for solving large traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    [J]. CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1636 - 1641
  • [49] An Adaptive Genetic Algorithm for Solving Traveling Salesman Problem
    Wang, Jina
    Huang, Jian
    Rao, Shuqin
    Xue, Shaoe
    Yin, Jian
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2008, 5227 : 182 - 189
  • [50] The neural network methods for solving Traveling Salesman Problem
    Shi, Yong
    Zhang, Yuanying
    [J]. 8TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (ITQM 2020 & 2021): DEVELOPING GLOBAL DIGITAL ECONOMY AFTER COVID-19, 2022, 199 : 681 - 686
12345