UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Optimal multimodal and multicriteria path set computation for dynamic trip planning in mobility as a service system

Yfantis, Lampros; Chaniotakis, Emmanouil; Dominquez, F; Kamargianni, Maria; Azevedo, Lima Azevedo; (2021) Optimal multimodal and multicriteria path set computation for dynamic trip planning in mobility as a service system. Presented at: 100th Annual Meeting of the Transportation Research Board, Washington, DC, USA. Green open access

[thumbnail of 2021.01_TRB_Optimal-Multimodal-and-Multicriteria-Path-Set-Computation-for-Dynamic-Trip-Planning-in-Mobility-as-a-Service-Systems_UCL_compressed.pdf]
Preview
Text
2021.01_TRB_Optimal-Multimodal-and-Multicriteria-Path-Set-Computation-for-Dynamic-Trip-Planning-in-Mobility-as-a-Service-Systems_UCL_compressed.pdf - Published Version

Download (286kB) | Preview

Abstract

Latest technological advancements and the rise of the sharing economy have led to the emergence of the Mobility as a Service (MaaS) concept. In MaaS systems, service integrators, i.e., MaaS Operators, integrate traditional and new mobility services and offer to users seamless travel experience through multimodal journey planning, integrated payment, booking and ticketing services. The variety of available mobility services in MaaS systems, their inherent service attribute dynamics and the different factors that MaaS users consider for their trip choices render efficient and optimal multimodal trip planning a vital problem for MaaS Operators. In contrast to existing work, in this paper, we formalize the fully dynamic, multimodal and multicriteria path set computation problem in MaaS systems considering simultaneously all the aforementioned system’s particularities. Specifically, a new generalized dynamic multimodal and multi-attribute network model is proposed, which enables the realistic replication of different mobility services’ structural characteristics as well as modelling a range of static and dynamic service attributes. We further propose a new dynamic and multicriteria shortest path algorithm for Pareto path set computation in MaaS systems along with heuristics that speed up the multicriteria search. We, finally, test and evaluate our modelling and algorithmic framework in a prototypical multimodal network. Initial results indicate that our approach enables the computation of diverse optimal and realistic unimodal and multimodal trips in reasonable computation time, setting the ground for further exploration into practical large-scale implementations.

Type: Conference item (Paper)
Title: Optimal multimodal and multicriteria path set computation for dynamic trip planning in mobility as a service system
Event: 100th Annual Meeting of the Transportation Research Board
Location: Washington, DC, USA
Dates: 5th-15th January 2021
Open access status: An open access version is available from UCL Discovery
Publisher version: https://harmony-h2020.eu/wp-content/uploads/2021/0...
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.
Keywords: Mobility as a Service; Multimodal; Multicriteria; Shortest Path; Dynamic; Networks; Supernetworks
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of the Built Environment
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of the Built Environment > Bartlett School Env, Energy and Resources
URI: https://discovery.ucl.ac.uk/id/eprint/10212889
Downloads since deposit
5Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item