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

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.

[1]  Leena Suhl,et al.  A time-space network based exact optimization model for multi-depot bus scheduling , 2006, Eur. J. Oper. Res..

[2]  Marielle Christiansen,et al.  Branch and Price for Service Network Design with Asset Management Constraints , 2011, Transp. Sci..

[3]  Alain Yee-Loong Chong,et al.  Stochastic service network design with rerouting , 2014, Transportation Research Part B: Methodological.

[4]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[5]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[6]  Teodor Gabriel Crainic,et al.  Service Network Design of Bike Sharing Systems with Resource Constraints , 2016, ICCL.

[7]  Susann Schrenk,et al.  A decomposition scheme for large-scale Service Network Design with asset management , 2010 .

[8]  Sanjeeb Dash,et al.  A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..

[9]  Balachandran Vaidyanathan,et al.  Multicommodity network flow approach to the railroad crew-scheduling problem , 2007, IBM J. Res. Dev..

[10]  Hong Kam Lo,et al.  Robust models for transportation service network design , 2016 .

[11]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[12]  Shangyao Yan,et al.  A time‐space network model for work team scheduling after a major disaster , 2007 .

[13]  Pierre Chardaire,et al.  Solving a Time-Space Network Formulation for the Convoy Movement Problem , 2005, Oper. Res..

[14]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[15]  Kevin C. Furman,et al.  A maritime inventory routing problem: Practical approach , 2013, Comput. Oper. Res..

[16]  Amin Hosseininasab The Continuous Time Service Network Design Problem , 2015 .

[17]  Ahmad I. Jarrah,et al.  Large-Scale, Less-than-Truckload Service Network Design , 2009, Oper. Res..

[18]  Renan Garcia,et al.  Resource constrained shortest paths and extensions , 2009 .

[19]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[20]  George L. Nemhauser,et al.  The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..

[21]  Martin W. P. Savelsbergh,et al.  The Continuous-Time Service Network Design Problem , 2017, Oper. Res..

[22]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[23]  Martin W. P. Savelsbergh,et al.  Improved Load Plan Design Through Integer Programming Based Local Search , 2013, Transp. Sci..

[24]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[25]  Daniele Vigo,et al.  A service network design model for multimodal municipal solid waste transport , 2016, Eur. J. Oper. Res..

[26]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[27]  Cynthia Barnhart,et al.  Network design formulations for scheduling U.S. Air Force channel route missions , 2004 .

[28]  Marielle Christiansen,et al.  Service network design with management and coordination of multiple fleets , 2009, Eur. J. Oper. Res..

[29]  Nicole Wieberneit,et al.  Service network design for freight transportation: a review , 2007, OR Spectr..

[30]  Teodor Gabriel Crainic,et al.  Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[31]  Amelia Regan,et al.  On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..

[32]  Kazuhiro Kobayashi,et al.  Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques , 2010 .