Talks and Poster Presentations (with Proceedings-Entry):
I. Grujicic, G. Raidl, A. Schöbel:
"Variable neighbourhood search for integrated timetable design of railway infrastructure.";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
- 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search",
B. Jarboui, A. Sifaleras, A. Rebai (ed.);
Elsevier Electronic Notes in Discrete Mathematics,
In this paper we deal with the problem of building new or extending an existing railway infrastructure. The goal is to determine a minimum cost infrastructure ful lling the requirements de ned by an integrated timetable and the operation of the railway system. We rst model this planning task as a combinatorial network optimization problem, capturing the essential aspects. We then present a metaheuristic solution method based on general variable neighborhood search that makes use of a dynamic programming procedure for realizing individual connections. Computational experiments indicate that the suggested approach is promising and the analysis of obtained results gives useful hints for future work in this area.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.