• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Supply chain transportation plans optimization ...
  • BibTeX
  • CSV
  • Excel
  • RIS

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]
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
HAL domain(s) :
Informatique [cs]/Recherche opérationnelle [cs.RO]
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 >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.laas.fr/hal-01876536/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.laas.fr/hal-01876536/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.laas.fr/hal-01876536/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.laas.fr/hal-01876536/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017