检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武警工程大学装备运输系,陕西西安710086
出 处:《计算机仿真》2012年第12期380-383,共4页Computer Simulation
摘 要:研究城市交通路径分配问题。城市交通拥挤复杂多变,用户出行选择路径困难,为了优化城市交通路径分配,解决现有交通诱导模型算法计算量大、运算时间长的问题,提出了一种基于改进的蜂群智能算法的路径选择分配方法。首先利用双向信息传递技术得到实时路段的交通流状况,将路段的通行能力分级,通过模仿蜂群个体的局部寻优比较得到最优解,具有较快的收敛速度。仿真结果表明,提出的模型和算法不仅能有效解决城市交通路径分配问题,而且计算复杂度较低,算法的计算效率较高,表明改进算法为提高交通路网的效率及实用性和有效性提供了依据。Urban traffic route distribution was explored in this paper. As urban traffic is heavy, complex and changeable, travelers have difficulty in route choices. A route choice distribution method based on improved bee colony algorithm was proposed to optimize urban traffic route distribution, solving the large amount and the long time of calculation of existing traffic guidance model. Bilateral information transfer technology was applied to get the traffic flow condition of real time roads which are classified on the accessible capacity, and by imitating individuals of bee colony, the optimality was found with fast speed of convergence. Simulation results show that the model and algorithm can effectively solve the urban traffic route distribution, and the computer is of low complexity, high computational efficiency, and fast convergence, which verifies the practicability and effectiveness of the algorithm.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.1.201