In this paper we provide efficient robust algorithms for shunting problems concerning the reordering of train cars over a hump. In particular, we study algorithms able to cope with small disruptions, as temporary and local availability and/or malfunctioning of key resources that can occur and affect planned operations. To this aim, a definition of robust algorithm is provided. Performances of the proposed algorithms are measured by the notion of price of robustness. Various scenarios are considered, and interesting results are presented.
@InProceedings{cicerone_et_al:OASIcs.ATMOS.2007.1175, author = {Cicerone, Serafino and D'Angelo, Gianlorenzo and Di Stefano, Gabriele and Frigioni, Daniele and Navarra, Alfredo}, title = {{12. Robust Algorithms and Price of Robustness in Shunting Problems}}, booktitle = {7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}, pages = {175--190}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-04-0}, ISSN = {2190-6807}, year = {2007}, volume = {7}, editor = {Ahuja, Ravindra K. and Liebchen, Christian and Mesa, Juan A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1175}, URN = {urn:nbn:de:0030-drops-11755}, doi = {10.4230/OASIcs.ATMOS.2007.1175}, annote = {Keywords: } }
Feedback for Dagstuhl Publishing