All pair fastest route to a destination based on a heterogeneous time data

Abstract

This paper presents the smart driving directions and providing a fastest routes to given destination at a given departure time. From GPS Logs, the data will be selected as per the user queries and then road segment formation will take place. The Map matching process is comparison of the GPS data and the real time data is done to avoid low-sampling rate problem. The Landmark Graph construction will be performed on the map matched graph. The Travel time will be estimated for each landmark graph by means of Variance Entropy clustering algorithm. Route computing will be of two stages. In first stage, Rough route computing finding the fastest route using the all pair shortest path algorithm. In Second stage, refine route computing the Time dependent fastest graph have to be refined with real time data to avoid low-sampling rate problem. Thus the efficient fastest route and energy consumption route will be provided.