CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up

摘要

This paper addresses the vehicle routing problem with sequence-constrained delivery and pick-up (VRPDP). We propose a multi-phase constructive heuristic that clusters nodes based on proximity, orients them along a route using shrink-wrap algorithm and allots vehicles using generalized assignment procedure. We employ genetic algorithm for an intensive final search. Trials on a large number of test-problems have yielded encouraging results. (c) 2006 Elsevier B.V. All rights reserved.