Adaptive large neighborhood search for the commodity constrained split delivery VRP - Archive ouverte HAL
Journal Articles Computers and Operations Research Year : 2019

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.
Fichier principal
Vignette du fichier
COR_C-SDVRP.pdf (1.08 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02317246 , version 1 (15-10-2019)

Identifiers

Cite

Wenjuan Gu, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. Adaptive large neighborhood search for the commodity constrained split delivery VRP. Computers and Operations Research, 2019, 112, pp.104761. ⟨10.1016/j.cor.2019.07.019⟩. ⟨hal-02317246⟩
114 View
240 Download

Altmetric

Share

More