The waste collection vehicle routing problem with time windows in a city logistics context
Publication: Research - peer-review › Conference article – Annual report year: 2012
Standard
The waste collection vehicle routing problem with time windows in a city logistics context. / Buhrkal, Katja Frederik; Larsen, Allan; Røpke, Stefan.
In: Procedia - Social and Behavioral Sciences, Vol. 39, 2012, p. 241-254.Publication: Research - peer-review › Conference article – Annual report year: 2012
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - CONF
T1 - The waste collection vehicle routing problem with time windows in a city logistics context
A1 - Buhrkal,Katja Frederik
A1 - Larsen,Allan
A1 - Røpke,Stefan
AU - Buhrkal,Katja Frederik
AU - Larsen,Allan
AU - Røpke,Stefan
PB - Elsevier BV
PY - 2012
Y1 - 2012
N2 - Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with <br/>finding cost optimal routes for garbage trucks such that all garbage bins are emptied and the waste is driven to disposal sites while respecting customer time windows and ensuring that drivers are given the breaks that the law <br/>requires. We propose an adaptive large neighborhood search algorithm for solving the problem and illustrate the usefulness of the algorithm by showing that the algorithm can improve the objective of a set of instances from the <br/>literature as well as for instances provided by a Danish garbage collection company.
AB - Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with <br/>finding cost optimal routes for garbage trucks such that all garbage bins are emptied and the waste is driven to disposal sites while respecting customer time windows and ensuring that drivers are given the breaks that the law <br/>requires. We propose an adaptive large neighborhood search algorithm for solving the problem and illustrate the usefulness of the algorithm by showing that the algorithm can improve the objective of a set of instances from the <br/>literature as well as for instances provided by a Danish garbage collection company.
KW - Waste collection
KW - Vehicle routing
KW - Reverse logistics
KW - Optimisation
KW - Case study
U2 - 10.1016/j.sbspro.2012.03.105
DO - 10.1016/j.sbspro.2012.03.105
JO - Procedia - Social and Behavioral Sciences
JF - Procedia - Social and Behavioral Sciences
SN - 1877-0428
VL - 39
SP - 241
EP - 254
ER -