2026-10-16T10:45:06Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4893 2022-03-24T23:13:08Z 1582963302567:1597824273898 user-ucsy

Improving delivery service applying shortest path algorithm for large Road Network Soe, Aye Lai Lai Khaing, Myo Kay Graphs and networks are collections of nodesand arcs.Numeric values on the links can representthe actual length of the link. This system presents thedelivery service problem by means of shortest pathalgorithm. Suppliers have to find the path plan to theplace where their products are being delivered,especially. in reference to the geographic position ofthe objects, its surroundings and the shortest path ofthe destination place from their current place. Forlarge road network, the method is based onpreprocessing and prepared for static graphs, i.e,graphs with fixed topology and edge costs.This system solves the suppliers’ Facingproblem in finding the shortest path by using A*Shortest Algorithm. A* is the most popular algorithmbeing used in finding the shortest path because of itsflexibility and potentially search in a huge area ofthe map. 2010-12-16 http://hdl.handle.net/20.500.12678/0000004893 https://meral.edu.mm/records/4893