Advertisement
Published in:
2013 | OriginalPaper | Chapter
A Memetic Algorithm for Waste Collection Vehicle Routing Problem with Time Windows and Conflicts
Authors : Thai Tieu Minh, Tran Van Hoai, Tran Thi Nhu Nguyet
Published in: Computational Science and Its Applications – ICCSA 2013
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We address an application of vehicle routing problem (VRP) in the real life, namely waste collection problem. Constraints are considered including conflicts between waste properties, time windows of the waste, and multiple landfills. A combination of flow and set partitioning formulation is suggested to model the problem in case of multi-objective optimization. To minimize the total traveling time and number of vehicles of solution, we propose using a memetic algorithm (MA) with
λ
-interchange mechanism. The
λ
-interchange operator is modified to be compatible with new sub-routes construction for the multiple landfills.
In experiments, we compare the result of proposed MA method with some good results published as well as other meta-heuristic algorithms. The density of conflict matrix is also considered to understand its influence on the quality of the solution. Experimental results show that our approach can be competitive to other results in the VRP with time windows. Furthermore, the algorithm outperforms others in the VRP with time windows and conflict.