OORF: an object-oriented route finder
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Integrating OO road network database, cases and knowledge for route finding
Proceedings of the 2001 ACM symposium on Applied computing
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Driving with knowledge from the physical world
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient shortest path computation system for real road networks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
| Hi-index | 0.00 |
Traveling is a part of every person's day-to-day life. With the massive and complicated road network of a modern city or country, finding a good route to travel from one place to another is not a simple task. In network theory, this is the shortest path problem. Shortest-path algorithms are often used to solve this problem. However, these algorithms are wasteful in terms of computation when applied to the route-finding task. They may also produce routes that are not suitable for human users. In practice, knowledge about the road network can often be used to reduce the time and space required in computation, and to produce human-oriented solutions. In this project, we have integrated knowledge-based technique and algorithmic method to solve the problem. This integrated approach substantially reduces the computation time and space required for route finding. Within the approach we present three alternative designs, which may be suitable for different situations