IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v128y2019icp324-343.html
   My bibliography  Save this article

Scheduled service network design with resource acquisition and management under uncertainty

Author

Listed:
  • Hewitt, Mike
  • Crainic, Teodor Gabriel
  • Nowak, Maciek
  • Rei, Walter

Abstract

We propose a scheduled service network design model that simultaneously addresses strategic decisions regarding fleet sizing and allocation, including acquisition and outsourcing, as well as tactical decisions regarding a repeatable transportation plan and schedule. Moreover, as a well-sized fleet and a well-designed transportation plan should be able to accommodate fluctuations in freight volumes, the model takes the form of a stochastic program, explicitly addressing uncertainty in demand through the use of scenarios. This is the first model to consider this full suite of decisions while also recognizing uncertainty in freight volumes. Given the computational difficulties associated with solving stochastic programs exactly, we propose a column-generation-based matheuristics scheme for addressing the model, which decomposes the optimization problem across multiple dimensions, and evaluates a neighboring solution across all scenarios. This is the first heuristic scheme for this class of problem and we assess its effectiveness on two sets of instances. The first is a set generated to mimic the operations of a Less-than-truckload freight transportation carrier and the second is based on the network of a European postal carrier. We see that the solution approach is able to produce high-quality solutions for both sets of instances in run-times that are acceptable in practice.

Suggested Citation

  • Hewitt, Mike & Crainic, Teodor Gabriel & Nowak, Maciek & Rei, Walter, 2019. "Scheduled service network design with resource acquisition and management under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 324-343.
  • Handle: RePEc:eee:transb:v:128:y:2019:i:c:p:324-343
    DOI: 10.1016/j.trb.2019.08.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261518308890
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2019.08.008?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mervat Chouman & Teodor Gabriel Crainic, 2015. "Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements," Transportation Science, INFORMS, vol. 49(1), pages 99-113, February.
    2. Archetti, Claudia & Corberán, Ángel & Plana, Isaac & Sanchis, José Maria & Speranza, M. Grazia, 2015. "A matheuristic for the Team Orienteering Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 392-401.
    3. Michael Berliner Pedersen & Teodor Gabriel Crainic & Oli B. G. Madsen, 2009. "Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements," Transportation Science, INFORMS, vol. 43(2), pages 158-177, May.
    4. 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.
    5. Chi-Chur Chao & Eden S. H. Yu, 2014. "Summary and Suggestions for Future Research," World Scientific Book Chapters, in: TRADE-RELATED INVESTMENT MEASURES Theory and Applications, chapter 20, pages 295-297, World Scientific Publishing Co. Pte. Ltd..
    6. ., 2014. "Summary of Part II," Chapters, in: Common Innovation, chapter 14, pages 128-130, Edward Elgar Publishing.
    7. Villegas, Juan G. & Prins, Christian & Prodhon, Caroline & Medaglia, Andrés L. & Velasco, Nubia, 2013. "A matheuristic for the truck and trailer routing problem," European Journal of Operational Research, Elsevier, vol. 230(2), pages 231-244.
    8. Claudia Archetti & M. Grazia Speranza & Martin W. P. Savelsbergh, 2008. "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 42(1), pages 22-31, February.
    9. Warren B. Powell, 1986. "A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks," Transportation Science, INFORMS, vol. 20(4), pages 246-257, November.
    10. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    11. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    12. ., 2014. "Summary and future work," Chapters, in: Exchange Rate Economics, chapter 9, pages 172-183, Edward Elgar Publishing.
    13. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    14. Andersen, Jardar & Crainic, Teodor Gabriel & Christiansen, Marielle, 2009. "Service network design with management and coordination of multiple fleets," European Journal of Operational Research, Elsevier, vol. 193(2), pages 377-389, March.
    15. Lai, M. F. & Lo, Hong K., 2004. "Ferry service network design: optimal fleet size, routing, and scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(4), pages 305-328, May.
    16. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    17. Daeki Kim & Cynthia Barnhart & Keith Ware & Gregory Reinhardt, 1999. "Multimodal Express Package Delivery: A Service Network Design Application," Transportation Science, INFORMS, vol. 33(4), pages 391-407, November.
    18. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    19. Verena Schmid & Karl F. Doerner & Richard F. Hartl & Martin W. P. Savelsbergh & Wolfgang Stoecher, 2009. "A Hybrid Solution Approach for Ready-Mixed Concrete Delivery," Transportation Science, INFORMS, vol. 43(1), pages 70-85, February.
    20. Council on Food Agricultural and Resource Economics, C-FARE, 2014. "2014 Program Summary Report," C-FARE Reports 260837, Council on Food, Agricultural, and Resource Economics (C-FARE).
    21. Arnt-Gunnar Lium & Teodor Gabriel Crainic & Stein W. Wallace, 2009. "A Study of Demand Stochasticity in Service Network Design," Transportation Science, INFORMS, vol. 43(2), pages 144-157, May.
    22. Smilowitz, Karen R. & Atamtürk, Alper & Daganzo, Carlos F., 2003. "Deferred item and vehicle routing within integrated networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 39(4), pages 305-323, July.
    23. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    24. Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
    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. Li, Siqiao & Zhu, Xiaoning & Shang, Pan & Li, Tianqi & Liu, Wenqian, 2023. "Optimizing a shared freight and passenger high-speed railway system: A multi-commodity flow formulation with Benders decomposition solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 1-31.
    2. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    3. Yıldız, Barış & Savelsbergh, Martin, 2022. "Optimizing package express operations in China," European Journal of Operational Research, Elsevier, vol. 300(1), pages 320-335.
    4. Hewitt, Mike & Lehuédé, Fabien, 2023. "New formulations for the Scheduled Service Network Design Problem," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 117-133.
    5. Xudong Diao & Ai Gao & Xin Jin & Hui Chen, 2022. "A Layer-Based Relaxation Approach for Service Network Design," Sustainability, MDPI, vol. 14(20), pages 1-13, October.
    6. Belieres, Simon & Hewitt, Mike, 2024. "Hedging against uncertainty in transportation network design through flexible scheduling," Omega, Elsevier, vol. 126(C).
    7. Faugère, Louis & Klibi, Walid & White, Chelsea & Montreuil, Benoit, 2022. "Dynamic pooled capacity deployment for urban parcel logistics," European Journal of Operational Research, Elsevier, vol. 303(2), pages 650-667.
    8. Liu, Chuanju & Lin, Shaochong & Shen, Zuo-Jun Max & Zhang, Junlong, 2023. "Stochastic service network design: The value of fixed routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    9. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    10. Jiang, Xiaoping & Bai, Ruibin & Ren, Jianfeng & Li, Jiawei & Kendall, Graham, 2022. "Lagrange dual bound computation for stochastic service network design," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1097-1112.

    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. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2018. "Scheduled service network design with resource acquisition and management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 277-309, September.
    2. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    3. Greening, Lacy M. & Dahan, Mathieu & Erera, Alan L., 2023. "Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    4. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    5. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    6. Wang, Zujian & Qi, Mingyao, 2019. "Service network design considering multiple types of services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 1-14.
    7. Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
    8. Bai, Ruibin & Wallace, Stein W. & Li, Jingpeng & Chong, Alain Yee-Loong, 2014. "Stochastic service network design with rerouting," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 50-65.
    9. Li, Xiangyong & Wei, Kai & Guo, Zhaoxia & Wang, Wei & Aneja, Y.P., 2021. "An exact approach for the service network design problem with heterogeneous resource constraints," Omega, Elsevier, vol. 102(C).
    10. Mervat Chouman & Teodor Gabriel Crainic, 2015. "Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements," Transportation Science, INFORMS, vol. 49(1), pages 99-113, February.
    11. Dayarian, Iman & Rocco, Adolfo & Erera, Alan & Savelsbergh, Martin, 2022. "Operations design for high-velocity intra-city package service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 150-168.
    12. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    13. Zhang, X. & Liu, X., 2022. "A two-stage robust model for express service network design with surging demand," European Journal of Operational Research, Elsevier, vol. 299(1), pages 154-167.
    14. Eskandarzadeh, Saman & Fahimnia, Behnam, 2024. "Containerised parcel delivery: Modelling and performance evaluation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    15. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    16. 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.
    17. Satici, Ozgur & Dayarian, Iman, 2024. "Tactical and operational planning of express intra-city package services," Omega, Elsevier, vol. 122(C).
    18. Wang, Zujian & Qi, Mingyao & Cheng, Chun & Zhang, Canrong, 2019. "A hybrid algorithm for large-scale service network design considering a heterogeneous fleet," European Journal of Operational Research, Elsevier, vol. 276(2), pages 483-494.
    19. Bilegan, Ioana C. & Crainic, Teodor Gabriel & Wang, Yunfei, 2022. "Scheduled service network design with revenue management considerations and an intermodal barge transportation illustration," European Journal of Operational Research, Elsevier, vol. 300(1), pages 164-177.
    20. Hewitt, Mike & Lehuédé, Fabien, 2023. "New formulations for the Scheduled Service Network Design Problem," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 117-133.

    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:eee:transb:v:128:y:2019:i:c:p:324-343. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.