Abstract
In this paper, we consider a complex garbage collection problem, where the residents of a particular area dispose of recyclable garbage, which is collected and managed using a fleet of trucks with different weight capacities and volume. This tour is characterized by a set of constraints such as the maximum tour duration (in term of distance and the timing) consumed to collect wastes from several locations. This problem is modeled as a garbage collection vehicle routing problem, which aims to minimize the cost of traveling routes (minimizing the distance traveled) by finding optimal routes for vehicles such that all waste bins are emptied and the waste is driven towards the disposal locations. We propose a distributed technique based on the Ant Colony system Algorithm to find optimal routes that help vehicles to visit all the wastes bins using interactive agents consumed based on the behavior of real ants. The designed solution will try to create a set of layers to control and manage the waste collection, each layer will be handled by an intelligent agent which is characterized by a specific behavior, in this architecture a set of behaviors have been designed to optimizing routes and control the real time capacity of vehicles. Finally, manage the traffic messages between the different agents to select the best solutions that will be assigned to each vehicle. The developed solution performs well compared to the traditional solution on small cases.
Highlights
The vehicle routing problem [1]-[3] includes the optimization of a set of minimum cost transportation routes to serve a various set of customers using a dynamic or a fixed fleet of transportation trucks
In terms of solving GCS (Garbage collection system), there are several meta-heuristic methods that have been developed such as particle swarm optimization (PSO) [15], simulated annealing (SA) [16]
A distributed waste collection vehicle routing system has been modeled in this work, which considers the re-routing of the system when one of the vehicles meet his capacity limit during the collecting process
Summary
The vehicle routing problem [1]-[3] includes the optimization of a set of minimum cost transportation routes to serve a various set of customers using a dynamic or a fixed fleet of transportation trucks (vehicles, trucks ...). With the new intelligent systems, we can create a new distributed mechanism to control the map of the waste locations and the disposal facilities to built a new path planning for each vehicle based on real time data sent by the vehicle which contains his actual position and his capacity. According to this information, the system will be able to assign the best circuit to the nearest vehicle.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
