Real-time weighting optimization in Chinese Postman Problem

Amine El Ouazzani 1, 2 Toufik Bakir 1, * Patrice Béché 2 Patrick Marquié 1
* Auteur correspondant
1 Le2i - Laboratoire Electronique, Informatique et Image [UMR6303]
2 SPIE
Abstract : In this study, based on real-time constraint, an optimization method is proposed for solving the problem of the optimal tour. For that, we will construct a graph containing the real-time state of traffic. The collected data will be used to predict the future state traffic and to give an optimized cost of the tour. This optimization is tested in different sizes of the road networks. The results show that the proposed method is efficient and effective in solving the Chinese Postman Problem in real-time.
Type de document :
Communication dans un congrès
Liste complète des métadonnées
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00872864
Contributeur : Patrick Marquié <>
Soumis le : lundi 14 octobre 2013 - 15:09:00
Dernière modification le : vendredi 24 mai 2019 - 15:20:09

Identifiants

  • HAL Id : hal-00872864, version 1

Collections

CNRS | UNIV-BOURGOGNE | LE2I | TDS-MACS | ICB | UNIV-HESAM

Citation

Amine El Ouazzani, Toufik Bakir, Patrice Béché, Patrick Marquié. Real-time weighting optimization in Chinese Postman Problem. 16th International IEEE Annual Conference on Intelligent Transportation Systems (ITSC 2013), Oct 2013, Netherlands. pp.1594-1598. ⟨hal-00872864⟩

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

321

Contact

CCSD