蚂蚁算法处理弹性需求混合交通UE配流问题  

Solving UE assignment problem of mixed traffic networks with elastic demands using ant algorithm

作　　者：徐勋倩[1] 黄卫[1] 吴国庆[2] 

机构地区：[1]东南大学交通学院ITS中心,江苏南京210096 [2]南通大学,江苏南通226007

出　　处：《系统工程学报》2006年第5期534-538,共5页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(50475181);江苏省高校高新技术产业发展资助项目(JHB05-42);南通大学自然科学基金资助项目(03040103)

摘　　要：针对我国城市交通路网内机动车与非机动车混行的交通现状,提出了一种基于蚂蚁算法(ant algorithm)的寻优策略处理弹性需求下混合交通UE(user equilibrium)配流问题.同时,根据蚂蚁算法的思想以伪代码形式设计了求解弹性需求下混合交通UE配流模型最优解的程序流程,并应用于一个实例.算例表明,蚂蚁寻优策略在寻优的可靠性和计算效率方面优于传统的寻优算法.According to the status of Chinese urban road networks containing vehicle and non-vehicle traffic flows, an optimization strategy based on the ant algorithm, is put forward to solve user equilibrium assignment problem of mixed traffic networks on elastic demands. At the same time, based on the principle of the ant algorithm＇ s strategy, the procedure of concrete realization steps is designed for user equilibrium assignment model of mixed traffic networks with elastic demands and tested by using an example. At the end, the computation result shows that the ant colony optimization strategy outperforms the conventional optimal algorithm on the aspects of probability and computing speed.

关 键 词：弹性需求 混合交通 UE配流 蚂蚁算法 

分 类 号：U491.123[交通运输工程—交通运输规划与管理]