摘要

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 timespace 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 clientserver 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.

  • 出版日期2013-4