24x7 Service; AnyTime; AnyWhere

Metaheuristics for the waste collection vehicle routing problem with time windows

Benjamin, Aida Mauziah and Beasley, J. E. (2010) Metaheuristics for the waste collection vehicle routing problem with time windows. In: 2nd International Conference on Applied Operational Research (ICAOR'10), August 05 2010 - August 27 2010, Åbo Akademi University, Turku, Finland.

[thumbnail of lnmsv.pdf] PDF
Restricted to Registered users only

Download (163kB) | Request a copy


In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Vehicle routing, Waste collection, Tabu search, Variable neighbourhood search, Variable neighbourhood tabu search
Subjects: Q Science > QA Mathematics
Divisions: College of Arts and Sciences
Depositing User: Dr. Aida Mauziah Benjamin
Date Deposited: 12 Nov 2014 01:33
Last Modified: 12 Nov 2014 01:33

Actions (login required)

View Item View Item