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

  • Affiliations:

  • Ho Chi Minh City Institute of Physics, Vietnam Academy of Science and Technology, Vietnam;Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, Vietnam;Faculty of Computer Engineering, Ho Chi Minh City University of Information Technology, Vietnam

  • Venue:
  • ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.