Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s13676-018-0119-x | EURO Journal on Transportation and Logistics |
Keywords | Field | DocType |
Service network design, Time-space network, Time expanded network, Approximation | Discretization,Mathematical optimization,Time horizon,Network planning and design,Computer science,Discrete time and continuous time | Journal |
Volume | Issue | ISSN |
8 | SP2 | 2192-4384 |
Citations | PageRank | References |
0 | 0.34 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natashia Boland | 1 | 726 | 67.11 |
| Mike Hewitt | 2 | 153 | 19.66 |
| Luke Marshall | 3 | 6 | 0.76 |
| Martin Savelsbergh | 4 | 2624 | 190.83 |