Timetabling optimization of a single railway track line with sensitivity analysis

TOP

Volumn 17, Issue 2, 2009, Pages 256-287

  Castillo, Enrique ^a,b   Gallego, Inmaculada ^b   Ureña, José María ^b   Coronado, José María ^b  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

Bisection method; Global optimum; Railways; Sensitivity analysis; Single track; Train timetabling

Indexed keywords

EID: 74649084851     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-008-0057-0     Document Type: Article

References (52)

1. Adenso-Diaz B, González MO, González-Torre P (1999) On-line timetable re-scheduling in regional train services. Transp Res Part B 33(6): 387-398.
2. Amit I, Goldfarb D (1971) The timetable problem for railways. Dev Oper Res 2: 379-387.
3. Assad A (1980) Models for rail transportation. Transp Res Part A 14(3): 205-220.
4. Brannlund U, Lindberg PO, Nou A, Nilsson JE (1998) Railway timetabling using Lagrangian relaxation. Transp Sci 32(4): 358-369.
5. Cai X, Goh CJ, Mees AI (1998) Greedy heuristics for rapid scheduling of trains on a single track. IIE Trans 30(5): 481-493.
6. Caprara A, Fischetti M, Toth P (2002) Modeling and solving the train timetabling problem. Oper Res 50(5): 851-861.
7. Caprara A, Kroon L, Monaci M, Peeters M, Toth P (2006) Passenger railway optimization. In: Barnhart, C, Laporte, G (eds) Handbooks in operations research and management science, vol 14, pp 129-187.
8. Carey M (1994a) A model and strategy for train pathing with choice of lines, platforms and routes. Transp Res Part B 28(5): 333-353.
9. Carey M (1994b) Extending a train pathing model from one-way to two-way track. Transp Res Part B 28(5): 395-400.
10. Carey M, Lockwood D (1995) A model, algorithms and strategy for train pathing. J Oper Res Soc 46(8): 988-1005.
11. Castillo E, Cobo A, Jubete F, Pruneda RE, Castillo C (2000) An orthogonally based pivoting transformation of matrices and some applications. SIAM J Matrix Anal Appl 22: 666-681.
12. Castillo E, Conejo A, Pedregal P, García R, Alguacil N (2001) Building and solving mathematical programming models in engineering and science. Pure and applied mathematics. Wiley, New York.
13. Castillo E, Jubete F, Pruneda RE, Solares C (2002) Obtaining simultaneous solutions of linear subsystems of equations and inequalities. Linear Algebra Appl 346: 131-154.
14. Castillo E, Hadi AS, Conejo A, Fernández-Canteli A (2004) A General Method for local sensitivity analysis with application to regression models and other optimization problems. Technometrics 46(4): 430-444.
15. Castillo E, Conejo A, Mínguez R, Castillo C (2006a) A closed formula for local sensitivity analysis in mathematical programming. Eng Optim 38: 93-112.
16. Castillo E, Conejo A, Castillo C, Mínguez R, Ortigosa D (2006b) A perturbation approach to sensitivity analysis in nonlinear programming. J Optim Theory Appl 128(1): 49-74.
17. Castillo E, Conejo AJ, Castillo C, Mínguez R (2007) Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems. TOP 15(2): 355-371.
18. Conejo A, Castillo E, Mínguez R, García-Bertrand R (2006) Decomposition techniques in mathematical programming. Engineering and science applications. Springer, Berlin.
19. Chen B, Harker PT (1990) Two moments estimation of the delay on single-track rail lines with scheduled traffic. Transp Sci 24(4): 261-275.
20. Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transp Sci 32(4): 380-404.
21. D'Ariano A, Pranzo M 2004. A real time train dispatching system based on blocking time theory. In: Proceedings of the 8th TRAIL 8th annual congress 2004, a world of transport, infrastructure and logistics, Delft, DUP Science, pp 129-152.
22. Dorfman MJ, Medanic J (2004) Scheduling trains on a railway network using a discrete event model of railway traffic. Transp Res Part B 38(1): 81-98.
23. Enevoldsen I (1994) Sensitivity analysis of reliability-based optimal solution. J Eng Mech, ASCE 120(1): 198-205.
24. Frank O (1965) Two-way traffic on a single line of railway. Oper Res 14: 801-811.
25. Ghoseiri K, Szidarovszky F, Asgharpour MJ (2004) A multi-objective train scheduling model and solution. Transp Res Part B 38: 927-952.
26. Greenberg HH (1968) A branch-and-bound solution to the general scheduling problem. Oper Res 16(2): 352-361.
27. Haghani AE (1987) Rail freight transportation: a review of recent optimization models for train routing and empty car distribution. J Adv Transp 21: 147-172.
28. Hellström P 1998. Analysis and evaluation of systems and algorithms for computer-aided train dispatching. Licentiate thesis, Uppsala University, Sweden.
29. Higgins A, Kozan E (1998) Modeling train delays in urban networks. Transp Sci 32(4): 346-357.
30. Higgins A, Kozan E, Ferreira L (1996) Optimal scheduling of trains on a single line track. Transp Res Part B 30(2): 147-161.
31. Iida Y 1988. Timetable preparation by A. I. approach. In: Proceeding of European simulation multiconference, Nice, France, pp 163-168.
32. Jia L-M, Zhang X-D (1993) Distributed intelligent railway traffic control based on fuzzy decision making. Fuzzy Sets Syst 62(3): 255-265.
33. Jovanovic D, Harker PT (1991) Tactical scheduling of rail operations: the SCAN I system. Transp Sci 25(1): 46-64.
34. Komaya K (1992) An integrated framework of simulation and scheduling in railway systems. In: Murthy TKS, Allan J, Hill RJ, Sciutto G, Sone S (eds) Management. Computers in railways III, vol 1. Computational Mechanics Publications, Southampton, pp 611-622.
35. Komaya K, Fukuda T 1991. A knowledge-based approach for railway scheduling. In: Proceedings of the seventh IEEE conference on artificial intelligence for applications. IEEE Comput Soc Press, pp 404-411.
36. Komaya K, Fukuda T (1989) ESTRAC-III: an expert system for train track control in disturbed situations. In: Perrin JP (ed) IFAC control, computers, communications in transportation, IFAC/IFIP/IFORS Symposium, Paris, France, 19-21 September 1989. International Federation of Automatic Control by Pergamon Press, Paris, pp 147-153.
37. Kraay D, Harker PT, Chen B (1991) Optimal pacing of trains in freight railroads: model formulation and solution. Oper Res 39: 82-99.
38. Kraay DR, Harker PT (1995) Real-time scheduling of freight railroads. Transp Res Part B 29(3): 213-229.
39. Petersen ER, Taylor AJ (1982) A structured model for rail line simulation and optimization. Transp Sci 16: 192-206.
40. Petersen ER, Taylor AJ, Martland CD (1986) An introduction to computer aided train dispatching. J Adv Transp 20: 63-72.
41. Rudd DA, Storry AJ 1976. Single track railway simulation, new models and old. Rail Int June, 335-342.
42. Sahin I (1999) Railway traffic control and train scheduling based on inter-train conflict management. Transp Res Part B 33(7): 511-534.
43. Schaefer H, Pferdmenges S 1994. An expert system for real-time train dispatching. Comput Railw (COMPRAIL) 94.
44. Sobiesky JS, Barthelemy JF, Riley KM (1982) Sensitivity of optimal solutions of problem parameters. AIAA J 20(9): 1291-1299.
45. Sorensen JD, Enevoldsen I (1992) Sensitivity Analysis in reliability-based shape optimization. In: Optimization and artificial intelligence in civil and structural engineering, vol I. Kluwer Academic, Netherlands, pp 617-637.
46. Szpigel B (1973) Optimal train scheduling on a single track railway. Operations research, vol 72, pp 343-352. North-Holland, Amsterdam.
47. Vansteenwegen P, van Oudheusden D (2007) Decreasing the passenger waiting time for an intercity rail network. Transp Res Part B 41: 478-492.
48. Vanderplaats G (1984) Numerical optimization techniques for engineering design with applications. McGraw-Hill, New York.
49. Vieira P, Neto LE, Bessa E, Gomide F 1999. Railway dispatch and control. In: Proceedings for NAFIPS-the 18th international conference of the North American fuzzy information processing society, pp 134-138.
50. Zhou X, Zhong M (2005) Bi-criteria train scheduling for high-speed passenger railroad planning applications. Eur J Oper Res 167(3): 752-771.
51. Zhou L, Hu S, Ma J, Yue Y 1998. Network hierarchy parallel algorithm of automatic train scheduling. In: Proceedings of the conference on traffic and transportation studies, ICTTS, pp 358-368.
52. Zhou X, Zhong M (2007) Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transp Res B 41: 320-341.