Improvement of A^* algorithm and its application in shortest path problem in dynamic networks

zbMATH Open1174.90391MaRDI QIDQ5453225FDOQ5453225

Authors: Liang Zou, Jianmin Xu, Lingxiang Zhu 

Publication date: 4 April 2008

Recommendations

• Shortest-path algorithms and dynamic cost changes
• Dynamic shortest path algorithm based on variable weight
• scientific article; zbMATH DE number 1488066
• Shortest paths on dynamic graphs
• Computing the shortest path: \(A^\ast\) search meets graph theory

zbMATH Keywords

shortest pathintelligent transportation system\(A^*\) algorithmdynamic route guidanceconsistency assumption

Mathematics Subject Classification ID

Dynamic programming (90C39) Traffic problems in operations research (90B20) Algorithms in computer science (68W99)

Cited In (1)

• A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion

This page was built for publication: Improvement of \(A^*\) algorithm and its application in shortest path problem in dynamic networks

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