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。最后，