Improving delivery service applying shortest path algorithm for large Road Network

Abstract

Graphs and networks are collections of nodes and arcs.Numeric values on the links can represent the actual length of the link. This system presents the delivery service problem by means of shortest path algorithm. Suppliers have to find the path plan to the place where their products are being delivered, especially. in reference to the geographic position of the objects, its surroundings and the shortest path of the destination place from their current place. For large road network, the method is based on preprocessing and prepared for static graphs, i.e, graphs with fixed topology and edge costs. This system solves the suppliers’ Facing problem in finding the shortest path by using A* Shortest Algorithm. A* is the most popular algorithm being used in finding the shortest path because of its flexibility and potentially search in a huge area of the map.