Abstract
Collection and transportation of municipal solid waste (MSW) is a critical factor that governs the overall cost of the MSW management system. With the help of various technological interventions, optimal usage of available resources could bring about a considerable amount of savings. In this study, an attempt has been made to optimize the MSW collection vehicle route path to reduce the fuel, distance, and overall workload in local municipalities by adopting dynamic graph modeling. The optimization problem is addressed from three different perspectives, namely, (a) analyzing the dynamic nature of the user requests, (b) the influence of the number of waste collection vehicles available in a given area, and (c) determining the optimum number of vehicles for which the overall cost is minimized. Relevant simulation studies are carried out to validate the proposed approach.
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 call
