Line Planning with Minimal Traveling Time
Citable Link (URL):http://resolver.sub.uni-goettingen.de/purl?gs-1/5719
First published (peer reviewed)In: Kroon, Leo G.; Möhring, Rolf H. (Eds.) ATMOS 2005 - 5th Workshop on Algorithmic Methods and Models for Optimization of Railways
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, 2006
An important strategic element in the planning process of public transportation is the development of a line concept, i.e. to find a set of paths for operating lines on them. So far, most of the models in the literature aim to minimize the costs or to maximize the number of direct travelers. In this paper we present a new approach minimizing the travel times over all customers including penalties for the transfers needed. This approach maximizes the comfort of the passengers and will make the resulting timetable more reliable. To tackle our problem we present integer programming models and suggest a solution approach using Dantzig-Wolfe decomposition for solving the LP-relaxation. Numerical results of real-world instances are presented.