| 基于路网可达性的城市交通离散网络设计模型及算法 |
| |
| 引用本文： | 邓克涛.基于路网可达性的城市交通离散网络设计模型及算法[J].交通与计算机,2012(1):63-67. |
| |
| 作者姓名： | 邓克涛 |
| |
| 作者单位： | 铁道警官高等专科学校铁路与公安基础教研部,郑州450053 |
| |
| 摘 要： | 根据城市交通路网分区理论,把分成的子区看成一个节点,考虑所有节点的可达性,以此度量整个路网的可达性,设计了基于路网可达性最大为目标的城市交通离散网络设计模型。采用粒子群算法,并给出一个简单的算例,算例表明,合理的添加路段,能使城市路网可达性达到最大。
|
| 关 键 词： | 可达性 城市交通 离散网络设计 粒子群算法 |
Model and Algorithm for Urban Transportation Discrete Network Design Based on Road Network Accessibility |
| |
| DENG Ketao.Model and Algorithm for Urban Transportation Discrete Network Design Based on Road Network Accessibility[J].Computer and Communications,2012(1):63-67. |
| |
| Authors: | DENG Ketao |
| |
| Institution: | DENG Ketao(Basis Teaching and Research Department,Railway and Police Railway Police College,Zhengzhou 450053,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | accessibility urban transportation discrete network design particle swarm optimization algorithm |
| 本文献已被 维普 等数据库收录！ |
|
