A sequential approach for a multi-commodity ...
Document type :
Article dans une revue scientifique: Article original
Title :
A sequential approach for a multi-commodity two-echelon distribution problem
Author(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]
Journal title :
Computers & Industrial Engineering
Pages :
107793
Publisher :
Elsevier
Publication date :
2022-01
ISSN :
0360-8352
English keyword(s) :
multicommodity
routing problem
local fresh food supply chain
sequential solution
routing problem
local fresh food supply chain
sequential solution
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03167379/document
- Open access
- Access the document
- document
- Open access
- Access the document
- main_MC2DP_2021-03-11.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- main_MC2DP_2021-03-11.pdf
- Open access
- Access the document