Branch-and-cut for the split delivery vehicle routing problem with time windows
Year of publication: |
2019
|
---|---|
Authors: | Bianchessi, Nicola ; Irnich, Stefan |
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, 2, p. 442-462
|
Subject: | vehicle routing problem | split delivery | time windows | valid inequalities | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics |
-
Multi-depot routing with split deliveries : models and a branch-and-cut algorithm
Gouveia, Luis, (2023)
-
A new family of route formulations for split delivery vehicle routing problems
Balster, Isaac, (2023)
-
Ant colony algorithm for heterogonous green vehicle routing problem with split delivery
Heikkinen, Risto, (2023)
- More ...
-
Formulations for an inventory routing problem
Archetti, Claudia, (2014)
-
Branch-and-price-and-cut for the active-passive vehicle-routing problem
Tilk, Christian, (2018)
-
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Gschwind, Timo, (2019)
- More ...