Abstract
This paper addresses the real-life waste collection vehicle routing problem by applying Iterated Greedy (IG) and Randomized Iterated Greedy (RIG) in order to improve the processes. This kind of problem becomes more complex in developing countries in several aspects such as costs and fuel. Nowadays, the waste collection is considered as one of the interesting areas. There are three types of waste: commer-cial, residential and roll-on-roll-off. In this paper, we mainly consider the residential waste collection problem. The problem can be summa-rized as follows: a vehicle has to satisfy the demand at each customer location while satisfying the capacity of the vehicle for reducing the total cost. We report a case study that is related to waste collection in Riyadh, Kingdom of Saudi Arabia. To solve the case study problem, IG and RIG were employed. Experiments have been done on the case study data and show a better performance when compared IG algo-rithm results with RIG algorithm results. Â
Highlights
In recent years, the vehicle routing problem (VRP) is considered one of the biggest discussed combinatorial optimization problems
The VRP can be defined as a creating a number of routes for a number of known vehicles that start from a central depot to serve a number of customers locations and return back to a central depot, without exceeding the vehicle capacity at minimum total travel cost
The aim of the waste collection problem is to improve the routing of waste collection vehicles and minimizing the total travel costs
Summary
The vehicle routing problem (VRP) is considered one of the biggest discussed combinatorial optimization problems. Different types of algorithms techniques have been implemented in order to solve VRP. Waste collection problems have been receiving increasing attention from many researchers. Waste collections have been developed and implemented in different vehicle routing problems. The waste collection has been divided into three areas: commercial, residential, and roll-on-roll-off each area is very different from each other. The aim of the waste collection problem is to improve the routing of waste collection vehicles and minimizing the total travel costs.
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Advanced Statistics and Probability
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
