Dynamic Local Search Algorithm for Solving Traveling Salesman Problem

被引:0
|
作者
Ghandeshtani, Kambiz Shojaee [1 ]
Taghadosi, Mojtaba Behnam [2 ]
Seyedkashi, Seyed Mohammad Hossein [3 ]
Shojaii, Keyvan [4 ]
机构
[1] Univ Tehran, Low Power High Performance Nanosyst Lab, Tehran, Iran
[2] Politecn Torino, Mechatron Lab LIM, Turin, Italy
[3] Tarbiat Modares Univ, Dept Mech Engn, Tehran, Iran
[4] Sadjad Inst Higher Educ, Dept Elect Engn, Mashhad, Iran
关键词
TSP; Local search; 2-Opt; Global search; Simulated annealing; NEURAL-NETWORK; GENETIC ALGORITHM; OPTIMIZATION; IMPLEMENTATION;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, developing a new local search approach based on 2-Opt operator and its implementation for TSP solution in SA algorithm (as a global search algorithm) is purposed. It is shown that more favorable results are expected by meaningful correlation between local search approach and global search algorithm in annealing process. In order to compare the performance of the proposed operator with the 2Opt as a basic operator, 24 benchmarks of TSP is selected from TSPLIB and both algorithms are implemented for 20 times for solving these benchmarks. The results show the improvement of error average for about 27%.
引用
收藏
页码:53 / 58
页数:6
相关论文
共 50 条
  • [31] 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
  • [32] A Study of Solving Traveling Salesman Problem with Genetic Algorithm
    Sun, Chutian
    [J]. 2020 9TH INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY AND MANAGEMENT (ICITM 2020), 2020, : 307 - 311
  • [33] Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
    Geng, Xiutang
    Chen, Zhihua
    Yang, Wei
    Shi, Deqian
    Zhao, Kai
    [J]. APPLIED SOFT COMPUTING, 2011, 11 (04) : 3680 - 3689
  • [34] Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm
    Yousefikhoshbakht, Majid
    [J]. COMPLEXITY, 2021, 2021
  • [35] A New Genetic Algorithm for solving Traveling Salesman Problem
    Bai Xiaojuan
    Zhou Liang
    [J]. PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE: APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE, 2009, : 451 - +
  • [36] 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
  • [37] An Improved Genetic Algorithm for Solving the Traveling Salesman Problem
    Chen, Peng
    [J]. 2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 397 - 401
  • [38] Firefly Algorithm Solving Multiple Traveling Salesman Problem
    Li, Mingfu
    Ma, Jianhua
    Zhang, Yuyan
    Zhou, Houming
    Liu, Jingang
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1277 - 1281
  • [39] The quantum approximate algorithm for solving traveling Salesman problem
    Ruan, Yue
    Marsh, Samuel
    Xue, Xilin
    Liu, Zhihao
    Wang, Jingbo
    [J]. Ruan, Yue (yue_ruan@ahut.edu.cn); Wang, Jingbo (jingbo.wang@uwa.edu.au), 2020, Tech Science Press (63): : 1237 - 1247
  • [40] A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem
    Li, Weiqi
    [J]. EXPERIMENTAL ALGORITHMS, 2011, 6630 : 65 - 75