Optimising courier delivery routes and time travel using Dijkstra’s Algorithm to find the shortest path

This project seeks to find the shortest path and minimum travel time courier delivery by using Dijkstra’s Algorithm in Lukut, Port Dickson. Efficient route planning has become more relevant because of the rising demand for fast delivery services due to the growth of e-commerce. This research aims to enhance delivery performance by identifying the shortest path between multiple delivery locations using graph theory. The records of the distance and travel time to nine delivery points were obtained using Google Maps. Nodes are the assumed location of these places, and the edges between locations are the roads with weight in the form of time and distance. Dijkstra’s Algorithm was applied in Microsoft Excel to determine the fastest route between Parcelhub, Lukut and the Tasik Villa International Resort Port Dickson. It was found out that the application of this algorithm would assist in reducing delivery time and making the route efficient. The technique cuts down on the amount of fuel used, delays in delivery and the cost of operation. Its outcomes indicate that although only a small area is studied and a set of static data is used, it shows strong potential for practical use in reallife courier services. This project proves that mathematical tools like Dijkstra’s Algorithm can help solve real-world logistics problems by providing faster and more reliable delivery routes, improving service quality and customer satisfaction.