Abstract:

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 inconsideration of a real city roadnets patial distribution features which is suitable for the travelers and realizes its program on the basis of MAPX Control.The actual effect of this algorith mistested with the microsimulation tool VISSIM.Some conclusionshavebeendrawn as follows,the constrained K-shortest path salgorithm 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.

Key words: engineering of communication and transportation system, urban traffic flow guidance system, dynamic restricted searching area, constrained K-shortest paths, congestion shifting