Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
Year of publication: |
2020
|
---|---|
Authors: | Subramanyam, Anirudh ; Repoussis, Panagiotis P. ; Gounaris, Chrysanthos E. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 3, p. 661-681
|
Subject: | robust optimization | vehicle routing | demand uncertainty | local search | metaheuristics | branch-and-cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Heuristik | Heuristics | Entscheidung unter Unsicherheit | Decision under uncertainty |
-
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Pessoa, Artur, (2021)
-
Campos, Rafael, (2022)
-
Solving the bi-objective robust vehicle routing problem with uncertain costs and demands
Solano-Charris, Elyn L., (2016)
- More ...
-
A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Subramanyam, Anirudh, (2018)
-
Robust multiperiod vehicle routing under customer order uncertainty
Subramanyam, Anirudh, (2021)
-
An adaptive memory programming framework for the robust capacitated vehicle routing problem
Gounaris, Chrysanthos E., (2016)
- More ...