Supply chain transportation plans optimization Time-expanded graph enrichment heuristic - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2017

Supply chain transportation plans optimization Time-expanded graph enrichment heuristic

Abstract

We adress 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 in-crementally. 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
Iccl17.pdf (157 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01876536 , version 1 (18-09-2018)

Identifiers

  • HAL Id : hal-01876536 , version 1

Cite

Simon Belieres, Nicolas Jozefowiez, Frédéric Semet. Supply chain transportation plans optimization Time-expanded graph enrichment heuristic. ICCL 2017 - 8th International Conference on Computational Logistics, Oct 2017, Southampton, United Kingdom. ⟨hal-01876536⟩
306 View
1 Download

Share

Gmail Facebook Twitter LinkedIn More