检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]吉林大学交通学院,长春130022
出 处:《哈尔滨工业大学学报》2012年第10期144-148,共5页Journal of Harbin Institute of Technology
摘 要:为解决大城市公交网络优化设计问题,提出一种考虑交通拥堵的网络优化模型.首先分析最短路策略在大城市应用的弊端和造成交通拥堵的原因,在研究复杂网络理论的基础上,基于边介数提出绕行策略.通过扩展边介数,定义有效边介数和有效路径,提出基于边介数的大城市公交网络优化模型,并设计了实现算法.以长春市路网为例,求解β.结果表明,随着β的变化,平均出行距离先减小后增大,在β=0时最短;平均出行速度先基本稳定后急剧增大.β=0.1时,居民平均出行时间最短,网络效率最高,这时优化模型可快速减少由于交通拥挤造成的网络效率损失。In order to solve the optimal design problem of metropolitan bus transit network,a network optimization model was proposed,which had considered the urban traffic congestion.Firstly it analyzed the malpractices of the shortest path strategy in large cities and reasons of traffic jam.It studied complex network theory and proposed the bypass strategy based on edge betweenness.Through extending the edge betweenness,it defined effectivity edge betweenness and effectivity path.Then it proposed metropolis transit network optimization model based on edge betweenness and designed its algorithm.Take the street network of Changchun City for example to solve.The results show that with the changes of β,the average trip distance first decreases and then increases.When β=0,it is shortest.The average travel speed first is basically stable and then increases sharply.When β=1 the residents average travel time is shortest and the network efficiency is highest.At this time optimization model can rapid decrease the losses of network efficiency caused by traffic congestion.
关 键 词:公交网络优化 边介数 复杂网络理论 大城市公交 网络效率
分 类 号:U491.1[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.220.38.146