Waste Collection Vehicle Routing Problem with Time Windows using Multi-Objective Genetic Algorithms

B.M. Ombuki-Berman, A. Runka, and F.T. Hanshar (Canada)


waste collection, vehicle routing problem with time win dows, genetic algorithms, multi-objective optimization, Pareto ranking


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 al gorithm for the waste collection VRPTW using a set of benchmark data from real-world problems obtained by Kim et al.

Important Links:

Go Back