Multi-period distribution networks with ...
Type de document :
Article dans une revue scientifique: Article original
Titre :
Multi-period distribution networks with purchase commitment contracts
Auteur(s) :
Clavijo López, Christian [Auteur]
HEC Liège
Crama, Yves [Auteur]
HEC Liège
Pironet, Thierry [Auteur]
HEC Liège
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
HEC Liège
Crama, Yves [Auteur]
HEC Liège
Pironet, Thierry [Auteur]
HEC Liège
Semet, Frédéric [Auteur]

Integrated Optimization with Complex Structure [INOCS]
Titre de la revue :
European Journal of Operational Research
Pagination :
556-572
Éditeur :
Elsevier
Date de publication :
2024
ISSN :
0377-2217
Mot(s)-clé(s) en anglais :
transportation
supply chain management
contracts
network design
matheuristics
supply chain management
contracts
network design
matheuristics
Discipline(s) HAL :
Informatique [cs]
Computer Science [cs]/Operations Research [math.OC]
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
Retailers which deliver products directly to their customer locations often rely on Logistics Service Intermediaries (LSI) for order management, warehousing, transportation and distribution services. Usually, the LSI acts ...
Lire la suite >Retailers which deliver products directly to their customer locations often rely on Logistics Service Intermediaries (LSI) for order management, warehousing, transportation and distribution services. Usually, the LSI acts as a shipper and subcontracts the transportation to carriers for longhaul and last-mile delivery services. All agents interact and are connected through cross-docking facilities. As the demand from customers may vary significantly over time, the shipper's requirements for transportation evolve accordingly at the tactical level. This creates opportunities for the LSI to take advantage of medium-term contracts with the carriers at prices lower than those offered by the spot market. In this article, we propose a MILP formulation for the multi-period planning problem with minimum purchase commitment contracts faced by the LSI. The study focuses on designing dynamically, at a tactical level, a suitable network of cross-docking facilities and related transportation capacities (belonging to different carriers) to reduce the LSI operational costs in the long term. We propose several exact and heuristic decomposition methods for the the model, respectively, based on combinatorial Benders cuts and on relax-and-repair approaches. The performance of these algorithms is experimentally compared to that of commercial solvers (brand-and-cut and classical Benders). The numerical results show that our methods bring benefits for the solution of large size instances.Lire moins >
Lire la suite >Retailers which deliver products directly to their customer locations often rely on Logistics Service Intermediaries (LSI) for order management, warehousing, transportation and distribution services. Usually, the LSI acts as a shipper and subcontracts the transportation to carriers for longhaul and last-mile delivery services. All agents interact and are connected through cross-docking facilities. As the demand from customers may vary significantly over time, the shipper's requirements for transportation evolve accordingly at the tactical level. This creates opportunities for the LSI to take advantage of medium-term contracts with the carriers at prices lower than those offered by the spot market. In this article, we propose a MILP formulation for the multi-period planning problem with minimum purchase commitment contracts faced by the LSI. The study focuses on designing dynamically, at a tactical level, a suitable network of cross-docking facilities and related transportation capacities (belonging to different carriers) to reduce the LSI operational costs in the long term. We propose several exact and heuristic decomposition methods for the the model, respectively, based on combinatorial Benders cuts and on relax-and-repair approaches. The performance of these algorithms is experimentally compared to that of commercial solvers (brand-and-cut and classical Benders). The numerical results show that our methods bring benefits for the solution of large size instances.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-03715328/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-03715328/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-03715328/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Multi_period_distribution_networks_with_purchase_commitment_contracts_.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Multi_period_distribution_networks_with_purchase_commitment_contracts_.pdf
- Accès libre
- Accéder au document