Robust line planning in case of multiple pools and disruptions
From MaRDI portal
Publication:2999331
DOI10.1007/978-3-642-19754-3_6zbMATH Open1325.90023arXiv1101.2770OpenAlexW1843852306MaRDI QIDQ2999331FDOQ2999331
Authors: Apostolos Bessas, Spyros Kontogiannis, Christos Zaroliagis 
Publication date: 12 May 2011
Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)
Abstract: We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function per pool. We conduct an experimental study of our mechanism on both synthetic and real-world data that shows fast convergence to the optimum. We also explore a wide range of scenarios, varying from an arbitrary initial state (to be solved) to small disruptions in a previously optimal solution (to be recovered). Our experiments with the latter scenario show that our mechanism can be used as an online recovery scheme causing the system to re-converge to its optimum extremely fast.
Full work available at URL: https://arxiv.org/abs/1101.2770
Recommendations
- Incentive-compatible robust line planning
- Robust line planning under unknown incentives and elasticity of frequencies
- Integrating Robust Railway Network Design and Line Planning under Failures
- Effective allocation of fleet frequencies by reducing intermediate stops and short turning in transit systems
- Models for line planning in public transport
Cited In (3)
This page was built for publication: Robust line planning in case of multiple pools and disruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999331)
