Interval-based dynamic discretization discovery for solving the continuous-time service network design problem
Year of publication: |
2021
|
---|---|
Authors: | Marshall, Luke ; Boland, Natashia ; Savelsbergh, Martin W. P. ; Hewitt, Mike |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 55.2021, 1, p. 29-51
|
Subject: | service network design | time-expanded network | iterative refinement | dynamic discretization discovery | Theorie | Theory | Unternehmensnetzwerk | Business network | Ganzzahlige Optimierung | Integer programming | Netzwerk | Network | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Dynamic programming |
-
The continuous-time service network design problem
Boland, Natashia, (2017)
-
A time-expanded network reduction matheuristic for the logistics service network design problem
Belieres, Simon, (2021)
-
Parcel distribution timetabling problem with incomplete hub network
Ben-Ayed, Omar, (2014)
- More ...
-
The continuous-time service network design problem
Boland, Natashia, (2017)
-
The price of discretizing time : a study in service network design
Boland, Natashia, (2019)
-
Duc Minh Vu, (2020)
- More ...