OASIcs.ATMOS.2005.660.pdf
- Filesize: 243 kB
- 16 pages
Document
Line Planning with Minimal Traveling Time
Authors
-
Part of:
Volume:
5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (ATMOS 2005)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2006-08-09
Cite AsGet BibTex
Anita Schöbel and Susanne Scholl. Line Planning with Minimal Traveling Time. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/OASIcs.ATMOS.2005.660
https://doi.org/10.4230/OASIcs.ATMOS.2005.660
Abstract
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.
Keywords
- Line planning
- real-world problem
- integer programming
- Dantzig-Wolfe decomposition
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads