The fastest itinerary in time-dependent decentralized travel information systems

DOI10.1007/S10878-006-9624-1MaRDI QIDQ2369978zbMATH OpenOpenAlexFDO

Authors Jinchang Wang, Thomas Kämpke

Publication date 21 June 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-9624-1

zbMATH Keywords

distributed computingfastest path problemlabeling algorithmshortest path problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Towards realistic modeling of time-table information through the time-dependent approach
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• Computing and modeling issues in wide-area advanced traveler information systems
• Recoverable robust timetable information
• A load balancing algorithm for multi-agent itinerary planning

Cites work

• An algorithm for the ranking of shortest paths
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• scientific article; zbMATH DE number 53892 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• Minimum weight paths in time-dependent networks
• Shortest route computation in distributed systems
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

This page was built for publication: The fastest itinerary in time-dependent decentralized travel information systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369978)