A continuous‐time service network design and vehicle routing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2024

A continuous‐time service network design and vehicle routing problem

Résumé

This paper considers the integrated planning of goods transportation through a multi‐echelon supply chain consisting of a nationwide network and regional distribution system. The previously studied Service Network Design and Routing Problem considered similar planning decisions, albeit with multiple restrictions regarding the transportation of goods that can eliminate the opportunities for transportation savings. It also does not explicitly model the opportunity to increase vehicle utilization by having vehicles serve multiple purposes within the supply chain. We propose a mathematical model of the problem we consider that is inspired by the operations of an industrial partner. We present an adaptation of the Dynamic Discretization Discovery algorithm to solve this problem and illustrate its computational effectiveness on instances derived from the operations of a retail distribution network in France. Finally, we illustrate the potential savings enabled by solving the proposed model.
Fichier principal
Vignette du fichier
Networks___SNDRP2021_final.pdf (512.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : Copyright (Tous droits réservés)

Dates et versions

hal-04275977 , version 1 (08-11-2023)

Identifiants

Citer

Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton. A continuous‐time service network design and vehicle routing problem. Networks, 2024, 83 (2), pp.300-323. ⟨10.1002/net.22194⟩. ⟨hal-04275977⟩
28 Consultations
83 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More