Predicting shortest path for goods delivery to fair price shops in India

Designing a smart system for delivering goods to various fairprice shops effectively is one of the major goals in the mission of smart city development. In this paper, the smart city environment is treated as a distributed environment for carrying goods across different parts of the city. Hence the widely used Dijkstra's algorithm is implemented as MapReduce model using Hadoop environment to compute the sh ortest path for speedy delivery of goods. A front end is designed to carry out interstate and intrastate transportation of items. Distance matrix comprising of 50,100,150…500 cities is considered for the simulation. From the experiment, it is observed that the Dijkstra's algorithm implemented in map reduce model meets the objective of delivering the materials to the right destination in minimum time. The performance of the proposed MapReduce Dijkstra's algorithm is compared with other popular algorithms like Bellman ford algorithm, Throup algorithm and Gobow algorithm. It is observed that the proposed MapReduce Dijkstra's algorithm gives out a reliable shortest path between any source and destination city with less CPU time than the other algorithms.