The waste collection vehicle routing problem with time windows in a city logistics context

Publication: Research - peer-reviewConference article – Annual report year: 2012

NullPointerException

View graph of relations

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
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
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
literature as well as for instances provided by a Danish garbage collection company.
Original languageEnglish
JournalProcedia - Social and Behavioral Sciences
Publication date2012
Volume39
Pages241-254
ISSN1877-0428
DOIs
StatePublished

Conference

Conference7th International Conference on City Logistics
CountrySpain
CityMallorca Island
Period07/07/1109/07/11
CitationsWeb of Science® Times Cited: 0

Keywords

  • Waste collection, Vehicle routing, Reverse logistics, Optimisation, Case study
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 9785034