Finding realistic shortest path in road networks with lane changing and turn restriction

Most existing work on path computation has been focused on the shortest-path problem, which is to find the optimal path between an origin and destination pair. To get an optimal route, they usually consider travel time moving forward on the road and distance from a source to a target as crucial factors to value and select a path. However, it is not sufficient for real life traffic. Firstly, when we drive on the road, the road driving time includes the duration of moving forward on the road section, going through an intersection and performing lane changes. Secondly, it is not possible, in practice, to go on any road section. Some road sections have restricted rules. Turn restrictions are commonly restricted in a real network to reduce disruption to traffic. Therefore, in our work, we direct to find not only the shortest path but also realistic or feasible path. Both lane changes and turn restrictions are considered in our work. Simulation results show that two these additional constraints are necessarily considered to achieve a realistic shortest path. In addition, our proposal is not only giving a practical path but also a satisfied path for each individual car.