A methodology for schedule‐based paths recommendation in multimodal public transportation networks

David Canca, Alejandro Zarzo, Pedro Luis González Rodríguez, Eva Barrena, Encarnación Algaba · Journal of Advanced Transportation · 2012

SUMMARY This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user‐specific time–space graph, followed by the application of a k‐shortest path algorithm. Moreover, in order to build on‐demand real‐time itineraries recommendations, the algorithm has been embedded in a Web client–server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. Copyright © 2012 John Wiley & Sons, Ltd.

Read the paper · More papers on PaperTik