Weighting the path continuation in route planning
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Modeling Costs of Turns in Route Planning
Geoinformatica
FATES: Finding A Time dEpendent Shortest path
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Shortest Path Algorithms in Transportation models: classical and innovative aspects
Shortest Path Algorithms in Transportation models: classical and innovative aspects
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
A Dijkstra's mobile web application engine for generating integrated light rail transit route
WSEAS Transactions on Computers
A mobile web application engine for generating destination-oriented LRT route
ACS'09 Proceedings of the 9th WSEAS international conference on Applied computer science
Hi-index | 0.00 |
This paper proposes a new route plan on the basis of traffic prediction for finding a fastest route to a given destination in traffic network. So far, lots of traffic prediction systems were introduced to help drivers. Previous works were done mainly on providing restricted route services which depend on only cumulative traffic velocities. For this reason, we consider both real-time and cumulative traffic information together to obtain more accurate future traffic information. In location-based services, the traffic network is needed to solve certain constrains, such as turns problems and provide method for avoiding traffic congestions. To guide a fastest route service in such a complicated network, we first construct a linear dual graph from a traffic network. Then, we propose main algorithmic approaches which are developed by Kalman Filter and cumulative traffic patterns to predict a much better quality of future traffic information by combining real-time with cumulative traffic conditions. Finally, we adopt Dijkstra's shortest path algorithm to minimize the travel time with generating a fastest cost function. Experimental results show that this approach is highly efficient in route plan than previously used ways by only cumulative approaches. This approach is supposed to proceed convenience for drivers and develop a quality of navigation service in telematics.