The robust vehicle routing problem with time windows : compact formulation and branch-price-and-cut method
Year of publication: |
2019
|
---|---|
Authors: | Munari, Pedro ; Moreno, Alfredo ; Vega, Jonathan de la ; Alem, Douglas ; Gondzio, Jacek ; Morabito, Reinaldo |
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. 53.2019, 4, p. 1043-1066
|
Subject: | vehicle routing | time windows | robust optimization | polyhedral-interval uncertainty | compact model | branch-price-and-cut | Tourenplanung | Vehicle routing problem | Theorie | Theory | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming |
-
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
Vega, Jonathan de la, (2020)
-
A robust scenario approach for the vehicle routing problem with uncertain travel times
Han, Jinil, (2014)
-
Routing optimization under uncertainty
Jaillet, Patrick, (2016)
- More ...
-
A robust optimization approach for the unrelated parallel machine scheduling problem
Vega, Jonathan de la, (2023)
-
A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration
Moreno, Alfredo, (2019)
-
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
Moreno, Alfredo, (2020)
- More ...