【摘要】 研究城市交通最优路径规划问题,由于城市交通网复杂,增加了规划的难度,传统的最优路径规划算法没有考虑城市道路网络中的交通限制问题,更忽略了车辆在道路交叉口转向延误的时间,不符合城市交通的实际情况。为了解决上述问题,首先建立了一个城市路网交通模型。然后运用线性规划方法建立最优路径规划问题的线性规划模型。最后采用桶排序算法对狄杰斯特拉算法进行优化,得到一个新的最优路径规划算法,对线性规划模型进行求解。仿真结果证明,利用算法搜索得到的最优路径更加符合实际的路网情况,为设计提供了理论依据。更多还原

【Abstract】 Study optimal path planning of urban traffic.The traditional optimal path algorithms do not consider the traffic restrictions in the urban road network and ignore the crossing delay at intersection,which can not meet the actual situation of urban transport.To solve the above problem,an urban road network traffic model was established at first.Then,linear programming was used to establish the linear programming model for optimal path planning.At the end,bucket sorting algorithm was used to optimize the Dijkstra algorithm and get a new optimal path algorithm.The algorithm can be used to solve linear programming models.The experiment shows that the result of the new algorithm more accords with realistic network conditions,and it provides a theoretical basis for the design.更多还原