Heuristic approaches for waste containers location problem and waste collection routes optimisation in an urban area Online publication date: Wed, 25-Jul-2018
by Othmane El Yaakoubi; Meryam Benabdouallah; Chakib Bojji
International Journal of Environment and Waste Management (IJEWM), Vol. 21, No. 4, 2018
Abstract: A generalisation of the traditional waste collection vehicle routing problem with time windows (WCVRPTW) is studied in this paper. In case of the number of waste containers is limited, some collection sites requires to be visited for multiple times per day instead of one. Therefore a waste containers management study is required to economise the collection cost. We propose an approach that combines the two problems: containers location (WCLP) and the vehicle routes optimisation. Two algorithms to solve this problem are used. The first is memetic algorithm (MA) to solve the WCLP in order to get the best containers distribution. The second is an iterated local search (ILS) algorithm to solve WCVRPTW with homogenous vehicles and taking into consideration WCLP as constraint. These algorithms are evaluated on classical vehicle routing problem (VRP) instances. The experiment results prove the impact of this combining on collection routes cost in the cited case.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Environment and Waste Management (IJEWM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook