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.