“互联网+”下城市路网的最优路径选择  

The Optimal Route Selection of Urban Road Network Under "Internet +"

作　　者：虞博翔 万仲禹 王豹[1] 曹煜 YU Bo-xiang;WAN Zhong-yu;WANG Bao;CAO Yu(Xuzhou University of Technology,Xuzhou 221018,China)

机构地区：[1]徐州工程学院,江苏徐州221018

出　　处：《电脑知识与技术》2020年第9期200-202,共3页Computer Knowledge and Technology

基　　金：大学生创新创业训练计划项目(xcx2019092)。

摘　　要：在"互联网+"的时代下,结合计算机数据采集以及系统仿真技术,对车辆在城市路网环境下,进行全局路径最优规划。将出发点与目的地连线所成对角线的矩形区域,作为路径限制搜索区域。不同时间段的车流量和不变的道路距离对道路阻抗产生影响的主要原因。在此基础上,建立城市路网的限制搜索区域时变权重有向图模型,并采用蚁群算法求解全局规划最优路径。最后进行MATLAB软件编程,仿真验证了算法的可行性以及有效性。In the era of "Internet +", combined with computer data acquisition and system simulation technology, the global optimal path planning is carried out for vehicles in the urban road network environment.The rectangular area diagonally connected to the starting point and destination is used as the path limiting search area. The main reason why traffic flow in different time periods and constant road distance influence road impedance. On this basis, the time-varying weighted directed graph model of the restricted search area of the urban road network is established, and the ant colony algorithm is used to solve the global optimal path. Finally,MATLAB software was used to program the algorithm, and the simulation verified the feasibility and effectiveness of the algorithm.

关 键 词：路网识别 道路阻抗 蚁群算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]