2026-07-25T20:53:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1175 2024-03-06T10:28:29Z ddc:004 open_access

12. Robust Algorithms and Price of Robustness in Shunting Problems Cicerone, Serafino D'Angelo, Gianlorenzo Di Stefano, Gabriele Frigioni, Daniele Navarra, Alfredo 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Serafino Cicerone and Gianlorenzo D'Angelo and Gabriele Di Stefano and Daniele Frigioni and Alfredo Navarra 2007 Is Part Of OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2007.1175 urn:nbn:de:0030-drops-11755 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1175 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode