# Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection +
## 2 Literature Review  
The problem of smart waste collection appeared in research a few years ago as part of the development of cities, what we call smart cities. Many researchers have proposed models of waste collection using information and communication technologies. In the literature, most of the authors researching smart waste management consider that each container contains a sensor that measures waste level and triggers alarms, which are communicated wirelessly to municipal agents to maximize the amount of waste collected while minimizing costs. In this context, we present below various optimization studies of separate and intelligent collections of which we are aware. [PERSON] et al. (2018) [10] designed a waste collection system based on the use of sensors that transmit information in real-time. These sensors are associated with optimization procedures that provide information about optimal collection methods. The work compares three different approaches, which define dynamic collection routes taking into account the information provided by sensors installed inside containers: a limited approach, an intelligent collection approach, and a more intelligent collection approach. In the same year, the same authors studied the dynamic problem of waste collection in the same context of smart bins. A Capacitated Vehicle Routing Problem (CVRP) has been developed to maximize the amount of collected waste while minimizing the distance traveled. The results show that using sensors inside containers improves the profit of waste management companies. [PERSON] et al. (2018) [11] proposed a monitoring and smart waste management platform in urban areas. A model is developed to obtain the weight measurements, filling volume, and waste container temperature. The forum contains a model to improve waste collection methods; this model creates dynamic paths based on the obtained data to save energy, time, therefore, costs. It also has a mobile application that guides each driver to the best route. [PERSON] et al. (2018) [12] propose a linear programming model to find the optimal trajectories to minimize costs or waits so that the trajectory aid works in real-time. The authors proposed three heuristic solutions addressing the problem of efficient and intelligent waste management. These heuristics are the closest vehicle first; a collection takes into account an upper threshold, and supply takes into account the upper and lower thresholds. In 2020, [PERSON] et al. [13] introduced an intelligent ICT-based system to collect sorted waste with the objective is to improve sustainability and vehicle workload balancing and minimizing transportation and carbon tax costs. The article proposes a new hybrid multi-objective algorithm based on genetic algorithms and the optimization of whales to optimize the proposed system. In 2019, [PERSON] et al. [14] presented the problem of smart waste collection; the authors are developing a simple mathematical model, and they are proposing/discussing a computational approach to solve the waste collection problem; the article proposes two objectives, the primary aim is to optimize the dynamic planning of the daily schedules of the collection vehicles to minimize transportation costs, and the secondary objective is to make the optimal decision about the containers that are not entirely filled, especially those that are in the path that connects the full containers; [PERSON] et al. [15] introduced a dynamic architecture for waste collection; the authors paid particular attention to advance services in priority areas, such as markets, universities, hospitals, etc., where there is likely to be hazardous waste that negatively affects human life and requires quick collection; they proposed new algorithms to provide practical solutions to the problem of a dynamic and instantaneous waste collection, whose objective is to reduce the time needed to serve priority areas. Since our research model is an extension of the classic Dynamic Vehicle Routing Problem (DVRP) model, we also present some literature reviews on DVRP.