Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
Pickup and delivery problem with time windows (PDP-TW) is a challenging scheduling problem for which each delivery is coupled with a pickup request. Metaheuristic search techniques like the tabu search have been used to solve PDP-TW. In this paper, we investigated a min-conflicts based micro-genetic algorithm combining some interesting construction heuristic, namely the Align-Fold or Boomerang, and repair heuristics including a new Swap operator and a modified billiard operator to effectively solve PDD-TW. Our results compared favorably against those of a tabu-embedded metaheuristic search on a set of modified Solomon's test cases. More importantly, our proposed heuristics can easily be integrated into many search schemes for solving other complex scheduling problems.