Abstract
AbstractIn this work, we present a real case application of a Rollon-Rolloff Vehicle Routing Problem (RRVRP) that arises at a waste collection company in Northern Italy. Compared to other RRVRP applications, where large containers are emptied and moved, our problem presents two additional types of services regarding the collection of bulk waste materials. Moreover, the problem deals with customer selection based on an objective function with two components: outsourcing costs incurred when customers are given to a third-party logistic operator, and internal routing costs. We model the RRVRP as a Mixed Integer Program and we solve it through a commercial solver and a simple but effective Iterated Greedy algorithm. Computational results are provided on 30 real case instances. Solutions provided by the Iterated Greedy are constantly better than the ones implemented by the company, showing that relevant cost reduction can be obtained with a limited computational effort.KeywordsRollon-Rolloff Vehicle Routing ProblemIndustrial waste collectionIterated greedy
Sign-in/Register to access full text options 
Free) 
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
