IDEAS home Printed from https://ideas.repec.org/a/spr/eurjtl/v8y2019i2d10.1007_s13676-018-0119-x.html
   My bibliography  Save this article

The price of discretizing time: a study in service network design

Author

Listed:
  • Natashia Boland

    (Georgia Institute of Technology)

  • Mike Hewitt

    (Loyola University Chicago)

  • Luke Marshall

    (Georgia Institute of Technology)

  • Martin Savelsbergh

    (Georgia Institute of Technology)

Abstract

Researchers and practitioners have long recognized that many transportation problems can be naturally and conveniently modeled using time-expanded networks. In such models, nodes represent locations at distinct points in time and arcs represent possible actions, e.g., moving from one location to another at a particular point of time, or staying in the same location for a period of time. To use a time-expanded network, time must be discretized, i.e., the planning horizon is partitioned into discrete time intervals. The length of these intervals, therefore, must be chosen, and the parameters involving time, e.g., travel duration and due times, need to be mapped to these discrete intervals. Short intervals yield a high-quality approximation to the continuous-time problem, but typically induce a computationally intractable model; whereas long intervals can yield a computationally tractable, but low-quality model. The loss of quality is due to the approximation introduced by the mapping of parameters involving time. To guide researchers and practitioners in their use of time-expanded networks, we explore the choice of time discretization and its impact, by means of an extensive computational study on the service network design problem. The empirical results show that in some cases the loss of quality, i.e., the relative gap between the discretized and continuous-time optimal values, can be greater than 20%. We also investigate metrics that characterize and help identify instances that are likely to be sensitive to discretization and could incur a large loss of solution quality.

Suggested Citation

  • Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2019. "The price of discretizing time: a study in service network design," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 195-216, June.
  • Handle: RePEc:spr:eurjtl:v:8:y:2019:i:2:d:10.1007_s13676-018-0119-x
    DOI: 10.1007/s13676-018-0119-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13676-018-0119-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13676-018-0119-x?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. Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
    2. 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.
    3. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    4. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    5. Teypaz, Nicolas & Schrenk, Susann & Cung, Van-Dat, 2010. "A decomposition scheme for large-scale Service Network Design with asset management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(1), pages 156-170, January.
    6. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    7. Kliewer, Natalia & Mellouli, Taieb & Suhl, Leena, 2006. "A time-space network based exact optimization model for multi-depot bus scheduling," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1616-1627, December.
    8. Ng, ManWo & Lo, Hong K., 2016. "Robust models for transportation service network design," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 378-386.
    9. 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.
    10. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    11. Inghels, Dirk & Dullaert, Wout & Vigo, Daniele, 2016. "A service network design model for multimodal municipal solid waste transport," European Journal of Operational Research, Elsevier, vol. 254(1), pages 68-79.
    12. 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.
    13. Moshe Dror, 1994. "Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW," Operations Research, INFORMS, vol. 42(5), pages 977-978, October.
    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. Luke Marshall & Natashia Boland & Martin Savelsbergh & Mike Hewitt, 2021. "Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem," Transportation Science, INFORMS, vol. 55(1), pages 29-51, 1-2.
    2. Tomas Lidén, 2020. "Coordinating maintenance windows and train traffic: a case study," Public Transport, Springer, vol. 12(2), pages 261-298, June.
    3. Schwerdfeger, Stefan & Boysen, Nils, 2020. "Optimizing the changing locations of mobile parcel lockers in last-mile distribution," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1077-1094.
    4. Fokkema, Jan Eise & Land, Martin J. & Coelho, Leandro C. & Wortmann, Hans & Huitema, George B., 2020. "A continuous-time supply-driven inventory-constrained routing problem," Omega, Elsevier, vol. 92(C).
    5. Ammann, Pia & Kolisch, Rainer & Schiffer, Maximilian, 2023. "Driver routing and scheduling with synchronization constraints," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    6. 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).
    7. 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.

    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. 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.
    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. 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.
    4. 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.
    5. 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).
    6. Juliette Medina & Mike Hewitt & Fabien Lehuédé & Olivier Péton, 2019. "Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 119-145, June.
    7. Scherr, Yannick Oskar & Hewitt, Mike & Neumann Saavedra, Bruno Albert & Mattfeld, Dirk Christian, 2020. "Dynamic discretization discovery for the service network design problem with mixed autonomous fleets," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 164-195.
    8. Luke Marshall & Natashia Boland & Martin Savelsbergh & Mike Hewitt, 2021. "Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem," Transportation Science, INFORMS, vol. 55(1), pages 29-51, 1-2.
    9. 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.
    10. Mike Hewitt, 2019. "Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem," Transportation Science, INFORMS, vol. 53(6), pages 1731-1750, November.
    11. 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.
    12. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    13. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    14. 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).
    15. Naoto Katayama, 2020. "MIP neighborhood search heuristics for a service network design problem with design-balanced requirements," Journal of Heuristics, Springer, vol. 26(4), pages 475-502, August.
    16. 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).
    17. 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.
    18. Meng, Qiang & Hei, Xiuling & Wang, Shuaian & Mao, Haijun, 2015. "Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 38-54.
    19. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric, 2021. "A time-expanded network reduction matheuristic for the logistics service network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    20. 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.

    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:spr:eurjtl:v:8:y:2019:i:2:d:10.1007_s13676-018-0119-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.