An improved elastic net method for traveling salesman problem

被引:11
|
作者
Yi, Junyan [1 ]
Yang, Gang [1 ]
Zhang, Zhiqiang [1 ]
Tang, Zheng [1 ]
机构
[1] Toyama Univ, Fac Engn, Toyama 9308555, Japan
关键词
Elastic net; Traveling salesman problem; Parameter tuning; ALGORITHM;
D O I
10.1016/j.neucom.2008.09.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this article, we propose a new elastic net method to solve the traveling salesman problem by introducing some time-dependent parameters. This method can help network neurons move quickly near to the cities at early stage, and gradually increase the strength that pulls neurons towards their neighbours on the path to minimize the total path length. This enables the network to have superior ability of searching for cities. and converge sooner to a saturated state. Simulation results illustrate that the proposed network performs better than the classical elastic net for optimization both in solution quality and convergence speed. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1329 / 1335
页数:7
相关论文
共 50 条
  • [21] An Improved Genetic Algorithm for Multiple Traveling Salesman Problem
    Zhou, Wei
    Li, Yuanzong
    [J]. 2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 1, 2010, : 493 - 495
  • [22] An improved particle swarm optimization for traveling salesman problem
    Liu, Xinmei
    Su, Jinrong
    Han, Yan
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 803 - 812
  • [23] An Improved Wild Horse Optimizer for Traveling Salesman Problem
    Sayed, Gehad Ismail
    Hassanien, Aboul Ella
    [J]. 5TH INTERNATIONAL CONFERENCE ON COMPUTING AND INFORMATICS (ICCI 2022), 2022, : 274 - 279
  • [24] An improved approximation algorithm for the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (23) : 908 - 910
  • [25] Improved transformation of the symmetric multiple traveling salesman problem
    Univ of Amsterdam, Netherlands
    [J]. Oper Res, 1988, 1 (163-167):
  • [26] An Improved Genetic Algorithm for Solving the Traveling Salesman Problem
    Chen, Peng
    [J]. 2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 397 - 401
  • [27] THE CAVITY METHOD AND THE TRAVELING-SALESMAN PROBLEM
    KRAUTH, W
    MEZARD, M
    [J]. EUROPHYSICS LETTERS, 1989, 8 (03): : 213 - 218
  • [28] An improved genetic algorithm for the multiple traveling salesman problem
    Zhao, Fanggeng
    Dong, Jinyan
    Li, Sujian
    Yang, Xirui
    [J]. 2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 1935 - 1939
  • [29] AN IMPROVED SOLUTION TO THE TRAVELING SALESMAN PROBLEM WITH THOUSANDS OF NODES
    LITKE, JD
    [J]. COMMUNICATIONS OF THE ACM, 1984, 27 (12) : 1227 - 1236
  • [30] An Improved Whale Optimization Algorithm for the Traveling Salesman Problem
    Zhang, Jin
    Hong, Li
    Liu, Qing
    [J]. SYMMETRY-BASEL, 2021, 13 (01): : 1 - 13