IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v57y2009i4p1026-1039.html
   My bibliography  Save this article

Optimal Real-Time Traffic Control in Metro Stations

Author

Listed:
  • Carlo Mannino

    (Dip. Informatica e Sistemistica, Sapienza Università di Roma, Rome 00185, Italy)

  • Alessandro Mascis

    (Bombardier Transportation Italy S.P.A., 17047 Vado Ligure (SV), Italy)

Abstract

Train movements across railway stations are still operated by human dispatchers. Motivated by an application provided by Azienda Trasporti Milanesi (ATM), the major Italian municipal transport company, we developed a real-time automated traffic control system to operate trains in metro stations. The system optimally controls the trains in a metro station by identifying a suitable routing and by establishing an optimum schedule of the performed operations. For each candidate routing an instance of the blocking, no-wait job-shop scheduling problem with convex costs is solved to optimality by branch and bound. A new, effective lower bound is developed to speed up the enumeration process. Computational testing in a real environment proved that the algorithm is able to solve relevant practical instances within the very tight time limit imposed by the application. The system has been in operation in the Milan metro since July 2007. To our knowledge, this is the first example of successful application of optimization methods to real-time traffic control in metro stations.

Suggested Citation

  • Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    • Handle: RePEc:inm:oropre:v:57:y:2009:i:4:p:1026-1039
    DOI: 10.1287/opre.1080.0642
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1080.0642
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1080.0642?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    2. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    4. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
    6. Kraay, David R. & Harker, Patrick T., 1995. "Real-time scheduling of freight railroads," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 213-229, June.
    7. Ravindra K. Ahuja & Dorit S. Hochbaum & James B. Orlin, 2003. "Solving the Convex Cost Integer Dual Network Flow Problem," Management Science, INFORMS, vol. 49(7), pages 950-964, July.
    8. David Kraay & Patrick T. Harker & Bintong Chen, 1991. "Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution," Operations Research, INFORMS, vol. 39(1), pages 82-99, February.
    9. Zwaneveld, Peter J. & Kroon, Leo G. & van Hoesel, Stan P. M., 2001. "Routing trains through a railway station based on a node packing model," European Journal of Operational Research, Elsevier, vol. 128(1), pages 14-33, January.
    10. Carey, Malachy & Carville, Sinead, 2003. "Scheduling and platforming trains at busy complex stations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 195-224, March.
    11. Dorfman, M. J. & Medanic, J., 2004. "Scheduling trains on a railway network using a discrete event model of railway traffic," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 81-98, January.
    12. Egon Balas, 1969. "Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm," Operations Research, INFORMS, vol. 17(6), pages 941-957, December.
    13. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem," Annals of Operations Research, Springer, vol. 102(1), pages 179-196, February.
    14. Peter J. Zwaneveld & Leo G. Kroon & H. Edwin Romeijn & Marc Salomon & Stéphane Dauzère-Pérès & Stan P. M. Van Hoesel & Harrie W. Ambergen, 1996. "Routing Trains Through Railway Stations: Model Formulation and Algorithms," Transportation Science, INFORMS, vol. 30(3), pages 181-194, August.
    15. Mazzarello, Maura & Ottaviani, Ennio, 2007. "A traffic management system for real-time traffic optimisation in railways," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 246-274, February.
    16. Alberto Caprara & Matteo Fischetti & Paolo Toth, 2002. "Modeling and Solving the Train Timetabling Problem," Operations Research, INFORMS, vol. 50(5), pages 851-861, October.
    17. Andrew V. Goldberg & Robert E. Tarjan, 1990. "Finding Minimum-Cost Circulations by Successive Approximation," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 430-466, August.
    18. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jiateng Yin & Lixing Yang & Andrea D’Ariano & Tao Tang & Ziyou Gao, 2022. "Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3234-3258, November.
    2. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    3. Corman, F. & D’Ariano, A. & Pacciarelli, D. & Pranzo, M., 2012. "Optimal inter-area coordination of train rescheduling decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 71-88.
    4. Li, Shukai & Liu, Ronghui & Yang, Lixing & Gao, Ziyou, 2019. "Robust dynamic bus controls considering delay disturbances and passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 88-109.
    5. Veelenturf, L.P. & Kidd, M.P. & Cacchiani, V. & Kroon, L.G. & Toth, P., 2014. "A railway timetable rescheduling approach for handling large scale disruptions," ERIM Report Series Research in Management ERS-2014-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    6. Erfan Hassannayebi & Seyed Hessameddin Zegordi & Mohammad Reza Amin-Naseri & Masoud Yaghini, 2018. "Optimizing headways for urban rail transit services using adaptive particle swarm algorithms," Public Transport, Springer, vol. 10(1), pages 23-62, May.
    7. Corman, Francesco & D’Ariano, Andrea & Marra, Alessio D. & Pacciarelli, Dario & Samà, Marcella, 2017. "Integrating train scheduling and delay management in real-time railway traffic control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 213-239.
    8. Cacchiani, Valentina & Furini, Fabio & Kidd, Martin Philip, 2016. "Approaches to a real-world Train Timetabling Problem in a railway node," Omega, Elsevier, vol. 58(C), pages 97-110.
    9. Lamorgese, Leonardo & Mannino, Carlo & Natvig, Erik, 2017. "An exact micro–macro approach to cyclic and non-cyclic train timetabling," Omega, Elsevier, vol. 72(C), pages 59-70.
    10. Li, Shukai & Liu, Ronghui & Gao, Ziyou & Yang, Lixing, 2021. "Integrated train dwell time regulation and train speed profile generation for automatic train operations on high-density metro lines: A distributed optimal control method," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 82-105.
    11. Rajnish Kumar & Goutam Sen & Samarjit Kar & Manoj Kumar Tiwari, 2018. "Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach," Interfaces, INFORMS, vol. 48(6), pages 510-528, November.
    12. Xu, Peijuan & Corman, Francesco & Peng, Qiyuan & Luan, Xiaojie, 2017. "A train rescheduling model integrating speed management during disruptions of high-speed traffic under a quasi-moving block system," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 638-666.
    13. Vansteenwegen, Pieter & Dewilde, Thijs & Burggraeve, Sofie & Cattrysse, Dirk, 2016. "An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems," European Journal of Operational Research, Elsevier, vol. 252(1), pages 39-53.
    14. Meng, Lingyun & Zhou, Xuesong, 2014. "Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 208-234.
    15. Yuan, Yin & Li, Shukai & Yang, Lixing & Gao, Ziyou, 2022. "Real-time optimization of train regulation and passenger flow control for urban rail transit network under frequent disturbances," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    16. Li, Shukai & Dessouky, Maged M. & Yang, Lixing & Gao, Ziyou, 2017. "Joint optimal train regulation and passenger flow control strategy for high-frequency metro lines," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 113-137.
    17. David Canca & Eva Barrena & Gilbert Laporte & Francisco A. Ortega, 2016. "A short-turning policy for the management of demand disruptions in rapid transit systems," Annals of Operations Research, Springer, vol. 246(1), pages 145-166, November.
    18. Xu, Xiaoming & Li, Keping & Yang, Lixing, 2015. "Scheduling heterogeneous train traffic on double tracks with efficient dispatching rules," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 364-384.
    19. Li, Shukai & Zhou, Xuesong & Yang, Lixing & Gao, Ziyou, 2018. "Automatic train regulation of complex metro networks with transfer coordination constraints: A distributed optimal control framework," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 228-253.
    20. Allahverdi, Ali & Aydilek, Harun & Aydilek, Asiye, 2018. "No-wait flowshop scheduling problem with two criteria; total tardiness and makespan," European Journal of Operational Research, Elsevier, vol. 269(2), pages 590-601.
    21. Huang, Yeran & Mannino, Carlo & Yang, Lixing & Tang, Tao, 2020. "Coupling time-indexed and big-M formulations for real-time train scheduling during metro service disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 38-61.
    22. Lucas P. Veelenturf & Martin P. Kidd & Valentina Cacchiani & Leo G. Kroon & Paolo Toth, 2016. "A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 841-862, August.
    23. Sartor, Giorgio & Mannino, Carlo & Nygreen, Thomas & Bach, Lukas, 2023. "A MILP model for quasi-periodic strategic train timetabling," Omega, Elsevier, vol. 116(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrea D'Ariano & Francesco Corman & Dario Pacciarelli & Marco Pranzo, 2008. "Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time," Transportation Science, INFORMS, vol. 42(4), pages 405-419, November.
    2. Burdett, R.L. & Kozan, E., 2010. "A disjunctive graph model and framework for constructing new train schedules," European Journal of Operational Research, Elsevier, vol. 200(1), pages 85-98, January.
    3. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    4. Min, Yun-Hong & Park, Myoung-Ju & Hong, Sung-Pil & Hong, Soon-Heum, 2011. "An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 409-429, February.
    5. Leonardo Lamorgese & Carlo Mannino, 2015. "An Exact Decomposition Approach for the Real-Time Train Dispatching Problem," Operations Research, INFORMS, vol. 63(1), pages 48-64, February.
    6. Leonardo Lamorgese & Carlo Mannino & Mauro Piacentini, 2016. "Optimal Train Dispatching by Benders’-Like Reformulation," Transportation Science, INFORMS, vol. 50(3), pages 910-925, August.
    7. Li, Feng & Sheu, Jiuh-Biing & Gao, Zi-You, 2014. "Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 385-414.
    8. Leutwiler, Florin & Corman, Francesco, 2022. "A logic-based Benders decomposition for microscopic railway timetable planning," European Journal of Operational Research, Elsevier, vol. 303(2), pages 525-540.
    9. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    10. D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2007. "A branch and bound algorithm for scheduling trains in a railway network," European Journal of Operational Research, Elsevier, vol. 183(2), pages 643-657, December.
    11. Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.
    12. Flamini, Marta & Pacciarelli, Dario, 2008. "Real time management of a metro rail terminus," European Journal of Operational Research, Elsevier, vol. 189(3), pages 746-761, September.
    13. Corman, Francesco & D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2010. "A tabu search algorithm for rerouting trains during rail operations," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 175-192, January.
    14. Leonardo Lamorgese & Carlo Mannino, 2019. "A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management," Operations Research, INFORMS, vol. 67(6), pages 1586-1609, November.
    15. Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
    16. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    17. Jingliu Xu & Zhimei Wang & Shangjun Yao & Jiarong Xue, 2022. "Train Operations Organization in High-Speed Railway Station Considering Variable Configuration," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
    18. Meng, Lingyun & Zhou, Xuesong, 2011. "Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1080-1102, August.
    19. A. Ozolins, 2020. "A new exact algorithm for no-wait job shop problem to minimize makespan," Operational Research, Springer, vol. 20(4), pages 2333-2363, December.
    20. Xiaoming Xu & Keping Li & Lixing Yang & Ziyou Gao, 2019. "An efficient train scheduling algorithm on a single-track railway system," Journal of Scheduling, Springer, vol. 22(1), pages 85-105, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:57:y:2009:i:4:p:1026-1039. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.