A Graph Reduction Heuristic For Supply ...
Document type :
Communication dans un congrès avec actes
Title :
A Graph Reduction Heuristic For Supply Chain Transportation Plan Optimization
Author(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]
Conference title :
ODYSSEUS 2018 - Seventh International Workshop on Freight Transportation and Logistics
City :
Cagliari
Country :
Italie
Start date of the conference :
2018-06-03
Publication date :
2018-06
English keyword(s) :
time-expanded graph
heuristic
supply chain
network design
heuristic
supply chain
network design
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.laas.fr/hal-01876531/document
- Open access
- Access the document
- https://hal.laas.fr/hal-01876531/document
- Open access
- Access the document
- https://hal.laas.fr/hal-01876531/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Odysseus18.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- Odysseus18.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- Odysseus18.pdf
- Open access
- Access the document