Integrating knowledge-base and Dijkstra's algorithm for finding best alternate route dynamically

Finding a good route for traveling has become a necessity for human beings and also one of the major problems faced by the transportation industry. The huge and complicated road network in a modern country makes it difficult to find the best route for traveling from one place to another place. In developing countries this problem becomes even more complex and complicated due to the small number of inevitable links and road-track-crossing links. The route searched by the shortest path algorithm alone may be shortest one but cannot guarantee to be the best route because of many irrelevant road segments as part of the solution. Moreover, en route emergencies may make the decided route unusable or more time is required than in normal situations. We discuss and propose adhoc database changes to find en route best alternate route in the case of an emergency. We also used knowledge-based techniques, case-based reasoning to prune the search space.