Adaptive large neighborhood search for the commodity constrained split delivery VRP

Gu, Wenjuan; Cattaruzza, Diego; Ogier, Maxime; Semet, Frédéric

Document type :

Compte-rendu et recension critique d'ouvrage

DOI :

10.1016/j.cor.2019.07.019

Title :

Adaptive large neighborhood search for the commodity constrained split delivery VRP

Author(s) :

Gu, Wenjuan [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Cattaruzza, Diego [Auteur]

Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]

Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]

Integrated Optimization with Complex Structure [INOCS]

Journal title :

Computers and Operations Research

Pages :

104761

Publisher :

Elsevier

Publication date :

2019

ISSN :

0305-0548

English keyword(s) :

adaptive large neighborhood search
multiple commodities
local search
vehicle routing problem

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Popular science :

Non

Collections :