We examine neighborhood structures for heuristic search applicable to a general class of vehicle routing problems (VRPs). Our methodology utilizes a cyclic-order solution encoding, which maps a permutation of the customer set to a collection of many possible VRP solutions. We identify the best...

This paper deals with the probabilistic multi-vehicle pickup and delivery problem. We develop an efficient neighborhood evaluation procedure which allows to reduce the computational complexity by two orders of magnitude with respect to a straightforward approach. The numerical experiments...