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 条
  • [1] A new and efficient ant-based heuristic method for solving the traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    [J]. EXPERT SYSTEMS, 2003, 20 (04) : 179 - 186
  • [2] Ant-Based System Analysis on the Traveling Salesman Problem Under Real-World Settings
    Crisan, Gloria Cerasela
    Nechita, Elena
    Palade, Vasile
    [J]. COMBINATIONS OF INTELLIGENT METHODS AND APPLICATIONS (CIMA 2014), 2016, 46 : 39 - 59
  • [3] An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman Problem
    Du, Pengzhen
    Liu, Ning
    Zhang, Haofeng
    Lu, Jianfeng
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2021, 2021
  • [4] The railway traveling salesman problem
    Hadjicharalambous, Georgia
    Pop, Petrica
    Pyrga, Evangelia
    Tsaggouris, George
    Zaroliagis, Christos
    [J]. ALGORITHMIC METHODS FOR RAILWAY OPTIMIZATION, 2007, 4359 : 264 - 275
  • [5] An ant-based technique for the dynamic generalized travelling salesman problem
    Pintea, Camelia M.
    Pop, Petrica C.
    Dumitrescu, D.
    [J]. PROCEEDINGS OF THE 7TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS THEORY AND SCIENTIFIC COMPUTATION (ISTACS'07), 2007, : 257 - +
  • [6] Bi-heuristic ant colony optimization-based approaches for traveling salesman problem
    Nizar Rokbani
    Raghvendra Kumar
    Ajith Abraham
    Adel M. Alimi
    Hoang Viet Long
    Ishaani Priyadarshini
    Le Hoang Son
    [J]. Soft Computing, 2021, 25 : 3775 - 3794
  • [7] Bi-heuristic ant colony optimization-based approaches for traveling salesman problem
    Rokbani, Nizar
    Kumar, Raghvendra
    Abraham, Ajith
    Alimi, Adel M.
    Long, Hoang Viet
    Priyadarshini, Ishaani
    Son, Le Hoang
    [J]. SOFT COMPUTING, 2021, 25 (05) : 3775 - 3794
  • [8] A heuristic for the traveling salesman problem based on a continuous approximation
    del Castillo, JM
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1999, 33 (02) : 123 - 152
  • [9] A NEW HEURISTIC FOR TRAVELING SALESMAN PROBLEM BASED ON LCO
    Yokoyama, Soichiro
    Suzuki, Ikuo
    Yamamoto, Masahito
    Furukawa, Masashi
    [J]. PROCEEDINGS OF THE ASME/ISCIE INTERNATIONAL SYMPOSIUM ON FLEXIBLE AUTOMATION, ISFA 2012, 2013, : 345 - 350
  • [10] Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem
    Li, Wei
    Wang, Cancan
    Huang, Ying
    Cheung, Yiu-ming
    [J]. APPLIED SOFT COMPUTING, 2023, 133
12345