Supply chain transportation plans optimization - Time-expanded graph enrichment heuristic

Simon Belieres 1 Nicolas Jozefowiez 1 Frédéric Semet 2
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
2 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
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.
Type de document :
Communication dans un congrès
8th International Conference on Computational Logistics (ICCL 2017), Oct 2017, Southampton, United Kingdom. 2017
Liste complète des métadonnées

https://hal.inria.fr/hal-01664325
Contributeur : Frédéric Semet <>
Soumis le : jeudi 14 décembre 2017 - 16:58:56
Dernière modification le : samedi 27 octobre 2018 - 01:27:18

Identifiants

  • HAL Id : hal-01664325, version 1

Citation

Simon Belieres, Nicolas Jozefowiez, Frédéric Semet. Supply chain transportation plans optimization - Time-expanded graph enrichment heuristic. 8th International Conference on Computational Logistics (ICCL 2017), Oct 2017, Southampton, United Kingdom. 2017. 〈hal-01664325〉

Partager

Métriques

Consultations de la notice

321