基于路网可达性的城市交通离散网络设计模型及算法  

Model and Algorithm for Urban Transportation Discrete Network Design Based on Road Network Accessibility

作　　者：邓克涛[1] 

机构地区：[1]铁道警官高等专科学校铁路与公安基础教研部,郑州450053

出　　处：《交通信息与安全》2012年第1期63-67,共5页Journal of Transport Information and Safety

摘　　要：根据城市交通路网分区理论,把分成的子区看成一个节点,考虑所有节点的可达性,以此度量整个路网的可达性,设计了基于路网可达性最大为目标的城市交通离散网络设计模型。采用粒子群算法,并给出一个简单的算例,算例表明,合理的添加路段,能使城市路网可达性达到最大。Based on the division theory of urban transportation network,this paper divided urban network into sub-district as a node,and considered the accessibility of all the nodes to measure the accessibility of the entire road network.A model for urban transportation discrete network was designed to maximize the road network accessibility.Moreover,a particle swarm optimization algorithm was proposed.A simple numerical example was presented.The numerical results show that reasonable added segment of road will maximize the urban road network accessibility.

关 键 词：可达性 城市交通 离散网络设计 粒子群算法 

分 类 号：U412[交通运输工程—道路与铁道工程]