Integer programming approaches for solving the delay management problem

  • In the delay management problem we decide how to react in case of delays in public transportation. More specific, the question is if connecting vehicles should wait for delayed feeder vehicles or if it is better to depart in time. As objective we consider the convenience over all customers, expressed as the average delay of a customer when arriving at his destination.We present path-based and activity-based integer programming models for the delay management problem and show the equivalence of these formulations. Based on these, we present a simplification of the (cubic) activity-based model which results in an integer linear program. We identify cases in which this linearization is correct, namely if the so-called never-meet property holds. Fortunately, this property is often almost satisfied in our practical data. Finally, we show how to find an optimal solution in linear time in case of the never-meet property.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Anita Schöbel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13310
Document Type:Preprint
Language of publication:English
Year of Completion:2004
Year of Publication:2004
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2004/03/10
GND-Keyword:activity-based model; delay management problem; never-meet property
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581 $