Liang Yun-Chia, Minanda Vanny, Gunawan Aldy
Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan City, Taiwan.
School of Computing and Information Systems, Singapore Management University, Singapore, Singapore.
Waste Manag Res. 2022 May;40(5):519-537. doi: 10.1177/0734242X211003975. Epub 2021 Mar 25.
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.
垃圾收集路径规划问题（WCRP）可以定义为这样一个问题：在诸如车辆容量等特定约束条件下，设计一条路线，以最少的车辆服务所有客户（表示为节点），使总行驶时间或距离最短。由于垃圾产生量增加以及有效处理垃圾所涉及的所有挑战，WCRP的相关性正在上升。本研究对解决垃圾收集和路径规划问题的最新方法及其应用进行了简要综述。文中回顾了几种元启发式算法，如蚁群优化算法、模拟退火算法、遗传算法、大邻域搜索算法、贪婪随机自适应搜索过程等。还介绍了其他一些解决WCRP的方法，如地理信息系统（GIS）。最后，给出了一个实际基准的性能比较以及WCRP领域未来的研究机会。
