Waste collection routing problem: A mini-review of recent heuristic approaches and applications
- 25 March 2021
- journal article
- review article
- Published by SAGE Publications in Waste Management & Research: The Journal for a Sustainable Circular Economy
- Vol. 40 (5) , 519-537
Abstract
The waste collection routing problem (WCRP) can be defined as a problem of designing a route to serve all of the customers (represented as nodes) with the least total traveling time or distance, served by the least number of vehicles under specific constraints, such as vehicle capacity. The relevance of WCRP is rising due to its increased waste generation and all the challenges involved in its efficient disposal. This research provides a mini-review of the latest approaches and its application in the collection and routing of waste. Several metaheuristic algorithms are reviewed, such as ant colony optimization, simulated annealing, genetic algorithm, large neighborhood search, greedy randomized adaptive search procedures, and others. Some other approaches to solve WCRP like GIS is also introduced. Finally, a performance comparison of a real-world benchmark is presented as well as future research opportunities in WCRP field.Keywords
This publication has 54 references indexed in Scilit:
- A Tabu Search Method for a Bi‐Objective Urban Waste Collection ProblemComputer-Aided Civil and Infrastructure Engineering, 2013
- The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics ContextProcedia - Social and Behavioral Sciences, 2012
- Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilitiesComputers & Operations Research, 2010
- Sustainable solid waste management: An integrated approach for Asian countriesWaste Management, 2009
- A new model for the hazardous waste location-routing problemComputers & Operations Research, 2007
- Waste collection vehicle routing problem with time windowsComputers & Operations Research, 2006
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problemJournal of Zhejiang University-SCIENCE A, 2006
- Competitive Memetic Algorithms for Arc Routing ProblemsAnnals of Operations Research, 2004
- A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing ProblemEuropean Journal of Operational Research, 1996
- Networks and vehicle routing for municipal waste collectionNetworks, 1974