Show simple item record

Line Planning with Minimal Traveling Time

dc.contributor.authorSchöbel, Anita
dc.contributor.authorScholl, Susanne
dc.contributor.editorKroon, Leo G.
dc.contributor.editorMöhring, Rolf H.
dc.date.accessioned2010-11-16T09:05:21Z
dc.date.available2010-11-16T09:05:21Z
dc.date.issued2006
dc.identifier.urihttp://resolver.sub.uni-goettingen.de/purl?gs-1/5719
dc.description.abstractAn 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.
dc.format.extent1-3
dc.language.isoeng
dc.publisherInternationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl
dc.relation.ispartofATMOS 2005 - 5th Workshop on Algorithmic Methods and Models for Optimization of Railways
dc.rightsopenAccess
dc.rights.urihttp://goedoc.uni-goettingen.de/goescholar/License_Goedoc_2009_03.txt
dc.subjectLine planning; real-world problem; integer programming; Dantzig-Wolfe decomposition
dc.subject.ddc510
dc.titleLine Planning with Minimal Traveling Time
dc.typeanthologyArticle
dc.type.versionsubmittedVersion
dc.type.subtypeanthologyArticle
dc.description.statuspeerReviewed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record