Abstract
This paper investigates the waste collection problem and characterizes the problem as a set-covering and vehicle routing problem (VRP) complicated by inter-arrival time constraints. The study proposes a bi-level optimization formulation to model the split delivery VRP with multiple trips to determine the minimum-distance route. The first stage optimally plans the collection points that cover all residential blocks. The second stage applies a heuristics method to solve the minimum vehicles used and minimum distance traveled for collecting residential waste. This research contributes to model this period VRP and to introduce the heuristics method to solve the problem efficiently. The study is important in laying the groundwork for understanding the possibility of improving the service level of municipal solid 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.
