A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover

Abstract

The pickup and delivery problem with time windows (PDP TW) is a variant of the vehicle routing problem. In this paper, we present an memetic algorithm (MA) for the PDPTW. Particular attention is paid to the design of the crossover because it is usually very hard to design an effective crossover operator for tightly constrained problems such as the PDPTW. Experimental results on Li and Lim's benchmarks demonstrate that our MA is competitive with existing approaches and improves 146 best-known solutions out of 298 instances.