Adaptive route planning in spatial road networks

With rapidly growing of GPS equipped mobile devices, by using GIS and GPS data it solve a new type of service called as Location Based Service. In any location based service, traffic congestion plays a vital role to find any point of interest. In a large city traffic congestion is a very serious issue for traveler because of the continuously and random flow of vehicles on the road network. Though choosing the optimal path work properly when traffic is less and it takes less traveling time as compared to other path that has less distance but take more travel time. To find an optimal path (that take less travel time) in a road network we use some spatial queries where destination point is fixed and traffic congestion data changes rapidly. All existing queries to find an optimal path in spatial road network assumes that weight (travelling time) of edges of road network is constant. But in real world scenario weight of edge of road network changes with time of the day for example edge/road blocking etc. This paper propose a query that finds an optimal path between user's query point to POI in a way that it can query at each decision point or node with considering real time traffic data. This type of query helps in application of emergency services, trip planning, and location based service (LBS), reducing congestion, utilization of road network etc.