A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization

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

1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
2 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes
3 INOCS - Integrated Optimization with Complex Structure
4 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189

We address to a problem of freight transportation in supply chains. To model flows over time in the system, we use time-expanded graphs. However, the time-expanded graphs' size increases exponentially with the number of actors and the time dimension, which makes the industrial solvers inefficient to overcome real instances. To face this difficulty, we conceived an heuristic based from Boland's and Hewitt's Dynamic Discretization Discovery. We manipulates a partially time-expanded graph, componed of a small subset of nodes and arcs, and enriches it incrementally. We produce a sparse graph with the essential elements and solve the associated problem, with much less constraints and variables.

Mots clés: time-expanded graph; heuristic; supply chain; network design

Domaines: Recherche opérationnelle [math.OC]

Simon Belieres, Nicolas Jozefowiez, Frédéric Semet. A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization. ODYSSEUS 2018 - Seventh International Workshop on Freight Transportation and Logistics, Jun 2018, Cagliari, Italy. pp.4. ⟨hal-01876531⟩