Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms

  • Authors:
  • Beatrice M. Ombuki-Berman;Andrew Runka;Franklin T. Hanshar

  • Affiliations:
  • Brock University, St. Catharines, ON, Canada;Brock University, St. Catharines, ON, Canada;University of Guelph, Guelph, Ontario

  • Venue:
  • CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study a waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and driver's lunch breaks. Recently Kim et al. [1] introduced and addressed this problem using an extension of the well-known Solomon's insertion approach, and a clustering-based algorithm. We propose and present the results of an initial study of a multi-objective genetic algorithm for the waste collection VRPTW using a set of benchmark data from real-world problems obtained by Kim et al.