.png){kind=icon}
.png){kind=icon}
Return
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.2020.0994.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce an effective and efficient iterative algorithm for solving the continuous-time service network design problem. The algorithm achieves its efficiency by carefully and dynamically refining partially time-expanded network models so that only a small number of small integer programs, defined over these networks, need to be solved. An extensive computational study shows that the algorithm performs well in practice, often using time-expanded network models with size much less than 1% (in terms of number of variables and constraints) of a full time-expanded network model. The algorithm is inspired by and has many similarities to the dynamic discretization discovery algorithm introduced in Boland et al. [Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303-1321.], but generates smaller partially timeexpanded models, produces high-quality solutions more quickly, and convergesmore quickly.
Keywords:
service network design
time-expanded network
iterative refinement
dynamic discretization discovery
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K
View more organizations