A Time-Expanded Network Reduction Matheuristic for the Logistics Service Network Design Problem

Simon Belieres (1) , Mike Hewitt (2) , Nicolas Jozefowiez (3) , Frédéric Semet (4)

1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
2 Loyola University [Chicago]
3 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes
4 INOCS - Integrated Optimization with Complex Structure

Planning cost-effective logistics operations involve the integration of multiple decision-making levels. In thedomain of supply chain management, the last decades have seen the emergence of 3PL service providers thatspecialize in integrating warehousing and transportation services. In this paper, we study the operations performedby a 3PL in the supply chain management of a French restaurant chain. The transportation planning process isassisted by solving the Logistics Service Network Design Problem (LSNDP). As realistic instances are too largefor on-the-shelf optimization solvers to solve in acceptable run-times, we develop a network reduction heuristicinspired by the recent Dynamic Discretization Discovery algorithm. Through an extensive series of experimentscarried out on instances based on the operations of an industrial partner, we demonstrate the efficiency of theproposed approach. We also investigate the impact of the distribution strategy used in practice to determine thetransportation plan and how this distribution strategy can be modified to reduce the overall logistics costs.

Mots clés: Logistics; Service Network Design; Dynamic Discretization Discovery; Integer Programming; Heuristics

Domaines: Mathématique discrète [cs.DM]; Recherche opérationnelle [math.OC]

Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet. A Time-Expanded Network Reduction Matheuristic for the Logistics Service Network Design Problem. Transportation Research Part E: Logistics and Transportation Review, 2021, 147, pp.102203. ⟨10.1016/j.tre.2020.102203⟩. ⟨hal-03116634⟩