08. Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit

Authors Ingmar Steinzen, Leena Suhl, Natalia Kliewer



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2007.1167.pdf
  • Filesize: 289 kB
  • 17 pages

Document Identifiers

Author Details

Ingmar Steinzen
Leena Suhl
Natalia Kliewer

Cite AsGet BibTex

Ingmar Steinzen, Leena Suhl, and Natalia Kliewer. 08. Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit. In 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07). Open Access Series in Informatics (OASIcs), Volume 7, pp. 107-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/OASIcs.ATMOS.2007.1167

Abstract

We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods for vehicle and crew scheduling in such cases usually produce schedules that contain irregularities which are not desirable especially from the point of view of the bus drivers. We propose a solution method which improves regularity while partially integrating the vehicle and crew scheduling problems. The approach includes two phases: first we solve the LP relaxation of a set partitioning formulation, using column generation together with Lagrangean relaxation techniques. In a second phase we generate integer solutions using a new combination of local branching and various versions of follow-on branching. Numerical tests with artificial and real instances show that regularity can be improved significantly with no or just a minor increase of costs.

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail