A bidirectional/multi-queue algorithm for the bi-objective multimodal viable shortest path problem
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.
Domaines
Recherche opérationnelle [math.OC]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...