摘要
为了缓解公交车辆进入单车道快速公交(BRT)车站容易出现排队的问题,提出了BRT车站组的线路停靠组合优化模型。首先基于排队论推导出BRT车辆进站不发生排队的概率模型,然后以最小排队概率为目标,提出整个车站组的线路停靠混合整数规划模型,并针对该模型的求解分别给出了一种基于分布式并行搜索的全局最优解算法和一种基于贪心策略的次优解快速算法;最后通过算例计算出广州市某个典型BRT车站组的线路停靠最优方案,利用VISSIM软件对优化方案及现有方案进行了多次仿真。结果表明:所提出的方法能够有效缓解公交车辆的进站排队现象。
In order to relieve the problem that queuing for bus stop in the single-lane of bus rapid transit（BRT） station occurs frequently,a combinatorial optimization model of bus stop in BRT station-group was put forward.Firstly,the non-queuing probability model for a single-lane of BRT station was deduced based on queuing theory.Then,a mixed integer programming model of minimizing the queuing probability of bus stop in station-group was proposed.Furthermore,a global-optimal solution algorithm on the basis of distributed parallel-search,and a local-optimal solution algorithm on the basis of greedy strategy were proposed to solve the combinatorial optimization model.Finally,the optimal bus stop program of a typical BRT station-group in Guangzhou was obtained by the proposed method in the example.Using VISSIM software,the optimal program and existing program were simulated.Results show that the proposed method can relieve the queuing situation of bus stop in station effectively.
出处
《中国公路学报》
EI
CAS
CSCD
北大核心
2011年第3期93-98,共6页
China Journal of Highway and Transport
基金
国家自然科学基金项目(50878088)
关键词
交通工程
快速公交
排队论
组合优化
车站组
线路停靠
traffic engineering
BRT
queuing theory
combinatorial optimization
station-group
bus stop
