Supply chain transportation plans optimization ...
Document type :
Communication dans un congrès avec actes
Title :
Supply chain transportation plans optimization Time-expanded graph enrichment heuristic
Author(s) :
Belieres, Simon [Auteur]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Jozefowiez, Nicolas [Auteur]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Jozefowiez, Nicolas [Auteur]
Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes [LAAS-ROC]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Conference title :
ICCL 2017 - 8th International Conference on Computational Logistics
City :
Southampton
Country :
Royaume-Uni
Start date of the conference :
2017-10-18
Journal title :
Computational Logistics : 8th International Conference, ICCL 2017, Southampton, UK, October 18-20, 2017, Proceedings
Publication date :
2017-10
English keyword(s) :
supply chain
time-expanded graph
heuristic
time-expanded graph
heuristic
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.laas.fr/hal-01876536/document
- Open access
- Access the document
- https://hal.laas.fr/hal-01876536/document
- Open access
- Access the document
- https://hal.laas.fr/hal-01876536/document
- Open access
- Access the document
- https://hal.laas.fr/hal-01876536/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Iccl17.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- Iccl17.pdf
- Open access
- Access the document