TY - GEN
T1 - Adaptive route planning in spatial road networks
AU - Wahid, Abdul
AU - Haider, Md Tanwir Uddin
AU - Ahmad, Md Masood
AU - Singh, Arvind Kumar
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/13
Y1 - 2016/9/13
N2 - 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.
AB - 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.
KW - Dynamic route Query
KW - Intelligent Transport System (ITS)
KW - Location Based Services (LBS)
KW - Spatial Networks
KW - Traffic Control
UR - https://www.scopus.com/pages/publications/84992096784
U2 - 10.1109/WiSPNET.2016.7566343
DO - 10.1109/WiSPNET.2016.7566343
M3 - Conference Publication
AN - SCOPUS:84992096784
T3 - Proceedings of the 2016 IEEE International Conference on Wireless Communications, Signal Processing and Networking, WiSPNET 2016
SP - 1281
EP - 1285
BT - Proceedings of the 2016 IEEE International Conference on Wireless Communications, Signal Processing and Networking, WiSPNET 2016
PB - Presses Polytechniques Et Universitaires Romandes
T2 - 2016 IEEE International Conference on Wireless Communications, Signal Processing and Networking, WiSPNET 2016
Y2 - 23 March 2016 through 25 March 2016
ER -
