The railway traveling salesman problem

被引：0

作者：

Hadjicharalambous, Georgia ^{[1
]}

Pop, Petrica ^{[1
]}

Pyrga, Evangelia ^{[1
]}

Tsaggouris, George ^{[1
]}

Zaroliagis, Christos ^{[1
]}

机构：

[1] Comp Technol Inst, GR-26110 Patras, Greece

来源：

ALGORITHMIC METHODS FOR RAILWAY OPTIMIZATION | 2007年 / 4359卷

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider the Railway Traveling Salesman Problem (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 as goal to minimize the overall time of the journey. RTSP is an NP-hard problem. Although it is related to the Generalized Asymmetric Traveling Salesman Problem, in this paper we follow a direct approach and present a modelling of RTSP as an integer linear program based on the directed graph resulted from the timetable information. Since this graph can be very large, we also show how to reduce its size without sacrificing correctness. Finally, we conduct an experimental study with real-world and synthetic data that demonstrates the superiority of the size reduction approach.

引用

页码：264 / 275

页数：12

共 50 条

[1] A CUTTING PLANE APPROACH TO SOLVE THE RAILWAY TRAVELING SALESMAN PROBLEM
Pop, Petrica C.
Zaroliagis, Christos D.
Hadjicharalambous, Georgia
[J]. STUDIA UNIVERSITATIS BABES-BOLYAI MATHEMATICA, 2008, 53 (01): : 63 - 73
[2] An ant-based heuristic for the railway traveling salesman problem
Pop, Petrica C.
Pintea, Camelia M.
Sitar, Corina Pop
[J]. APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 702 - +
[3] The traveling salesman problem
Punnen, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 295 - 296
[4] The traveling salesman problem
Bangert, Patrick D.
[J]. JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2007, 51 (06) : 401 - 402
[5] The traveling salesman problem
Gutin, Gregory
Punnen, Abraham
[J]. DISCRETE OPTIMIZATION, 2006, 3 (01) : 1 - 1
[6] TRAVELING SALESMAN PROBLEM
GROTSCHEL, M
PADBERG, MW
[J]. OPERATIONS RESEARCH, 1975, 23 : B298 - B298
[7] Solving the clustered traveling salesman problem via traveling salesman problem methods
Lu, Yongliang
Hao, Jin-Kao
Wu, Qinghua
[J]. PEERJ COMPUTER SCIENCE, 2022, 7
[8] An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
Dimitrijevic, V
Saric, Z
[J]. INFORMATION SCIENCES, 1997, 102 (1-4) : 105 - 110
[9] THE REDUCIBILITY OF THE GENERALIZED TRAVELING SALESMAN PROBLEM TO THE TRAVELING SALESMAN PROBLEM OF SMALLER DIMENSION
RUBINOV, AR
[J]. DOKLADY AKADEMII NAUK SSSR, 1982, 264 (05): : 1087 - 1090
[10] TRANSFORMATION OF THE GENERALIZED TRAVELING-SALESMAN PROBLEM INTO THE STANDARD TRAVELING-SALESMAN PROBLEM
LIEN, YN
MA, E
WAH, BWS
[J]. INFORMATION SCIENCES, 1993, 74 (1-2) : 177 - 189

← 1 2 3 4 5 →