The railway traveling salesman problem

Authors:
Georgia Hadjicharalambous;Petrica Pop;Evangelia Pyrga;George Tsaggouris;Christos Zaroliagis
Affiliations:
Computer Technology Institute, Patras, Greece;Computer Technology Institute, Patras, Greece;Computer Technology Institute, Patras, Greece and Dept of Computer Eng. & Informatics, University of Patras, Patras, Greece;Computer Technology Institute, Patras, Greece and Dept of Computer Eng. & Informatics, University of Patras, Patras, Greece;Computer Technology Institute, Patras, Greece and Dept of Computer Eng. & Informatics, University of Patras, Patras, Greece
Venue:
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Year:
2004

Citing 1
Cited 2

Dijkstra's algorithm on-line: an empirical case study from public railroad transport

Journal of Experimental Algorithmics (JEA)

A new approach to generalized network design problems

EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
A new approach to generalized network design problems

EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider theRailwayTraveling SalesmanProblem(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.