需求可拆分下城轨关联的公交接驳线网优化

中南大学交通运输工程学院,湖南长沙 410075

公共交通; 公交接驳线网; 需求可拆分; 换乘网络; 线路重复站点; 遗传算法

Optimal design of feeder-bus network with split delivery
DENG Lianbo, HE Yuan, ZENG Junhao, and ZHOU Wenliang

School of Traffic and Transportation Engineering, Central South University, Changsha 410075, Hunan Province, P.R.China

public transport; feeder-bus network; split delivery; transfer network; repeat bus stop; genetic algorithm

DOI: 10.3724/SP.J.1249.2020.02121

备注

基于典型的公交接驳线网优化问题,将每一公交站点具有唯一线路服务这一假设扩充到每一个公交站点可由多条公交线路服务,使公交站点与公交接驳线路间具有多对多的关系,即拓展到需求在多条线路间具有可拆分性的情形,形成需求可拆分的公交接驳线网优化问题.依据该情形下的公交接驳线网特性构建约束条件,分析换乘网络上乘客出行费用,并构造客流选择函数,建立需求可拆分条件下的接驳线网优化模型.通过在遗传算法中引入公交重复站点生成和插入策略,求解该模型.算例结果表明,需求可拆分情形下,公交接驳线网优化问题的求解时间显著增长,允许公交线路间具有重复站点可改善公交线网,随着网络客流量的上升,重复站点数量增加并集中于客流较多的站点.

Based on the typical optimization problem of the feeder-bus network design problem(FBNDP), we discuss the feeder-bus network design problem with split delivery(FBNDP-SD). The passenger demand of each bus stop is allowed to be served by different feeder-bus routes, which means that the passenger demand of each bus stop can be distributed into more than one route. Thus the relationship between bus stops and feeder-bus routes changes into many-to-many pattern. According to the characteristic of the FBNDP-SD, this paper introduces new constraints, analyzes travel cost of passengers, constructs the passenger flow selection function and establishes optimal feeder-bus network under the condition of demand splitting. We design the modified genetic algorithm and introduce repeated bus stop generating and inserting strategies. The results show that the computation time increases significantly under FBNDP-SD, and permission of repeated bus stop in feeder-bus routes has influence on feeder-bus network improvement. The amount of repeated bus stop increases as the network traffic increases, and most of these bus stops have great passenger demand.

·