Adaptive large neighborhood search for the commodity constrained split delivery VRP
Abstract
This paper addresses the commodity constrained split delivery vehicle routing problem (C-SDVRP) where customers require multiple commodities. This problem arises when customers accept to be delivered separately. All commodities can be mixed in a vehicle as long as the vehicle capacity is satisfied. Multiple visits to a customer are allowed, but a given commodity must be delivered in one delivery. In this paper, we propose a heuristic based on the adaptive large neighborhood search (ALNS) to solve the C-SDVRP, with the objective of efficiently tackling medium and large sized instances. We take into account the distinctive features of the C-SDVRP and adapt several local search moves to improve a solution. Moreover, a mathematical programming based operator (MPO) that reassigns commodities to routes is used to improve a new global best solution. Computational experiments have been performed on benchmark instances from the literature. The results assess the efficiency of the algorithm, which can provide a large number of new best-known solutions in short computational times.
Origin | Files produced by the author(s) |
---|
Loading...