Titre :

Supply chain transportation plans optimization Time-expanded graph enrichment heuristic

Auteur(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]

Titre de la manifestation scientifique :

ICCL 2017 - 8th International Conference on Computational Logistics

Ville :

Southampton

Pays :

Royaume-Uni

Date de début de la manifestation scientifique :

2017-10-18

Titre de la revue :

Computational Logistics : 8th International Conference, ICCL 2017, Southampton, UK, October 18-20, 2017, Proceedings

Date de publication :

2017-10

Mot(s)-clé(s) en anglais :

supply chain
time-expanded graph
heuristic

Discipline(s) HAL :

Computer Science [cs]/Operations Research [math.OC]

Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL