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

A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management

Author

Listed:
  • Leonardo Lamorgese

    (Optrail S.R.L., 00154 Rome, Italy)

  • Carlo Mannino

    (SINTEF Digital, 0373 Oslo, Norway; University of Oslo, 0315 Oslo, Norway)

Abstract

A central problem in traffic management is that of scheduling the movements of vehicles so as to minimize the cost of the schedule. It arises in important applications such as train timetabling, rescheduling, delay and disruption management, airplane surface routing, runway scheduling, air-traffic control, and more. This problem can be modeled as a job-shop scheduling problem. We introduce a new mixed-integer linear program (MILP) formulation for job-shop scheduling, which is an alternative to classical approaches, namely, big- M and time-indexed formulations. It does not make use of artificially large coefficients, and its constraints correspond to basic graph structures, such as paths, cycles, and trees. The new formulation can be obtained by strengthening and lifting the constraints of a classical Benders’ reformulation. Tests on a large set of real-life instances from train rescheduling show that the new approach performs on average better than our previous approaches based on big- M formulations and particularly better on a class of instances with nonconvex costs very common in the practice.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:67:y:2019:i:6:p:1586-1609
    DOI: 10.1287/opre.2018.1837
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2018.1837
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2018.1837?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. 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).
    2. 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).
    3. MARCHAND, Hugues & WOLSEY, Laurence A., 1999. "The 0-1 Knapsack problem with a single continuous variable," LIDAM Reprints CORE 1390, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Cacchiani, Valentina & Toth, Paolo, 2012. "Nominal and robust train timetabling problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 727-737.
    5. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    6. 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.
    7. 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.
    8. Michael Schachtebeck & Anita Schöbel, 2010. "To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions," Transportation Science, INFORMS, vol. 44(3), pages 307-321, August.
    9. Leonardo Lamorgese & Carlo Mannino & Mauro Piacentini, 2016. "Optimal Train Dispatching by Benders’-Like Reformulation," Transportation Science, INFORMS, vol. 50(3), pages 910-925, August.
    10. Egon Balas, 1969. "Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm," Operations Research, INFORMS, vol. 17(6), pages 941-957, December.
    11. 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.
    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. Ji, Hangyu & Wang, Rui & Zhang, Chuntian & Yin, Jiateng & Ma, Lin & Yang, Lixing, 2024. "Optimization of train schedule with uncertain maintenance plans in high-speed railways: A stochastic programming approach," Omega, Elsevier, vol. 124(C).
    2. Tamssaouet, Karim & Dauzère-Pérès, Stéphane, 2023. "A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 311(2), pages 455-471.
    3. 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.
    4. Wolff, Pascal & Emde, Simon & Pfohl, Hans-Christian, 2021. "Internal resource requirements: The better performance metric for truck scheduling?," Omega, Elsevier, vol. 103(C).
    5. Mannino, Carlo & Nakkerud, Andreas, 2023. "Optimal Train Rescheduling in Oslo Central Station," Omega, Elsevier, vol. 116(C).
    6. Oddvar Kloster & Bjørnar Luteberget & Carlo Mannino & Giorgio Sartor, 2023. "An Optimization-Based Decision Support Tool for Incremental Train Timetabling," SN Operations Research Forum, Springer, vol. 4(3), pages 1-20, September.
    7. 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).
    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. 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.
    10. Yin, Jiateng & Pu, Fan & Yang, Lixing & D’Ariano, Andrea & Wang, Zhouhong, 2023. "Integrated optimization of rolling stock allocation and train timetables for urban rail transit networks: A benders decomposition approach," Transportation Research Part B: Methodological, Elsevier, vol. 176(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. Leonardo Lamorgese & Carlo Mannino & Mauro Piacentini, 2016. "Optimal Train Dispatching by Benders’-Like Reformulation," Transportation Science, INFORMS, vol. 50(3), pages 910-925, August.
    2. 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.
    3. Sartor, Giorgio & Mannino, Carlo & Nygreen, Thomas & Bach, Lukas, 2023. "A MILP model for quasi-periodic strategic train timetabling," Omega, Elsevier, vol. 116(C).
    4. 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.
    5. 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.
    6. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    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. Oddvar Kloster & Bjørnar Luteberget & Carlo Mannino & Giorgio Sartor, 2023. "An Optimization-Based Decision Support Tool for Incremental Train Timetabling," SN Operations Research Forum, Springer, vol. 4(3), pages 1-20, September.
    9. Zhang, Chuntian & Gao, Yuan & Cacchiani, Valentina & Yang, Lixing & Gao, Ziyou, 2023. "Train rescheduling for large-scale disruptions in a large-scale railway network," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    10. Schön, Cornelia & König, Eva, 2018. "A stochastic dynamic programming approach for delay management of a single train line," European Journal of Operational Research, Elsevier, vol. 271(2), pages 501-518.
    11. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
    12. Pellegrini, Paola & Pesenti, Raffaele & Rodriguez, Joaquin, 2019. "Efficient train re-routing and rescheduling: Valid inequalities and reformulation of RECIFE-MILP," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 33-48.
    13. Van Thielen, Sofie & Corman, Francesco & Vansteenwegen, Pieter, 2018. "Considering a dynamic impact zone for real-time railway traffic management," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 39-59.
    14. 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.
    15. Bettinelli, Andrea & Santini, Alberto & Vigo, Daniele, 2017. "A real-time conflict solution algorithm for the train rescheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 237-265.
    16. Luan, Xiaojie & De Schutter, Bart & Meng, Lingyun & Corman, Francesco, 2020. "Decomposition and distributed optimization of real-time traffic management for large-scale railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 72-97.
    17. Jonas Harbering, 2017. "Delay resistant line planning with a view towards passenger transfers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 467-496, October.
    18. Liu, Renming & Li, Shukai & Yang, Lixing, 2020. "Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy," Omega, Elsevier, vol. 90(C).
    19. Omar J. Ibarra-Rojas & Fernando López-Irarragorri & Yasmin A. Rios-Solis, 2016. "Multiperiod Bus Timetabling," Transportation Science, INFORMS, vol. 50(3), pages 805-822, August.
    20. 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.

    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:67:y:2019:i:6:p:1586-1609. 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.