A districting-based heuristic for the coordinated capacitated arc routing problem
Year of publication: |
2019
|
---|---|
Authors: | Wøhlk, Sanne ; Laporte, Gilbert |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 111.2019, p. 271-284
|
Subject: | Garbage collection | Districting | Arc routing | Heuristics | Tourenplanung | Vehicle routing problem | Heuristik |
-
Branch-price-and-cut for the soft-clustered capacitated arc-routing problem
Hintsch, Timo, (2021)
-
On the generalized directed rural postman problem
Drexl, Michael, (2014)
-
Node, edge, arc routing and turn penalties : multiple problems : one neighborhood extension
Vidal, Thibaut, (2017)
- More ...
-
Wøhlk, Sanne, (2017)
-
A fast heuristic for large-scale capacitated arc routing problems
Wøhlk, Sanne, (2018)
-
Transport of skips between recycling centers and treatment facilities
Wøhlk, Sanne, (2022)
- More ...