Computers and Operations Research
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
Dynamic route planning for car navigation systems using virus genetic algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
Dynamic Routing and Travel Time Prediction with Ant Based Control
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Computers and Operations Research
Ad hoc solution of the multicommodity-flow-over-time problem
IEEE Transactions on Intelligent Transportation Systems
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Simulation of signal control optimization for intersections in large-scale transport network
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 4
Travel time prediction for dynamic routing using ant based control
Winter Simulation Conference
A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
A hybrid approach for adaptive car navigation
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Hi-index | 0.00 |
This paper extends the A* methodology to shortest path problems in dynamic networks, in which arc travel times are time dependent. We present efficient adaptations of the A* algorithm for computing fastest (minimum travel time) paths from one origin node to one destination node, for one as well as multiple departure times at the origin node, in a class of dynamic networks the link travel times of which satisfy the first-in-first-out property. We summarize useful properties of dynamic networks and develop improved lower bounds on minimum travel times. These lower bounds are exploited in designing efficient adaptations of the A* algorithm to solve instances of the one-to-one dynamic fastest path problem. The developed algorithms are implemented and their computational performance is analyzed experimentally. The performance of the computer implementations of the adaptations of the A* algorithm are compared to a dynamic adaptation of Dijkstra's algorithm, stopped when the destination node is selected. Comparative computational results obtained demonstrate that the algorithms of this paper are efficient. Using a network containing 3000 nodes, 10 000 links, and 100 time intervals, the dynamic adaptations of the A* led to a savings ratio of 11, in terms of number of nodes selected, and to a savings ratio of five in terms of computation time. The effect of the network size on the performance of these adaptations is also studied. It is shown that the computational savings in term of both the number of nodes selected and the computation time, increase with the size of the network topology