Supply chain transportation plans optimization Time-expanded graph enrichment heuristic - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Supply chain transportation plans optimization Time-expanded graph enrichment heuristic

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01876536 , version 1

Citer

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⟩
320 Consultations
7 Téléchargements

Partager

Gmail Facebook X LinkedIn More