A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2018

A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization

Abstract

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.
Fichier principal
Vignette du fichier
Odysseus18.pdf (150.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01876531 , version 1 (26-09-2018)

Identifiers

  • HAL Id : hal-01876531 , version 1

Cite

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⟩
111 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More