Mobility Compass

Discover mobility and transportation research. Find experts, partners, networks.

  • About
  • Privacy Policy
  • Legal Notice
  • Contact

The Mobility Compass is an open tool for improving networking and interdisciplinary exchange within mobility and transport research. It enables cross-database search for cooperation and network partners and discovering of the research landscape.

The dashboard provides detailed information about the selected scientist, e.g. publications. The dashboard can be filtered and shows the relationship to co-authors in different diagrams. In addition, a link is provided to find contact information.

To Graph

8.032 Topics available

To Map

944 Locations available

509.604 PEOPLE
509.604 People People

509.604 People

Show results for 509.604 people that are selected by your search filters.

←

Page 1 of 20385

→
←

Page 1 of 0

→
PeopleLocationsStatistics
Mouftah, Hussein T.
  • 1
  • 1
  • 2
  • 2025
Dugay, Fabrice
  • 3
  • 17
  • 6
  • 2025
Rettenmeier, Max
  • 4
  • 4
  • 28
  • 2025
Tomasch, ErnstGraz
  • 57
  • 166
  • 211
  • 2025
Cornaggia, Greta
  • 1
  • 4
  • 0
  • 2025
Palacios-Navarro, Guillermo
  • 1
  • 4
  • 2
  • 2025
Uspenskyi, Borys V.
  • 1
  • 3
  • 0
  • 2025
Khan, Baseem
  • 8
  • 38
  • 115
  • 2025
Fediai, Natalia
  • 6
  • 4
  • 6
  • 2025
Derakhshan, Shadi
  • 1
  • 0
  • 0
  • 2025
Somers, BartEindhoven
  • 13
  • 42
  • 246
  • 2025
Anvari, B.
  • 9
  • 31
  • 126
  • 2025
Kraushaar, SabineVienna
  • 2
  • 13
  • 0
  • 2025
Kehlbacher, Ariane
  • 10
  • 18
  • 14
  • 2025
Das, Raj
  • 3
  • 3
  • 17
  • 2025
Werbińska-Wojciechowska, Sylwia
  • 12
  • 12
  • 25
  • 2025
Brillinger, Markus
  • 4
  • 42
  • 4
  • 2025
Eskandari, Aref
  • 2
  • 13
  • 18
  • 2025
Gulliver, J.
  • 9
  • 74
  • 555
  • 2025
Loft, Shayne
  • 1
  • 9
  • 0
  • 2025
Kud, Bartosz
  • 1
  • 6
  • 0
  • 2025
Matijošius, JonasVilnius
  • 33
  • 89
  • 297
  • 2025
Piontek, Dennis
  • 6
  • 33
  • 30
  • 2025
Kene, Raymond O.
  • 2
  • 2
  • 30
  • 2025
Barbosa, Juliana
  • 3
  • 15
  • 11
  • 2025

Manseur, Farida

  • Google
  • 6
  • 4
  • 33

in Cooperation with on an Cooperation-Score of 37%

Topics

Publications (6/6 displayed)

  • 2020Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks16citations
  • 2018Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks16citations
  • 2017Algorithms for optimal guidance of users in road networks ; Algorithmes de guidage optimal des usagers dans les réseaux routierscitations
  • 2017An Algorithm for Robust Routing Strategies in Networks1citations
  • 2017Algorithmes pour un guidage optimal des usagers dans les réseaux de transport ; Algorithms for optimal guidance of users in road networkscitations
  • 2016Robust adaptive strategies for the guidance of users in road networkscitations

Places of action

Chart of shared publication
Lebacque, Jean-Patrick
4 / 38 shared
Nguyen Van Phu, Cyril
2 / 16 shared
Haj-Salem, Habib
4 / 20 shared
Farhi, Nadir
4 / 45 shared
Chart of publication period
2020
2018
2017
2016

Co-Authors (by relevance)

  • Lebacque, Jean-Patrick
  • Nguyen Van Phu, Cyril
  • Haj-Salem, Habib
  • Farhi, Nadir
OrganizationsLocationPeople

conferencepaper

Robust adaptive strategies for the guidance of users in road networks

  • Lebacque, Jean-Patrick
  • Manseur, Farida
  • Haj-Salem, Habib
  • Farhi, Nadir
Abstract

EWGT2016 - Euro Working Group on Transportation, Istanbul, TURQUIE, 05-/09/2016 - 07/09/2016 ; We present an algorithm for optimal guidance of users in road networks. It is a "stochastic-on-time-arrival (SOTA)"-like algorithm which calculates optimal guidance strategies with reliable paths, for road network origin-destination pairs. Our contribution consists here in extending an existing SOTA algorithm, in order to include robustness of the guidance strategy, towards path failures. The idea of SOTA algorithms is to calculate the maximum probability of reaching a destination node, starting from any node of a road network, and given a time budget. This calculus gives the optimal path for every origin destination pair of nodes in the network, with an associated optimal adaptive guidance strategy, and with respect to the considered time budget. The approach models very well the importance of the travel time variability in the route choice process. Indeed, by adopting this kind of guidance strategies, users may accept short deteriorations on the average travel time, if in return, they have a guarantee on the reliability of the travel time (in term of the maximum probability of reaching their destinations in given time budgets). We propose here an extension of this approach in order to take into account the existence and the performance of alternative detours of the selected paths, in the calculus of the guidance strategy. We take into account the fact that one or many links of the selected optimal path may fail during the travel. We then consider that users may be sensitive to path changing. That is to say that they may prefer paths with efficient alternative detours, with respect to paths without, or with less efficient detours, even with a loss in the average travel time, and/or in its reliability. In order to take into account such behaviors, we propose a model that includes the existence as well as the performance of detours for selected paths, in the calculus of the travel time reliability (i.e. the maximum ...

Topics
  • behavior
  • simulation
  • employed
  • algorithm
  • computer science
  • reliability
  • road network
  • modeling
  • travel
  • train consist
  • hub
  • deterioration
  • traffic assignment
  • route choice
  • travel time
  • traffic control
  • Imfa
  • Pafe
  • Ihda
  • Pafc
  • Oee
  • Lde
  • Tamdaaeg
  • Pafa
  • Tahe
  • Tahbdabb
  • Tahdcaaa
  • Kfa
  • Taiach
  • Taiabfi
  • Taiabfjbc
  • Tajb

Search in FID move catalog