A Graph Reduction Heuristic For Supply ...
Type de document :
Communication dans un congrès avec actes
Titre :
A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization
Auteur(s) :
Belieres, Simon [Auteur]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Jozefowiez, Nicolas [Auteur]
Laboratoire de Conception, Optimisation et Modélisation des Systèmes [LCOMS]
Semet, Frédéric [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Jozefowiez, Nicolas [Auteur]
Laboratoire de Conception, Optimisation et Modélisation des Systèmes [LCOMS]
Semet, Frédéric [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Titre de la manifestation scientifique :
ODYSSEUS 2018 - Seventh International Workshop on Freight Transportation and Logistics
Ville :
Cagliari
Pays :
Italie
Date de début de la manifestation scientifique :
2018-06-03
Date de publication :
2018-06
Mot(s)-clé(s) en anglais :
time-expanded graph
heuristic
supply chain
network design
heuristic
supply chain
network design
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.laas.fr/hal-01876531/document
- Accès libre
- Accéder au document
- https://hal.laas.fr/hal-01876531/document
- Accès libre
- Accéder au document
- https://hal.laas.fr/hal-01876531/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Odysseus18.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Odysseus18.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Odysseus18.pdf
- Accès libre
- Accéder au document