Skip to Main content Skip to Navigation
Theses

Mathematical programming for tactical transportation planning in a multi-product supply chain

Simon Belieres 1
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : The problem we study is inspired by an industrial collaboration between a third-party logistics, DHL Supply Chain, and a large French restaurant chain. As part of this partnership, DHL Supply Chain coordinates the actors of a domestic logistics network composed of suppliers, warehouses and restaurants. Over a certain time horizon, the restaurants issue requests of generic products (frozen products, beverages, etc.) that are manufactured by the suppliers. The mission of DHL Supply Chain is to ensure the supply of the restaurants. For that purpose, the company determines the shipping origin of each product ordered and designs a loading plan that characterizes the routes followed by the goods. DHL Supply Chain wants to develop innovative solutions to improve its competitiveness and optimize the profitability of its logistics operations. In this thesis, we present the Logistics Service Network Design Problem (LSNDP) which formalizes the problematic of planning transportation operations in a supply chain. Our work aims to provide methodological solutions for solving industrial instances of the LSNDP. However, these industrial instances are too complex to be solved by generic operations research methods. We thus propose several algorithms that overcome the scaling of the parameters. In particular, we develop a graph reduction heuristic, as well as a dynamic Benders strategy that adapts to the increasing number of products. Through various computational studies, we evaluate the scalability of each algorithm with respect to the considered parameter. Finally, we combine these methods for the resolution of a real case.
Document type :
Theses
Complete list of metadatas

Cited literature [101 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02385700
Contributor : Abes Star :  Contact
Submitted on : Wednesday, March 4, 2020 - 12:04:08 PM
Last modification on : Tuesday, May 26, 2020 - 6:26:02 PM

File

2019BelieresSimon.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02385700, version 2

Citation

Simon Belieres. Mathematical programming for tactical transportation planning in a multi-product supply chain. Automatic Control Engineering. INSA de Toulouse, 2019. English. ⟨NNT : 2019ISAT0022⟩. ⟨tel-02385700v2⟩

Share

Metrics

Record views

126

Files downloads

274