Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network

DOI10.1155/2014/185383zbMath1407.90190OpenAlexW2064908938WikidataQ59063601 ScholiaQ59063601MaRDI QIDQ1717836

Xinggang Luo, Yu Zhang, Shimeng Lv, Jiafu Tang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/185383

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (1)

Itinerary planning with time budget for risk-averse travelers

Uses Software

• Algorithm 97

Cites Work

• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
• Finding the \(K\) shortest paths in a schedule-based transit network
• Heuristic shortest path algorithms for transportation applications: state of the art
• Bidirectional A* search on time-dependent road networks
• Efficient models for timetable information in public transportation systems
• Car or Public Transport—Two Worlds
• Goal-directed shortest-path queries using precomputed cluster distances
• Point-to-Point Shortest Path Algorithms with Preprocessing

This page was built for publication: Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network