A sequential approach for a multi-commodity ...
Type de document :
Article dans une revue scientifique: Article original
Titre :
A sequential approach for a multi-commodity two-echelon distribution problem
Auteur(s) :
Gu, Wenjuan [Auteur]
Beijing University of Posts and Telecommunications [BUPT]
Archetti, Claudia [Auteur]
ESSEC Business School
Cattaruzza, Diego [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Speranza, M [Auteur]
Università degli Studi di Brescia = University of Brescia [UniBs]
Beijing University of Posts and Telecommunications [BUPT]
Archetti, Claudia [Auteur]
ESSEC Business School
Cattaruzza, Diego [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Speranza, M [Auteur]
Università degli Studi di Brescia = University of Brescia [UniBs]
Titre de la revue :
Computers & Industrial Engineering
Pagination :
107793
Éditeur :
Elsevier
Date de publication :
2022-01
ISSN :
0360-8352
Mot(s)-clé(s) en anglais :
multicommodity
routing problem
local fresh food supply chain
sequential solution
routing problem
local fresh food supply chain
sequential solution
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
We address a Multi-Commodity two-echelon Distribution Problem (MC2DP) where three sets of stakeholders are involved: suppliers, distribution centers, and customers. Multiple commodities have to be sent from suppliers to ...
Lire la suite >We address a Multi-Commodity two-echelon Distribution Problem (MC2DP) where three sets of stakeholders are involved: suppliers, distribution centers, and customers. Multiple commodities have to be sent from suppliers to customers, using multiple distribution centers for consolidation purposes. Commodities are collected from the suppliers and delivered to the distribution centers with direct trips, while a fleet of homogeneous vehicles distributes commodities to customers. Commodities are compatible, that is any vehicle can transport any set of commodities as long as its capacity is not exceeded. The goal is to minimize the total transportation cost from suppliers to customers. We present two sequential schemes based on the solution, in a different order, of a collection and a delivery subproblem. In both cases, the solution of the first subproblem determines the quantity of each commodity at each distribution center. The second subproblem takes this information as input. We also propose different strategies to guide the solution of the first subproblem in order to take into account the impact of its solution on the second subproblem. The proposed sequential heuristics are evaluated and compared both on randomly generated instances and on a case study related to a short and local fresh food supply chain. The results show the impact of problem characteristics on solution strategies.Lire moins >
Lire la suite >We address a Multi-Commodity two-echelon Distribution Problem (MC2DP) where three sets of stakeholders are involved: suppliers, distribution centers, and customers. Multiple commodities have to be sent from suppliers to customers, using multiple distribution centers for consolidation purposes. Commodities are collected from the suppliers and delivered to the distribution centers with direct trips, while a fleet of homogeneous vehicles distributes commodities to customers. Commodities are compatible, that is any vehicle can transport any set of commodities as long as its capacity is not exceeded. The goal is to minimize the total transportation cost from suppliers to customers. We present two sequential schemes based on the solution, in a different order, of a collection and a delivery subproblem. In both cases, the solution of the first subproblem determines the quantity of each commodity at each distribution center. The second subproblem takes this information as input. We also propose different strategies to guide the solution of the first subproblem in order to take into account the impact of its solution on the second subproblem. The proposed sequential heuristics are evaluated and compared both on randomly generated instances and on a case study related to a short and local fresh food supply chain. The results show the impact of problem characteristics on solution strategies.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- main_MC2DP_2021-03-11.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- main_MC2DP_2021-03-11.pdf
- Accès libre
- Accéder au document