Abstract
This study sought a solution to the problem of garbage collection and finding the optimal garbage distribution route starting from the Temporary Waste Disposal Site (TPS) to the Final Disposal Site (TPA) using available vehicles based on the capacity spread in each polling station. This study proposes an optimization formulation to model VRP; shipping is divided into several locations to determine the minimum distance route. The first stage optimally determines the transient trash collection points that cover all aspects of the city area. The second stage applies the Saving Matrix method, where this method is used to find the distance from each destination by minimizing the length taken in the process of distributing waste from each polling station to the final destination of the landfill. This research contributes to modelling the VRP in current conditions and introducing heuristic methods to solve problems efficiently. This study is significant to do to apply the basis for understanding the possibility of increasing service levels in the distribution process of the municipal waste collection.
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.
