TY - JOUR
T1 - Mobility-as-a-Service Personalised Multi-Modal Multi-Objective Journey Planning with Machine-Learning-Guided Shortest-Path Algorithms
AU - Bayliss, Christopher
AU - Ouelhadj, Djamila
AU - Dadashzadeh, Nima
AU - Fletcher, Graham
N1 - Funding Information:
This work has been funded by the Department of Transport (DfT) as part of the Solent Future Transport Zone (FTZ) programme led by Solent Transport, UK.
Publisher Copyright:
© 2025 by the authors.
PY - 2025/2/15
Y1 - 2025/2/15
N2 - Mobility-as-a-service (MaaS) apps provide a single platform for journey planning, booking, payment and ticketing, and are proposed as a medium for encouraging sustainable travel behaviour. Generating sustainable-vehicle-based journey alternatives can be formulated as a multi-modal multi-objective journey-planning problem, one that is known to have a prohibitively large solution space. Building on prior insights, we develop a scalable decomposition-based solution strategy. A Pareto set of journey profiles is generated based on inter-transfer-zone objective criteria contributions. Then, guided by neural-network predictions, extended versions of existing shortest-path algorithms for open and public transport networks are used to optimise the paths and transfers of journey profiles. A novel hybrid k-means and Dijkstra’s algorithm is introduced for generating transfer-zone samples while accounting for transport network connectivity. The resulting modularised algorithm knits together and extends the most effective existing shortest-path algorithms using neural networks as a look-ahead mechanism. In experiments based on a large-scale transport network, query response times are shown to be suitable for real-time applications and are found to be independent of transfer-zone sample size, despite smaller transfer-zone samples, leading to higher quality and more diverse Pareto sets of journeys: a win-win scenario.
AB - Mobility-as-a-service (MaaS) apps provide a single platform for journey planning, booking, payment and ticketing, and are proposed as a medium for encouraging sustainable travel behaviour. Generating sustainable-vehicle-based journey alternatives can be formulated as a multi-modal multi-objective journey-planning problem, one that is known to have a prohibitively large solution space. Building on prior insights, we develop a scalable decomposition-based solution strategy. A Pareto set of journey profiles is generated based on inter-transfer-zone objective criteria contributions. Then, guided by neural-network predictions, extended versions of existing shortest-path algorithms for open and public transport networks are used to optimise the paths and transfers of journey profiles. A novel hybrid k-means and Dijkstra’s algorithm is introduced for generating transfer-zone samples while accounting for transport network connectivity. The resulting modularised algorithm knits together and extends the most effective existing shortest-path algorithms using neural networks as a look-ahead mechanism. In experiments based on a large-scale transport network, query response times are shown to be suitable for real-time applications and are found to be independent of transfer-zone sample size, despite smaller transfer-zone samples, leading to higher quality and more diverse Pareto sets of journeys: a win-win scenario.
KW - machine learning
KW - optimization
KW - shortest path
KW - journey planning
KW - Mobility as a service
KW - multi-modal multi-objective journey planning
KW - shortest path planning
KW - optimisation
KW - heuristics
UR - http://www.scopus.com/inward/record.url?scp=85218638222&partnerID=8YFLogxK
U2 - 10.3390/app15042052
DO - 10.3390/app15042052
M3 - Article
VL - 15
JO - Applied Sciences (Switzerland)
JF - Applied Sciences (Switzerland)
SN - 2076-3417
IS - 4
M1 - 2052
ER -