Abstract
The paper delves into the use of smart bins to solve the problem of on time delivery and continuous monitoring of bins to ensure that they are only collected when they are filled. The purpose of this study revolves around establishing a suitable dynamic route optimization algorithm for vehicles carrying waste material. The algorithm is intended to solve the Vehicle Routing Problem (VRP) for a typical urban environment. The research study's setting is Alawali District in Mecca with 52 waste collection points (nodes) counting both depot and final delivery point (dump). Data collected included the coordinates of the nodes to determine the accurate distance between one point to another. This was analyzed to determine the shortest and efficient vehicle routes that minimize waste management costs. The study leverages the use ant colony algorithm to determine the shortest route between the filled bins and the continuous addition of the other bins as they are filled. The smart bin problem is a solution used in smart cities to further cut on the costs of waste collection by truck drivers.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
