An exact algorithm for the Multi-Commodity two-echelon Distribution Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

An exact algorithm for the Multi-Commodity two-echelon Distribution Problem

Résumé

We consider a problem where multiple commodities are collected from the suppliers, sent to the distribution centres for consolidation purposes and delivered to the customers to fulfil their requests. We name it Multi-Commodity two-echelon Distribution Problem (MC2DP). The collection operations are performed by an unlimited fleet of homogeneous capacitated vehicles with direct trips from the suppliers to the distribution centres. Conversely, each distribution centre owns an unlimited fleet of homogeneous capacitated vehicles performing routes to deliver the commodities to the customers. All vehicles can transport any set of commodities as long as their capacity is not exceeded.
Fichier non déposé

Dates et versions

hal-03771379 , version 1 (07-09-2022)

Identifiants

  • HAL Id : hal-03771379 , version 1

Citer

Matteo Petris, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. An exact algorithm for the Multi-Commodity two-echelon Distribution Problem. VeRoLog 2022 - 8th meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization, Jun 2022, Hamburg, Germany. ⟨hal-03771379⟩
44 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More