A heuristic with a performance guarantee for the Commodity constrained Split Delivery Vehicle Routing Problem - ESSEC Business School Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

A heuristic with a performance guarantee for the Commodity constrained Split Delivery Vehicle Routing Problem

Résumé

The Commodity constrained Split Delivery Vehicle Routing Problem (C-SDVRP) is a routing problem where customer demands are composed of multiple commodities. A fleet of capacitated vehicles must serve customer demands in a way that minimizes the total routing costs. Vehicles can transport any set of commodities and customers are allowed to be visited multiple times. However, the demand for a single commodity must be delivered by one vehicle only. In this work, we developed a heuristic with a performance guarantee to solve the C-SDVRP. The proposed heuristic is based on a set covering formulation, where the exponentially-many variables correspond to routes. First, a subset of the variables is obtained by solving the linear relaxation of the formulation by means of a column generation approach which embeds a new pricing heuristic aimed to reduce the computational time. Solving the linear relaxation gives a valid lower bound used as a performance guarantee for the heuristic. Then, we devise a restricted master heuristic to provide good upper bounds: the formulation is restricted to the subset of variables found so far and solved as an integer program with a commercial solver. A local search based on a mathematical programming operator is applied to improve the solution. We test the heuristic algorithm on benchmark instances from the literature. Several new (best-known) solutions are found in reasonable computational time. The comparison with the state of the art heuristics for solving C-SDVRP shows that our approach significantly improves the solution time, while keeping a comparable solution quality.
Fichier principal
Vignette du fichier
A heuristic with a performance guarantee for the Commodity constrained Split Delivery Vehicle Routing Problem.pdf (479.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03924873 , version 1 (05-01-2023)

Identifiants

  • HAL Id : hal-03924873 , version 1

Citer

Matteo Petris, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. A heuristic with a performance guarantee for the Commodity constrained Split Delivery Vehicle Routing Problem. 2023. ⟨hal-03924873⟩

Relations

132 Consultations
131 Téléchargements

Partager

Gmail Facebook X LinkedIn More