Branch-price-and-cut for the soft-clustered capacitated arc-routing problem
Year of publication: |
2021
|
---|---|
Authors: | Hintsch, Timo ; Irnich, Stefan ; Christensen, Lone Kiilerich |
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, 3, p. 687-705
|
Subject: | arc routing | branch-price-and-cut | branch-and-cut | districting | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics |
-
A districting-based heuristic for the coordinated capacitated arc routing problem
Wøhlk, Sanne, (2019)
-
On the generalized directed rural postman problem
Drexl, Michael, (2014)
-
An approach to the asymmetric multi-depot capacitated arc routing problem
Krushnisky, Dmitry, (2015)
- More ...
-
Large multiple neighborhood search for the clustered vehicle-routing problem
Hintsch, Timo, (2018)
-
Exact solution of the soft-clustered vehicle-routing problem
Hintsch, Timo, (2020)
-
Decision problems related to fleet composition and routing
Christensen, Lone Kiilerich, (2019)
- More ...