IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v53y2019i5p1455-1478.html
   My bibliography  Save this article

A Branch-and-Price Algorithm for the Bilevel Network Maintenance Scheduling Problem

Author

Listed:
  • David Rey

    (School of Civil and Environmental Engineering, UNSW Sydney, New South Wales 2052, Australia;)

  • Hillel Bar-Gera

    (Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, 84105 Beer-Sheva, Israel;)

  • Vinayak V. Dixit

    (School of Civil and Environmental Engineering, UNSW Sydney, New South Wales 2052, Australia;)

  • S. Travis Waller

    (School of Civil and Environmental Engineering, UNSW Sydney, New South Wales 2052, Australia;)

Abstract

We address the network maintenance scheduling problem, which consists of finding the optimal schedule for the coordination of road maintenance projects in a transport network over a planning period. Road works and maintenance operations that require partial or total road closures over a period of time may considerably impact network performance and result in significant delays. In addition, the effects of conducting multiple maintenance projects simultaneously may be nonadditive, hence increasing the difficulty to anticipate congestion effects. In this paper, we propose a new bilevel mixed integer programming formulation for the network maintenance scheduling problem, which relies on the enumeration of maintenance project combinations—patterns—to incorporate congestion effects within the scheduling process. We present a new branch-and-price algorithm that relies on customized branching and bounding rules, and a tailored column generation framework to price patterns. In addition, a statistical regression model is introduced to approximate congestion effects and provide approximate lower bounds on the formulations therein. The proposed branch-and-price algorithm is implemented on instances derived from realistic transport networks and is shown to be able to solve the network maintenance scheduling problem in a reasonable time using only a fraction of the patterns.

Suggested Citation

  • David Rey & Hillel Bar-Gera & Vinayak V. Dixit & S. Travis Waller, 2019. "A Branch-and-Price Algorithm for the Bilevel Network Maintenance Scheduling Problem," Transportation Science, INFORMS, vol. 53(5), pages 1455-1478, September.
    • Handle: RePEc:inm:ortrsc:v:53:y:2019:i:5:p:1455-1478
    DOI: 10.1287/trsc.2019.0896
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2019.0896
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2019.0896?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. Lee, Jinwoo & Madanat, Samer, 2015. "A joint bottom-up solution methodology for system-level pavement rehabilitation and reconstruction," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 106-122.
    2. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    3. LeBlanc, Larry J. & Boyce, David E., 1986. "A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 259-265, June.
    4. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    5. Behbahani, Hamid & Nazari, Sobhan & Jafari Kang, Masood & Litman, Todd, 2019. "A conceptual framework to formulate transportation network design problem considering social equity criteria," Transportation Research Part A: Policy and Practice, Elsevier, vol. 125(C), pages 171-183.
    6. Chu, James C. & Chen, Yin-Jay, 2012. "Optimal threshold-based network-level transportation infrastructure life-cycle management with heterogeneous maintenance actions," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1123-1143.
    7. Hammad, Ahmed W A & Akbarnezhad, Ali & Rey, David, 2017. "Sustainable urban facility location: Minimising noise pollution and network congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 38-59.
    8. Suh-Wen Chiou, 1999. "Optimization of Area Traffic Control for Equilibrium Network Flows," Transportation Science, INFORMS, vol. 33(3), pages 279-289, August.
    9. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    10. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    11. Joseph Y. J. Chow & Amelia C. Regan, 2011. "Real Option Pricing of Network Design Investments," Transportation Science, INFORMS, vol. 45(1), pages 50-63, February.
    12. Pirmin Fontaine & Stefan Minner, 2017. "A dynamic discrete network design problem for maintenance planning in traffic networks," Annals of Operations Research, Springer, vol. 253(2), pages 757-772, June.
    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. Guillot, Matthieu & Rey, David & Furno, Angelo & El Faouzi, Nour-Eddin, 2024. "A stochastic hub location and fleet assignment problem for the design of reconfigurable park-and-ride systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    2. Xi, Haoning & Aussel, Didier & Liu, Wei & Waller, S.Travis. & Rey, David, 2024. "Single-leader multi-follower games for the regulation of two-sided mobility-as-a-service markets," European Journal of Operational Research, Elsevier, vol. 317(3), pages 718-736.
    3. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2023. "A branch-and-price heuristic algorithm for the bunkering operation problem of a liquefied natural gas bunkering station in the inland waterways," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 145-170.
    4. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    5. Marzena Kramarz & Lilla Knop & Edyta Przybylska & Katarzyna Dohn, 2021. "Stakeholders of the Multimodal Freight Transport Ecosystem in Polish–Czech–Slovak Cross-Border Area," Energies, MDPI, vol. 14(8), pages 1-32, April.
    6. Gokalp, Can & Patil, Priyadarshan N. & Boyles, Stephen D., 2021. "Post-disaster recovery sequencing strategy for road networks," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 228-245.

    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. Isabel Martins & Filipe Alvelos & Miguel Constantino, 2012. "A branch-and-price approach for harvest scheduling subject to maximum area restrictions," Computational Optimization and Applications, Springer, vol. 51(1), pages 363-385, January.
    2. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    3. Melanie Erhard, 2021. "Flexible staffing of physicians with column generation," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 212-252, March.
    4. Miriam Kießling & Sascha Kurz & Jörg Rambau, 2021. "An exact column-generation approach for the lot-type design problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 741-780, October.
    5. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    6. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    7. Shen, Yunzhuang & Sun, Yuan & Li, Xiaodong & Eberhard, Andrew & Ernst, Andreas, 2023. "Adaptive solution prediction for combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1392-1408.
    8. Ospina, Juan P. & Duque, Juan C. & Botero-Fernández, Verónica & Montoya, Alejandro, 2022. "The maximal covering bicycle network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 222-236.
    9. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    10. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
    11. Yael Grushka-Cockayne & Bert De Reyck & Zeger Degraeve, 2008. "An Integrated Decision-Making Approach for Improving European Air Traffic Management," Management Science, INFORMS, vol. 54(8), pages 1395-1409, August.
    12. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    13. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    14. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    15. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    16. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    17. Fink, Martin & Desaulniers, Guy & Frey, Markus & Kiermaier, Ferdinand & Kolisch, Rainer & Soumis, François, 2019. "Column generation for vehicle routing problems with multiple synchronization constraints," European Journal of Operational Research, Elsevier, vol. 272(2), pages 699-711.
    18. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    19. Jardar Andersen & Marielle Christiansen & Teodor Gabriel Crainic & Roar Grønhaug, 2011. "Branch and Price for Service Network Design with Asset Management Constraints," Transportation Science, INFORMS, vol. 45(1), pages 33-49, February.
    20. Xinhua Mao & Changwei Yuan & Jiahua Gan, 2019. "Incorporating Dynamic Traffic Distribution into Pavement Maintenance Optimization Model," Sustainability, MDPI, vol. 11(9), pages 1-15, April.

    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:ortrsc:v:53:y:2019:i:5:p:1455-1478. 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.