Vehicle routing problem applied for demand controlled waste collection
MetadataShow full item record
- Master of Science 
The main purpose of this thesis is to look into the possible improvements by switching from fixed to demand controlled routes. In cooperation with Renovasjonsetaten (REN) and Sørum Transport we have looked into the collection process of glass and metal waste in the Oslo area. We have studied if there is a possible improvement in the concern of total driving distance and service level by switching from static to dynamic collection routes by investing in sensors in the containers. We have based our methodology around management science and operations research. The developed models are based on the theory around Vehicle Routing Problem, and solution procedures as the Nearest Neighbor Algorithm and Clarke and Wright´s Savings Algorithm. Simulation for a whole year has been performed in order to compare the two different methods. The results show that there are possibilities to improve the collection of glass and metal waste by eliminating the driving to both empty and half full waste containers, and prioritizing the containers that are filled above 80% of their capacity. The results also show that by installing sensors it becomes easier to utilize the waste containers more and save time in the collection process.