A bidirectional/multi-queue algorithm for the bi-objective multimodal viable shortest path problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

A bidirectional/multi-queue algorithm for the bi-objective multimodal viable shortest path problem

Fallou Gueye
  • Fonction : Auteur
Christian Artigues
Marie-José Huguet
Frédéric Schettini
  • Fonction : Auteur
Laurent Dezou
  • Fonction : Auteur

Résumé

Taking into account the multimodality of urban transportation networks for computing the itinerary of an individual passenger introduces a number of additional constraints such as restriction and/or preferences in using some modes. Such constraints are gathered under the concept of viable path modeled by a deterministic finite state automaton. In this paper we propose several polynomial algorithms to tackle a bi-objective problem where the goal is to find all the non-dominated viable paths under the two objectives ''travel time'' and ''number of modal transfers''. These algorithms are a variant of a topological label-setting algorithm provided by Lozano and Storchi 2001, a new multi-queue algorithm, as well as its bidirectional variant. The different algorithms are compared on a real network. The results show that the proposed algorithms are efficient and well suited for practical use. The proposed bidirectional algorithm outperforms other algorithms.
Fichier principal
Vignette du fichier
ATMOS-GAH-Mjo.pdf (178.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00491615 , version 1 (13-06-2010)

Identifiants

  • HAL Id : hal-00491615 , version 1

Citer

Fallou Gueye, Christian Artigues, Marie-José Huguet, Frédéric Schettini, Laurent Dezou. A bidirectional/multi-queue algorithm for the bi-objective multimodal viable shortest path problem. 2010. ⟨hal-00491615⟩
474 Consultations
146 Téléchargements

Partager

Gmail Facebook X LinkedIn More