A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
Year of publication: |
[2017]
|
---|---|
Authors: | Henke, Tino ; Speranza, Maria Grazia ; Wäscher, Gerhard |
Publisher: |
Magdeburg : Otto-von-Guericke-Universität Magdeburg, Fakultät für Wirtschaftswissenschaft |
Subject: | vehicle routing | multiple compartments | branch-and-cut algorithm | waste collection | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Heuristik | Heuristics |
Extent: | 1 Online-Ressource (19 Seiten = 0,71 MB) |
---|---|
Series: | Working paper series. - Magdeburg : Univ., FEMM, ISSN 2628-1724, ZDB-ID 2473634-X. - Vol. no. 2017, 4 |
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Arbeitspapier ; Working Paper ; Graue Literatur ; Non-commercial literature |
Language: | English |
Other identifiers: | 10.24352/UB.OVGU-2018-558 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
An iterated tabu search for the multi-compartment vehicle routing problem
Silvestrin, Paulo Vitor, (2017)
-
A waste collection problem with service type option
Gläser, Sina, (2021)
-
Clustered vehicle routing problem for waste collection with smart operational management approaches
Kim, Jungmin, (2025)
- More ...
-
The multi-compartment vehicle routing problem with flexible compartment sizes
Henke, Tino, (2014)
-
The multi-compartment vehicle routing problem with flexible compartment sizes
Henke, Tino, (2015)
-
Henke, Tino, (2019)
- More ...