Incorporating holding costs in continuous-time service network design : new model, relaxation, and exact algorithm
Year of publication: |
2024
|
---|---|
Authors: | Shu, Shengnan ; Xu, Zhou ; Baldacci, Roberto |
Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 58.2024, 2, p. 412-433
|
Subject: | dynamic discretization discovery | holding cost | programming - integer - algorithms | service network design | transportation | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem |
-
Pecin, Diego, (2019)
-
Models and algorithms for combinatorial optimization problems arising in railway applications
Cacchiani, Valentina, (2009)
-
A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Santos, Fernando Afonso, (2015)
- More ...
-
Optimal Global Liner Service Procurement by Utilizing Liner Service Schedules
Lee, ChungâYee, (2020)
-
A new exact algorithm for single-commodity vehicle routing with split pickups and deliveries
Li, Jiliu, (2023)
-
An exact solution framework for a broad class of vehicle routing problems
Baldacci, Roberto, (2010)
- More ...