Publication Type

Journal Article

Version

acceptedVersion

Publication Date

3-2021

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

Waste collection routing problem, metaheuristic, optimization, vehicle routing problem, solid waste, geographic information system

Discipline

Numerical Analysis and Scientific Computing | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Optimization

Publication

Waste Management and Research

First Page

1

Last Page

19

ISSN

0734-242X

Identifier

10.1177/0734242X211003975

Publisher

SAGE

Embargo Period

7-12-2021

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1177/0734242X211003975

Download

Share

COinS