[1]邓连波,何渊,曾俊豪,等.需求可拆分下城轨关联的公交接驳线网优化[J].深圳大学学报理工版,2020,37(2):121-129.[doi:10.3724/SP.J.1249.2020.02121]
　DENG Lianbo,HE Yuan,ZENG Junhao,et al.Optimal design of feeder-bus network with split delivery[J].Journal of Shenzhen University Science and Engineering,2020,37(2):121-129.[doi:10.3724/SP.J.1249.2020.02121]
点击复制

需求可拆分下城轨关联的公交接驳线网优化()
分享到：

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
第37卷
期数:
2020年第2期
页码:
121-129
栏目:
交通物流
出版日期:
2020-03-16

文章信息/Info

Title:
Optimal design of feeder-bus network with split delivery
文章编号:
202002002
作者:
邓连波; 何渊; 曾俊豪; 周文梁
中南大学交通运输工程学院，湖南长沙 410075
Author(s):
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
关键词:
公共交通; 公交接驳线网; 需求可拆分; 换乘网络; 线路重复站点; 遗传算法
Keywords:
public transport;  feeder-bus network;  split delivery;  transfer network;  repeat bus stop;  genetic algorithm
分类号:
U293
DOI:
10.3724/SP.J.1249.2020.02121
文献标志码:
A
摘要:
基于典型的公交接驳线网优化问题，将每一公交站点具有唯一线路服务这一假设扩充到每一个公交站点可由多条公交线路服务，使公交站点与公交接驳线路间具有多对多的关系，即拓展到需求在多条线路间具有可拆分性的情形，形成需求可拆分的公交接驳线网优化问题．依据该情形下的公交接驳线网特性构建约束条件，分析换乘网络上乘客出行费用，并构造客流选择函数，建立需求可拆分条件下的接驳线网优化模型．通过在遗传算法中引入公交重复站点生成和插入策略，求解该模型．算例结果表明，需求可拆分情形下，公交接驳线网优化问题的求解时间显著增长，允许公交线路间具有重复站点可改善公交线网，随着网络客流量的上升，重复站点数量增加并集中于客流较多的站点．
Abstract:
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.

参考文献/References:

［1］ KUAH G K, PERL J. The feeder-bus network-design problem［J］. Journal of the Operational Research Society, 1989, 40(8): 751-767.
［2］ BYRNE B F，VUCHIC V R．Public transportation line positions and headways for minimum cost［DB/OL］．(1973-12-22)［2018-10-11］. https://trid.trb.org/view.aspx?id=132894.
［3］ LENSTRA J K，KAN A H．Complexity of vehicle routing and scheduling problems［J］．Networks，1981，11(2)：221-227．
［4］ KUAN S N，ONG H L，NG K M．Solving the feeder bus network design problem by genetic algorithms and ant colony optimization［J］．Advances in Engineering Software，2006, 37(6): 351-359．
［5］ 邓连波，高伟，赖天珍，等．基于换乘网络的城市轨道关联公交接驳线网优化［J］．铁道科学与工程学报，2012，9(6)：77-83．
DENG Lianbo，GAO Wei, LAI Tianzhen, et al．Optimal design of feeder-bus network related to urban rail transit based on transfer network［J］．Journal of Railway Science and Engineering，2012，9(6)：77-83．(in Chinese)
［6］ LI Xin，WEI Ming，HU Jia，et al．An agent-based model for dispatching real-time demand-responsive feeder bus［J］．Mathematical Problems in Engineering，2018，2018(1)：1-11．
［7］ SUN Bo, WEI Ming, YANG Chunfeng, et al. Personalised and coordinated demand-responsive feeder transit service design：a genetic algorithms approach［J］．Future Internet，2018，10(7): 61-74．
［8］ ANASTASIOS C，CHRISTINA L，KONSTANTINOS K．DRT route design for the first/last mile problem：model and application to Athens，Greece［J］．Public Transport，2018，10(3)：499-527．
［9］ TAPLIN J H, SUN Yuchao. Optimizing bus stop locations for walking access: stops-first design of a feeder route to enhance a residential plan［J］. Environment and Planning B: Urban Analytics and City Science, 2019: 1-23.
［10］ 刘新宇，符卓，邱萌．需求可拆分车辆路径问题研究［J］．技术经济，2017，36(1)：96-108．
LIU Xinyu，FU Zhuo，QIU Meng．Research on vehicle routing problem with split delivery：literature review［J］．Technology Economics，2017，36(1)：96-108．(in Chinese)
［11］ JIN Mingzhou，LIU Kai，BRUAK E．A column generation approach for the split delivery vehicle routing problem［J］．Operations Research Letters，2008, 36(2)：265-270．
［12］ 李三彬，柴玉梅，王黎明．需求可拆分的开放式车辆路径问题研究［J］．计算机工程，2011，37(6)：168-171．
LI Sanbin, CHAI Yumei, WANG Liming. Research on split delivery open vehicle routing problem［J］．Computer Engineering，2011，37(6)：168-171．(in Chinese)
［13］ KHMELEY A，KOCHETOY Y．A hybrid VND method for the split delivery vehicle routing problem［J］．Electronic Notes in Discrete Mathematics，2015, 47：5-12．
［14］ 符卓，刘文，邱萌．带软时间窗的需求依订单拆分车辆路径问题及其禁忌搜索算法［J］．中国管理科学，2017，25(5)：78-85．
FU Zhuo，LIU Wen，QIU Meng．A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order［J］．Chinese Journal of Management Science，2017，25(5)：78-85．(in Chinese)
［15］ 陈国良，王煦法，庄镇泉，等．遗传算法及其应用［M］．北京：人民邮电出版社，1996．
CHEN Guoliang, WANG Xufa, ZHUANG Zhenquan, et al. Genetic algorithm and its application［M］. Beijing: Posts & Telecom Press, 1996.(in Chinese)
［16］ 邓连波，史峰，莫辉辉．物流配送车辆路径问题多代竞争遗传算法［J］．铁道科学与工程学报，2005，2(5)：75-79．
DENG Lianbo，SHI Feng，MO Huihui．Multi-generation compete genetic algorithms for logistics distribution vehicle routing problem［J］．Journal of Railway Science and Engineering，2005，2(5)：75-79．(in Chinese)
［17］ 符卓，聂靖．求解带装载能力限制的开放式车辆的路径问题的遗传算法［J］．系统工程，2008，26(2)：78-83．
FU Zhuo, NIE Jing. A genetic algorithm for the capacitated open vehicle routing problem［J］．Systems Engineering，2008，26(2)：78-83．(in Chinese)

相似文献/References:

[1]梅振宇,葛宏伟,项贻强.基于离散分布的公交站距优化模型[J].深圳大学学报理工版,2007,24(4):357.
　MEI Zhen-yu,GE Hong-wei,and XIANG Yi-qiang.A bus stop spacing optimizing model based on　discrete distribution demand[J].Journal of Shenzhen University Science and Engineering,2007,24(2):357.
[2]韩彪,聂伟,王卫平,等.基于公交车站的可达性度量模型[J].深圳大学学报理工版,2013,30(No.1(001-110)):98.[doi:10.3724/SP.J.1249.2013.01098]
　Han Biao,Nie Wei,Wang Weiping,et al.Accessibility measurement model based on bus stop[J].Journal of Shenzhen University Science and Engineering,2013,30(2):98.[doi:10.3724/SP.J.1249.2013.01098]
[3]宗刚,吴彤.公共交通枢纽可达性测度及应用[J].深圳大学学报理工版,2016,33(5):544.[doi:10.3724/SP.J.1249.2016.05544]
　Zong Gang and Wu Tong.Measurement and application of accessibility of public transportation hub[J].Journal of Shenzhen University Science and Engineering,2016,33(2):544.[doi:10.3724/SP.J.1249.2016.05544]
[4]李军,郑培庆.城市公交过剩通勤分析与评价——以广州市为例[J].深圳大学学报理工版,2020,37(6):623.[doi:10.3724/SP.J.1249.2020.06623]
　LI Jun and ZHENG Peiqing.Analyzing and evaluating of the urban transit excess commuting: a case study of Guangzhou City[J].Journal of Shenzhen University Science and Engineering,2020,37(2):623.[doi:10.3724/SP.J.1249.2020.06623]

备注/Memo

备注/Memo:
Received：2018-12-04；Accepted：2019-03-28
Foundation：National Natural Science Foundation of China (71471179, U1834209)
Corresponding author：Professor DENG Lianbo. E-mail: lbdeng@csu.edu.cn
Citation：DENG Lianbo, HE Yuan, ZENG Junhao, et al. Optimal design of feeder-bus network with split delivery［J］. Journal of Shenzhen University Science and Engineering, 2020, 37(2): 121-129.（in Chinese）
基金项目：国家自然科学基金资助项目（71471179, U1834209）
作者简介：邓连波（1977—），中南大学教授、博士生导师. 研究方向: 交通运输运营管理、公共交通组织优化． E-mail: lbdeng@csu.edu.cn
引文：邓连波，何渊，曾俊豪，等．需求可拆分下城轨关联的公交接驳线网优化［J］. 深圳大学学报理工版，2020，37(2)：121-129.
更新日期/Last Update: 2020-03-30