The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context | Zendy

Katja Buhrkal | Zendy; Allan Larsen | Zendy; Stefan Røpke | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context

Author(s) -

Katja Buhrkal,

Allan Larsen,

Stefan Røpke

Publication year - 2012

Publication title -

procedia - social and behavioral sciences

Language(s) - English

Resource type - Journals

ISSN - 1877-0428

DOI - 10.1016/j.sbspro.2012.03.105

Subject(s) - garbage , vehicle routing problem , garbage collection , truck , waste collection , computer science , context (archaeology) , operations research , set (abstract data type) , routing (electronic design automation) , transport engineering , municipal solid waste , engineering , waste management , computer network , automotive engineering , paleontology , biology , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research