Fast approaches to robust railway timetabling

OpenAccess Series in Informatics

Volumn 7, Issue , 2007, Pages 142-157

  Fischetti, Matteo ^a   Salvagnin, Domenico ^a   Zanette, Arrigo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Integer programming; Robust optimization; Robustness; Stochastic programming; Timetabling

Indexed keywords

MIXED INTEGER PROGRAMMING (MIP); OBJECTIVE FUNCTIONS; OPERATIONAL CONSTRAINTS; OPTIMIZATION TECHNIQUES; RAILWAY TIMETABLING; ROBUST OPTIMIZATION; TIMETABLING; TRAIN TIMETABLING PROBLEM;

ALGORITHMS; INTEGER PROGRAMMING; RAILROAD TRANSPORTATION; RAILROADS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING; STOCHASTIC PROGRAMMING;

OPTIMIZATION;

EID: 84883015635     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. R. Birge and F. Louveaux. Introduction to Stochastic Programming (Springer Series in Operations Research and Financial Engineering). Springer, 1st ed. 1997. corr. 2nd printing edition, 2000.
2. A. Caprara, M. Fischetti, and P. Toth. Modeling and solving the train timetabling problem. Operations Research, 50(5):851-861, 2002.
3. M. Fischetti and M. Monaci. Robust optimization through branch-and-price. In AIRO Proceedings, Cesena, September 12-15 2006.
4. ILOG Inc. ILOG CPLEX 10.1 User's Manual, 2007.
5. A. J. Kleywegt, A. Shapiro, and T. Homem-de Mello. The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization, 12(2):479-502, 2002.
6. L. Kroon, R. Dekker, and M. Vromans. Cyclic railway timetabling: a stochastic optimization approach. Research Paper ERS; ERS-2005-051-LIS, Erasmus Research Institute of Management (ERIM), RSM Erasmus University, Oct. 2005. available at http://ideas.repec.org/p/dgr/eureri/30007581.html.
7. J. Linderoth, A. Shapiro, and S. Wright. The empirical behavior of sampling methods for stochastic programming. Annals of Operations Research, 142(1):215-241, February 2006.
8. W. L. Loh. On latin hypercube sampling. The Annals of Statistics, 24(5), 1996.
9. W. K. Mak, D. P. Morton, and R. K. Wood. Monte carlo bounding techniques for determining solution quality in stochastic programs. Operations Research Letters, 24(24):10, February 1999.
10. A. Ruszczynski and A. Shapiro, editors. Stochastic Programming (Hanbooks in Operations Research and Management Series). Elsevier Publishing Company, 2003.
11. P. Serafini and W. Ukovich. A mathematical model for periodic scheduling problems. SIJDM: SIAM Journal on Discrete Mathematics, 2, 1989.
12. A. Shapiro. Monte carlo sampling approach to stochastic programming. In ESAIM: Proceedings, volume 13, pages 65-73, December 2003.
13. B. Verweij, S. Ahmed, A. J. Kleywegt, G. Nemhauser, and A. Shapiro. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl., 24, 2003.