An ant-based heuristic for the railway traveling salesman problem

被引：0

作者：

Pop, Petrica C. ^{[1
]}

Pintea, Camelia M. ^{[2
]}

Sitar, Corina Pop ^{[3
]}

机构：

[1] North Univ Baia Mare, Fac Sci, Dept Math & Comp Sci, Baia Mare, Romania

[2] Univ Babes Bolyai, Fac Math & Comp Sci, Cluj Napoca, Romania

[3] Univ Babes Bolyai, Fac Econ, Cluj Napoca, Romania

来源：

APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS | 2007年 / 4448卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We consider the Railway Raveling Salesman Problem, denoted RTSP, in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having the goal to minimize the overall time of the journey. The RTSP is NP-hard and it is related to the Generalized Traveling Salesman Problem. In this paper we present an effective meta-heuristic based on ant colony optimization (ACO) for solving the RTSP. Computational results are reported for real-world and synthetic data. The results obtained demonstrate the superiority of the proposed algorithm in comparison with the existing method.

引用

页码：702 / +

页数：2

共 50 条

[31] An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU
Weyland, Dennis
Montemanni, Roberto
Gambardella, Luca Maria
[J]. COMPUTER AIDED SYSTEMS THEORY, PT 1, 2013, 8111 : 332 - 339
[32] A novel ant colony optimization based on game for traveling salesman problem
Kang Yang
Xiaoming You
Shen Liu
Han Pan
[J]. Applied Intelligence, 2020, 50 : 4529 - 4542
[33] Ant colony optimization for traveling salesman problem based on parameters optimization
Wang, Yong
Han, Zunpu
[J]. APPLIED SOFT COMPUTING, 2021, 107
[34] Ant-cycle based on Metropolis rules for the traveling salesman problem
龚劬
[J]. Journal of Chongqing University(English Edition), 2005, (04) : 229 - 232
[35] A novel ant colony optimization based on game for traveling salesman problem
Yang, Kang
You, Xiaoming
Liu, Shen
Pan, Han
[J]. APPLIED INTELLIGENCE, 2020, 50 (12) : 4529 - 4542
[36] Ant Colony Optimization for the Traveling Salesman Problem Based on Ants with Memory
Li, Bifan
Wang, Lipo
Song, Wu
[J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 496 - +
[37] An Orientation Assignment Heuristic to the Dubins Traveling Salesman Problem
Macharet, Douglas G.
Campos, Mario F. M.
[J]. ADVANCES IN ARTIFICIAL INTELLIGENCE (IBERAMIA 2014), 2014, 8864 : 457 - 468
[38] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
LIN, S
KERNIGHAN, BW
[J]. OPERATIONS RESEARCH, 1973, 21 (02) : 498 - 516
[39] New heuristic algorithms for the Dubins traveling salesman problem
Babel, Luitpold
[J]. JOURNAL OF HEURISTICS, 2020, 26 (04) : 503 - 530
[40] Study on a new heuristic crossover for the traveling salesman problem
Hu, Qiaohua
Wu, Huaiyu
Chen, Qiaoli
Chen, Yuan
[J]. 2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 495 - +

← 1 2 3 4 5 →