The real-time shortest path algorithm with a consideration of traffic-light

Abstract

In urban area, the delay due to the traffic-light should be taken into considerable when searching for the optimal path. So this paper presents an algorithm for find the real-time shortest path in urban area with traffic-light. The core of the algorithm is a translation module which can translate the delay due to the traffic-light(a quantity about time) into length (a quantity about space). In this way to simplify the calculation difficulty and combine the influence due to time delay as well as length simultaneously. Then, this module was added into the heuristic function of A* algorithm to get the improved algorithm. Finally, the simple simulation of the algorithm shown that it can save 5.8% time even when driving more 10% distances. In conclusion, the algorithm is very suitable for the urban traffic and the longer the distance, the more obvious effects it would be.

Keywords

Shortest path real-time routing traffic-light A* algorithm Urban traffic

Get full access to this article

View all access options for this article.

References

, Gu

Z.-Q.

, Huang

et al., Research and realization of optimum route planning in vehicle navigation systems based on a hybrid genetic algorithm, Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering222 (2008), 757–763.

Smith

, Traffic signal control and route choice: A new assignmentand control model which designs signal timings, Transport Res Part C58 (2015), 451–473.

Yang

and Jayakrishnan

, Real-time network-wide traffic signal optimization considering long-term green ratios based on expected route flows, Transport Res Part C60 (2015), 241–257.

Pahlavani

and Delavar

M.R.

, Multi-criteria route planning based on a driver’s preferences in multi-criteria route selection, Transport Res Part C40 (2014), 14–35.

Hatzopoulou

, Weichenthal

, Barreau

, Goldberg

, Farrell

, Crouse

and Ross

, A web-based route planning tool to reduce cyclists’ exposures to traffic pollution: A case study in Montreal, Canada, Envir Res123 (2013), 58–61.

Gao

and Huang

, Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks, Transport Res Part C21 (2012), 196–213.

Chen

Y.-L.

and Yang

H.-H.

, Minimization of travel time and weighted number of stops in a traffic-light network, Euro J Operat Res144 (2003), 565–580.

Yang

and Miller-Hooks

, Adaptive routing considering delays due to signal operations, Transport Res Part B38 (2004), 385–413.

Khanjary

, Faez

, Meybodi

M.R.

and Sabaei

, Shortest paths in synchronized traffic-light networks, CCECE (2011), 882–886.

10.

Duan

, Ge

and Yao

, Implementation of path planning method of intelligent vehicle based on mapX, CCDC (2014), 4720–4724.

11.

Yang

, Yang

X.G.

and Yun

M.P.

, Shortest path algorithm with a consideration of waiting time at signalized intersections, J Tongji Univers41(5) (2013), 680–686.