Constrained K-shortest paths algorithm within dynamic restricted searching area
Peng Gao · Journal of Jilin University · 2009
For a better solution of the congestion shifting problem in DDVGS(Distributed Dynamic Route Guidance System),this paper develops a constrained K-shortest paths algorithm within a dynamic restricted searching area in consideration of a real city road net spatial distribution features which is suitable for the travelers and realizes its program on the basis of MAPX Control.The actual effect of this algorithm is tested with the micro simulation tool VISSIM.Some conclusions have been drawn as follows,the constrained K-shortest paths algorithm can not only decrease the searching scale and improve its running efficiency but also efficiently balance the traffic flow and prevent the congestion shifting problem,so that both the travelers and the whole system could benefit a lot from this.