Optimal real-time traffic control in metro stations

Operations Research

Volumn 57, Issue 4, 2009, Pages 1026-1039

  Mannino, Carlo ^a   Mascis, Alessandro ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b BOMBARDIER TRANSPORTATION   (Sweden)

Author keywords

Scheduling; Transportation: Routing

Indexed keywords

BRANCH AND BOUNDS; COMPUTATIONAL TESTING; CONVEX COST; JOB SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; METRO STATIONS; MUNICIPAL TRANSPORT; NO-WAIT; OPTIMALITY; OPTIMIZATION METHOD; OPTIMUM SCHEDULE; RAILWAY STATIONS; REAL ENVIRONMENTS; REAL-TIME TRAFFIC CONTROL; SPEED-UPS; TRAIN MOVEMENT;

CONTROL THEORY; LINEAR PROGRAMMING; LOCOMOTIVES; RAILROAD CARS; SUBWAY STATIONS;

AIR TRAFFIC CONTROL;

EID: 69949109733     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0642     Document Type: Article

References (43)

1. Adenso-Díaz, B., M. O. González, P. González-Torre. 1999. On-line timetable re-scheduling in regional train services. Transportation Res., Part B 33 387-398.
2. Ahuja, R. K., D. S. Hochbaum, J. B. Orlin. 2003. Solving the convex cost integer dual network flow problem. Management Sci. 49(7) 950-964.
3. Ahuja, R. K., D. S. Hochbaum, J. B. Orlin. 2004. A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem. Algorithmica 39 189-208.
4. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice-Hall, Englewood Cliffs, NJ.
5. Applegate, D., W. Cook. 1991. A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2) 149-156.
6. Baker, K. R., G. D. Scudder. 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38(1) 22-36.
7. Balas, E. 1969. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Oper. Res. 17(6) 941-957.
8. Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
9. Balas, E. 1985. On the facial structure of scheduling polyhedra. Math. Programming 24 179-218.
10. Baptiste, P., M. Flammini, F. Sourd. 2008. Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35 906-915.
11. Brännlund, U., P. O. Lindberg, A. Nou, J.-E. Nilsson. 1998. Railway timetabling using Lagrangian relaxation. Transportation Sci. 32(4) 358-369.
12. Brucker, P. S., J. Heitmann, H. T. Nieberg. 2006. Job-shop scheduling with limited capacity buffers. OR Spectrum 28 151-176.
13. Burkolter, D. M. 2005. Capacity of railways in station areas using Petri nets. Ph.D. thesis, Swiss Federal Institute of Technology, Zurich.
14. Burkolter, D. M., T. Herrmann, G. Caimi. 2005. Generating dense railway schedules. A. Jaszkiewicz, M. Kaczmarek, J. Zak, M. Kubiak, eds. Advanced OR and AI Methods in Transportation. Publishing House of Poznan University of Technology, Poznan, Poland, 290-297.
15. Caimi, G., D. M. Burkolter, T. Herrmann. 2004. Finding delay-tolerant train routings through stations. H. Fleuren, ed. Operations Research Proceedings. Springer, Berlin, 136-143.
16. Caprara, A., M. Fischetti, P. Toth. 2002. Modeling and solving the train timetabling problem. Oper. Res. 50(5) 851-861.
17. Carey, M., S. Carville. 2003. Scheduling and platforming trains at busy complex stations. Transportation Res., Part A 37 195-224.
18. Chretienne, P., F. Sourd. 2003. PERT scheduling with convex cost function. Theoret. Comput. Sci. 292 145-164.
19. COMBINE 2. 2004. Enhanced control centers for fixed and moving block signalling systems. IST-2001-34705, final report, February.
20. de Oliveira, E. S. 2001. Solving single-track railway scheduling problem using constraint programming. Ph.D. thesis, University of Leeds, Leeds, UK.
21. Dorfman, M. J., J. Medanic. 2004. Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Res., Part B 38 81-98.
22. Dyer, M., L. Wolsey. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26(2-3) 255-270.
23. Ferraro, F. 2002. Train placing problem. Master's thesis, University of Genova, Italy (in Italian).
24. Garey, M. R., D. S. Johnson. 1979. Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco.
25. Goldberg, A. V. 1997. An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms 22 1-29.
26. Goldberg, A. V., R. Tarjan. 1990. Finding minimum cost circulation by successive approximation. Math. Oper. Res. 15 430-466.
27. Kraay, D. R., P. T. Harker. 1995. Real-time scheduling of freight railroads. Transportation Res., Part B 29 213-229.
28. Kraay, D. R., P. T. Harker, B. Chen. 1991. Optimal pacing of trains in freight railroads: Model formulation and solution. Oper. Res. 39(1) 82-99.
29. Lancia, G., F. Rinaldi, P. Serafini. 2007. A compact optimization approach for job-shop problems. Proc. MISTA 2007, 3rd Multidisciplinary Internat. Scheduling: Theory Appl. Conf., Paris, 293-300.
30. Mascis, A. 1997. Optimization and simulation models applied to railway traffic. Ph.D. thesis, University of Rome "La Sapienza," Rome, Italy (in Italian).
31. Mascis, A., D. Pacciarelli. 2002. Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3) 498-517.
32. Mazzarello, M., E. Ottaviani. 2007. A traffic management system for realtime traffic optimisation in railways. Transportation Res., Part B 41 246-274.
33. Nemhauser, G., L. L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
34. Neumann, K., C. Schwindt, J. Zimmermann. 2005. Project Scheduling with Time Windows and Scarce Resources. Springer Verlag, Berlin.
35. Queyranne, M., A. S. Schulz. 1994. Polyhedral approaches to machine scheduling. Technical Report 408/1994, Technische Universitat Berlin.
36. Rinaldi, F., G. Lancia, P. Serafini. 2007. Private communication. October.
37. Rockafellar, R. T. 1984. Network Flows and Monotropic Optimization. John Wiley & Sons, New York.
38. Roy, B., B. Sussmann. 1964. Les Problemes d'ordonnancement avec contraintes disjonctives. Société d'Encouragement aux Métiers d'Art (SEMA), Note D.S., No.9, Paris.
39. Şahin, L 1999. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Res., Part B 33 511-534.
40. Vanhoucke, M., E. Demeulemeester, W. Herroelen. 2001. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Ann. Oper. Res. 102 179-196.
41. Zwaneveld, P. J. 1997. Railway planning. Ph.D. thesis, Rotterdam School of Management, TRAIL, Rotterdam, The Netherlands.
42. Zwaneveld, P. J., L. G. S. Kroon, S. P. M. Van Hoesel. 2001. Routing trains through railway stations based on a node packing model. Eur. J. Oper. Res. 128 14-53.
43. Zwaneveld, P. J., L. G. S. Kroon, H. E. Romeijn, M. Salomon, S. Dauzere- Peres, S. P. M. Van Hoesel, H. W. Ambergen. 1996. Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30(3) 181-194.