The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2011 vol.60)
pp: 433-446
Gianlorenzo D'Angelo , University of L'Aquila, L'Aquila
Gabriele Di Stefano , University of L'Aquila, L'Aquila
Alfredo Navarra , University of Perugia, Perugia
Cristina M. Pinotti , University of Perugia, Perugia
ABSTRACT
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the scheduled activities in order to be "prepared” if a delay occurs, and absorb it without the necessity of rescheduling all the activities from scratch. This realizes the concept of designing robust timetables. During the planning phase, one should also consider recovery features that might be applied at runtime if disruptions occur. This leads to the concept of recoverable robust timetables. In this new concept, it is assumed that recovery capabilities are given as input along with the possible disruptions that must be considered. The main objective is the minimization of the overall needed time. The quality of a robust timetable is measured by the price of robustness, i.e., the ratio between the cost of the robust timetable and that of a nonrobust optimal timetable. We show that finding an optimal solution for this problem is NP-hard even though the topology of the network, which models dependencies among activities, is restricted to trees. However, we manage to design a paeudopolynomial time algorithm based on dynamic programming and apply it on both random networks and real case scenarios provided by Italian railways. We evaluate the effect of robustness on the scheduling of the activities and provide the price of robustness with respect to different scenarios. We experimentally show the practical effectiveness and efficiency of the proposed algorithm.
INDEX TERMS
Timetable, scheduling activities, robustness, price of robustness, combinatorial optimization, dynamic programming.
CITATION
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti, "Recoverable Robust Timetables: An Algorithmic Approach on Trees", IEEE Transactions on Computers, vol.60, no. 3, pp. 433-446, March 2011, doi:10.1109/TC.2010.142
REFERENCES
[1] http://informatica.ing.univaq.it/miscTimetablingTree2009 /, 2010.
[2] S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra, "Robust Algorithms and Price of Robustness in Shunting Problems," Proc. Seventh Workshop Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS '07), pp. 175-190, 2007.
[3] S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra, "Delay Management Problem: Complexity Results and Robust Algorithms," Proc. Second Ann. Int'l Conf. Combinatorial Optimization and Applications (COCOA), pp. 458-468, 2008.
[4] S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra, "Recoverable Robust Timetabling: Complexity Results and Algorithms," J. Combinatorial Optimization, vol. 18, no. 3, pp. 229-257, 2009.
[5] S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, and A. Schöbel, "Recoverable Robustness in Shunting and Timetabling," Robust and Online Large-Scale Optimization—Models and Techniques for Transportation Systems, pp. 28-60, Springer, 2009.
[6] G. D'Angelo, G. Di Stefano, and A. Navarra, "Evaluation of Recoverable-Robust Timetables on Tree Networks," Proc. 20th Int'l Workshop Combinatorial Algorithms (IWOCA), pp. 24-35, 2009.
[7] G. D'Angelo, G. Di Stefano, and A. Navarra, "Recoverable-Robust Timetables for Trains on Single-Line Corridors," Proc. Third Int'l Seminar on Railway Operations Modelling and Analysis (RailZurich), 2009.
[8] G. D'Angelo, G. Di Stefano, A. Navarra, and C.M. Pinotti, "Recoverable Robust Timetabling on Trees," Proc. Third Ann. Int'l Conf. Combinatorial Optimization and Applications (COCOA), pp. 451-462, 2009.
[9] L. De Giovanni, G. Heilporn, and M. Labbé, "Optimization Models for the Delay Management Problem in Public Transportation," European J. Operational Research, vol. 189, no. 3, pp. 762-774, 2007.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
[11] M. Gatto, R. Jacob, L. Peeters, and P. Widmayer, "Online Delay Management on a Single Train Line," Proc. Fourth Workshop Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS '04), F. Geraets, L. Kroon, A. Schöbel, D. Wagner, and C.D. Zaroliagis, eds., pp. 306-320, 2007.
[12] A. Ginkel and A. Schöbel, "The Bicriteria Delay Management Problem," Transportation Science, vol. 41, no. 4, pp. 527-538, 2007.
[13] F.K. Levy, G.L. Thompson, and J.D. Wies, The ABCs of the Critical Path Method. Graduate School of Business Administration, Harvard Univ., 1963.
[14] C. Liebchen, M. Lüebbecke, R.H. Möhring, and S. Stiller, "The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications," Robust and Online Large-Scale Optimization—Models and Techniques for Transportation Systems, pp. 1-27, Springer, 2009.
[15] A. Schöbel, "A Model for the Delay Management Problem Based on Mixed Integer Programming," Electronic Notes on Theoretical Computer Science, vol. 50, no. 1, pp. 1-10, 2004.
[16] A. Schöbel, "Integer Programming Approaches for Solving the Delay Management Problem," Proc. Fourth Workshop Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS '04), F. Geraets, L. Kroon, A. Schöbel, D. Wagner, and C.D. Zaroliagis, eds., pp. 145-170, 2007.
[17] P. Serafini and W. Ukovich, "A Mathematical Model for Periodic Scheduling Problems," SIAM J. Discrete Math., vol. 2, no. 4, pp. 550-581, 1989.
[18] Trenitalia, http:/www.trenitalia.com/, 2010.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool