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.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows—theory, algorithms and applications. Prentice-Hall, Englewood Cliffs
Andersen J, Crainic TG, Christiansen M (2009) Service network design with management and coordination of multiple fleets. Eur J Oper Res 193(2):377–389. https://doi.org/10.1016/j.ejor.2007.10.057. http://www.sciencedirect.com/science/article/pii/S0377221707011186
Andersen J, Christiansen M, Crainic TG, Grønhaug R (2010) Branch and price for service network design with asset management constraints. Transp Sci 45(1):33–49. https://doi.org/10.1287/trsc.1100.0333
Bai R, Wallace SW, Li J, Chong AYL (2014) Stochastic service network design with rerouting. Transp Res Part B Methodol 60:50–65. https://doi.org/10.1016/j.trb.2013.11.001. http://www.sciencedirect.com/science/article/pii/S0191261513001999
Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper Res Lett 34(1):58–68. https://doi.org/10.1016/j.orl.2004.11.011. http://www.sciencedirect.com/science/article/pii/S0167637705000040
Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous time service network design problem. Oper Res 65:1303–1321
Chardaire P, McKeown GP, Verity-Harrison SA, Richardson SB (2005) Solving a time-space network formulation for the convoy movement problem. Oper Res 53(2):219–230. https://doi.org/10.1287/opre.1040.0183
Crainic T (2000) Service network design in freight transportation. Eur J Oper Res 122(2):272–288. https://doi.org/10.1016/S0377-2217(99)00233-7. http://www.sciencedirect.com/science/article/pii/S0377221799002337
Crainic TG, Frangioni A, Gendron B (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl Math 112(13):73–99. https://doi.org/10.1016/S0166-218X(00)00310-3. http://www.sciencedirect.com/science/article/pii/S0166218X00003103
Dash S, Günlük O, Lodi A, Tramontani A (2010) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J Comput 24(1):132–147. https://doi.org/10.1287/ijoc.1100.0432
Dror M (1994) Note on the complexity of the shortest path models for column generation in vrptw. Oper Res 42(5):977–978. https://doi.org/10.1287/opre.42.5.977
Erera A, Hewitt M, Savelsbergh M, Zhang Y (2012) Improved load plan design through integer programming based local search. Transp Sci 47(3):412–427. https://doi.org/10.1287/trsc.1120.0441
Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216–229. https://doi.org/10.1002/net.20033
Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6(3):419–433
Garcia R (2009) Resource constrained shortest paths and extension. Ph.D. thesis, Georgia Institute of Technology
Hane CA, Barnhart C, Johnson EL, Marsten RE, Nemhauser GL, Sigismondi G (1995) The fleet assignment problem: solving a large-scale integer program. Math Program 70(1–3):211–232. https://doi.org/10.1007/BF01585938
Hosseininasab A (2015) The continuous time service network design problem. Master’s thesis, University of Waterloo
Inghels D, Dullaert W, Vigo D (2016) A service network design model for multimodal municipal solid waste transport. Eur J Oper Res 254(1):68–79. https://doi.org/10.1016/j.ejor.2016.03.036. http://www.sciencedirect.com/science/article/pii/S0377221716301643
Jarrah AI, Johnson E, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper Res 57(3):609–625. https://doi.org/10.1287/opre.1080.0587
Kliewer N, Mellouli T, Suhl L (2006) A timespace network based exact optimization model for multi-depot bus scheduling. Eur J Oper Res 175(3):1616–1627. https://doi.org/10.1016/j.ejor.2005.02.030. http://www.sciencedirect.com/science/article/pii/S0377221705002274
Kobayashi K, Kubo M (2010) Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques. Jpn J Ind Appl Math 27(1):161–173. https://doi.org/10.1007/s13160-010-0008-7
Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55. https://doi.org/10.1287/trsc.18.1.1
Neumann-Saavedra BA, Crainic TG, Gendron B, Mattfeld DC, Römer M (2016) Service network design of bike sharing systems with resource constraints. In: Computational Logistics. Springer, Cham, pp 352–366. https://doi.org/10.1007/978-3-319-44896-1_23
Ng M, Lo HK (2016) Robust models for transportation service network design. Transp Res Part B Methodol 94(Supplement C):378–386. https://doi.org/10.1016/j.trb.2016.10.001. http://www.sciencedirect.com/science/article/pii/S0191261516303812
Nielsen CA, Armacost AP, Barnhart C, Kolitz SE (2004) Network design formulations for scheduling u.s. air force channel route missions. Math Comput Model 39(6):925–943. https://doi.org/10.1016/S0895-7177(04)90562-6. http://www.sciencedirect.com/science/article/pii/S0895717704905626
Song JH, Furman KC (2013) A maritime inventory routing problem: Practical approach. Comput Oper Res 40(3):657–665. https://doi.org/10.1016/j.cor.2010.031. http://www.sciencedirect.com/science/article/pii/S0305054810002625
Teypaz N, Schrenk S, Cung VD (2010) A decomposition scheme for large-scale service network design with asset management. Transp Res Part E Logist Transp Rev 46(1):156–170. https://doi.org/10.1016/j.tre.2009.07.003. http://www.sciencedirect.com/science/article/pii/S136655450900091X
Vaidyanathan B, Jha K, Ahuja R (2007) Multicommodity network flow approach to the railroad crew-scheduling problem. IBM J Res Dev 51(3.4):325–344. https://doi.org/10.1147/rd.513.0325
Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transp Res Part B Methodol 36(2):97–112. https://doi.org/10.1016/S0965-8564(00)00037-9. http://www.sciencedirect.com/science/article/pii/S0965856400000379
Wang X, Regan AC (2009) On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints. Comput Ind Eng 56(1):161–164. https://doi.org/10.1016/j.cie.2008.04.011. http://www.sciencedirect.com/science/article/pii/S0360835208000892
Wieberneit N (2007) Service network design for freight transportation: a review. OR Spectr 30(1):77–112. https://doi.org/10.1007/s00291-007-0079-2
Yan S, Shih YL (2007) A timespace network model for work team scheduling after a major disaster. J Chin Inst Eng 30(1):63–75. https://doi.org/10.1080/02533839.2007.9671231
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boland, N., Hewitt, M., Marshall, L. et al. The price of discretizing time: a study in service network design. EURO J Transp Logist 8, 195–216 (2019). https://doi.org/10.1007/s13676-018-0119-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13676-018-0119-x