The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands

Abstract

In this paper, we extend, analyze and evaluate the exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, originally proposed by Angel et al. (2008). In this neighborhood, a neighbor solution is obtained by the removal of a set of mobile nodes from a solution and a subsequent best reinsertion. At first, we examine theoretical properties of the neighborhood, such as its connectivity and the question how many nodes may be chosen as mobile. Furthermore, we prove that finding a best set of mobile nodes is NP-hard. Then, we present a two-stage approach in which first mobile nodes are selected heuristically and reinserted in an optimal way afterwards. Finally, this approach is embedded into a simulated annealing procedure and compared to other heuristics known for the more general vehicle routing problem with arbitrary demands. (C) 2020 Elsevier Ltd. All rights reserved.