A Methodology for Schedule-Based Paths Recommendation in Multimodal Public Transportation Networks

This article presents a methodology that can be used for schedule-based paths recommendations in multimodal public transportation networks. The authors analyze the problem of intermodal itineraries in interurban networks where factors to be considered include different public transportation modes, several companies, time, and capacity constraints, as well as seat booking. They first model the inherent network optimization problem for a generic user request, and then undertake a solving method that makes use of a network graph transformation. For each type of request, this solving method is based on pruning the user-specific time–space graph, followed by the application of a k-shortest path algorithm. In addition, to incorporate on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client–server. Using this server, users can ask for trip recommendations by Internet or mobile phone. The authors conclude by discussing a theoretical case study in which their approach is used on the Andalusia (Spain) main transportation network.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • Special Issue on Public Transport Systems.
  • Authors:
    • Canca, David
    • Zarzo, Alejandro
    • Gonzalez-R, Pedro L
    • Barrena, Eva
    • Algaba, Encarnación
  • Publication Date: 2013-4


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01492186
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 8 2013 3:21PM