CONSTRAINED K-SHORTEST PATHS ALGORITHM WITHIN A DYNAMIC RESTRICTED SEARCHING AREA

摘要

Path planning and its implementing technology are the core problems of the Urban Traffic Flow Guidance System. Commonly, the optimal path provided to the travelers is a unique one, so that it may cause a result of congestion shifting. The paper develops a constrained K-shortest paths algorithm within a dynamic restricted searching area in consideration of road network 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.