2026-07-20T01:07:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:660 2024-03-06T10:28:20Z ddc:004 open_access

Line Planning with Minimal Traveling Time Schöbel, Anita Scholl, Susanne Line planning real-world problem integer programming Dantzig-Wolfe decomposition 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anita Schöbel and Susanne Scholl 2006 Is Part Of OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2005.660 urn:nbn:de:0030-drops-6601 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005.660 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode