License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2019.7
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11419/
Go to the corresponding OASIcs Volume Portal

Müller-Hannemann, Matthias ; Rückert, Ralf ; Schmidt, Sebastian S.

Vehicle Capacity-Aware Rerouting of Passengers in Delay Management

pdf-format:
OASIcs-ATMOS-2019-7.pdf (0.5 MB)

Abstract

Due to the significant growth in passenger numbers, higher vehicle load factors and crowding become more and more of an issue in public transport. For safety reasons and because of an unsatisfactory discomfort, standing of passengers is rather limited in high-speed long-distance trains. In case of delays and (partially) cancelled trains, many passengers have to be rerouted. State-of-the-art rerouting merely focuses on minimizing delay at the destination of affected passengers but neglects limited vehicle capacities and crowding. Not considering capacities allows using highly efficient shortest path algorithms like RAPTOR or the connection scan algorithm (CSA).
In this paper, we study the more complicated scenario where passengers compete for scarce capacities. This can be modeled as a piece-wise linear, convex cost multi-source multi-commodity unsplittable flow problem where each passenger group which has to be rerouted corresponds to a commodity. We compare a path-based integer linear programming (ILP) model with a heuristic greedy approach. In experiments with instances from German long-distance train traffic, we quantify the importance of considering vehicle capacities in case of train cancellations. We observe a tradeoff: The ILP approach slightly outperforms the greedy approach and both are much better than capacity unaware rerouting in quality, while the greedy algorithm runs more than three times faster.

BibTeX - Entry

@InProceedings{mllerhannemann_et_al:OASIcs:2019:11419,
  author =	{Matthias M{\"u}ller-Hannemann and Ralf R{\"u}ckert and Sebastian S. Schmidt},
  title =	{{Vehicle Capacity-Aware Rerouting of Passengers in Delay Management}},
  booktitle =	{19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)},
  pages =	{7:1--7:14},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-128-3},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{75},
  editor =	{Valentina Cacchiani and Alberto Marchetti-Spaccamela},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11419},
  doi =		{10.4230/OASIcs.ATMOS.2019.7},
  annote =	{Keywords: Delay management, passenger flows, vehicle capacities, rerouting}
}

Keywords: Delay management, passenger flows, vehicle capacities, rerouting
Collection: 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)
Issue Date: 2019
Date of publication: 15.11.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI