期刊文献+

城市地铁站点接驳公交多目标优化方法 被引量:3

Multi-objective optimization method for connecting buses in urban subway stations
下载PDF
导出
摘要 多方式无缝衔接,尤其是公交和地铁的便利衔接是提高居民出行品质、提升绿色方式分担率的重要前提。目前,已有很多公交和地铁换乘优化的研究,但大多基于网络可达性、换乘距离最短等单一目标设置静态方案,缺乏对接驳站点和运营优化的同步兼顾,致使现有优化方法的实际应用效果欠佳。为解决上述问题,本文首先提出一种改进DBSCAN聚类算法,引入站点隔离度和客流需求量两个因素完成公交站点聚类划分,确定接驳站点候选集合。其次,以兼顾系统效益和个体利益为目标,融合宏观社会层面和微观个人层面的多维因素,建立接驳公交多目标双层规划模型,打破单一维度和单一目标优化的局限。最后,设计了一种基于精英非支配排序遗传算法(NSGA-II)的模型求解方法,并依据杭州市的实际数据对模型进行了验证,结果表明新方法可以有效串联公交站点,提高客流服务率。本文成果对实际接驳公交设计有一定的参考价值。 The seamless connection of multiple modes,in particular the convenient connection between bus and subway,is an important prerequisite for improving the travel quality of residents and increasing the rate of residents traveling in an eco-friendly manner.Bus and subway transfer optimization has been investigated extensively.However,most of the studies conducted involve the derivation of static solutions based on single goal,such as network accessibility and the shortest transfer distance,which do not simultaneously consider bus stops and operation optimization,thus resulting in an unsatisfactory practical application of existing optimization methods.In this study,to consider system benefits and individual interests and to integrate multidimensional factors at the macro-social and micro-personal levels,a multi-objective two-level planning model for connecting public transport is established that transcends the limitations of single-dimensional and single-objective optimization.Additionally,a model solving method based on the NSGA-II algorithm is designed,and the model is verified based on the actual data of Hangzhou.The results show that the proposed method can connect more bus stops and improve the service rate to ensure smooth passenger flow.The results presented herein can serve as a basis for the actual connection bus design.
作者 韩月一 王登忠 王如杰 马东方 袁超 HAN Yue-yi;WANG Deng-zhong;WANG Ru-jie;MA Dong-fang;YUAN Chao(Ocean College,Zhejiang University,Hangzhou 310058,China;Zhejiang Scientific Research Institute of Transport,Hangzhou 310023,China;Zhejiang University Zhongyuan Institute,Zhengzhou 450000,China)
出处 《交通运输工程与信息学报》 2023年第1期80-93,共14页 Journal of Transportation Engineering and Information
基金 国家重点研发计划项目(2019YFB1600300) 浙江省交通运输厅科技项目(2021018)。
关键词 城市交通 公交出行 多目标优化 接驳 聚类分析 双层规划模型 urban traffic public transportation multi-objective optimization connection cluster analysis two-level planning mode
  • 相关文献

参考文献12

二级参考文献89

  • 1王志栋.公交线网优化模型的建立[J].大连交通大学学报,1997,27(4):33-36. 被引量:38
  • 2马云峰,杨超,张敏,郝春艳.基于时间满意的最大覆盖选址问题[J].中国管理科学,2006,14(2):45-51. 被引量:79
  • 3Xiong J, Guan W, Song L Y, et al. Optimal routing design of a community shuttle for metro stations[J]. Journal of Transportation Engineering, 2013, 139(12): 1211-1223.
  • 4Chien S I, Spasovic L N, Elefsiniotis S S, et al. Evaluation of feeder bus systems with probabilistic timevarying demands and nonadditive time costs[J]. Transit: Bus Transit and Maintenance, Paratransit, and New Technology, 2001, (1760): 47-55.
  • 5Kuah G K, Perl J. Optimization of feeder bus routes and bus-stop spacing[J]. Journal of Transportation Engineering-Asce, 1988, 114(3): 341-354.
  • 6Martins C L, Pato M V. Search strategies for the feeder bus network design problem[J]. European journal of operational research, 1998, 106(2-3): 425-440.
  • 7Wirasinghe S C, Hurdle V F, Newell G F. Optimal parameters for a coordinated rail and bus transit system[J]. Transportation Science, 1977,11(4): 359-374.
  • 8Kuan 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.
  • 9Kuan S N, Ong H L, Ng K M. Applying metaheuristics to feeder bus network design problem[J]. Asia- Pacific Journal of Operational Research, 2004, 21(4): 543-560.
  • 10Shariat Mohaymany A, Gholami A. Multimodal feeder network design problem: ant colony optimization approach[J]. Journal of Transportation Engineering, 2010, 136(4): 323-331.

共引文献41

同被引文献33

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部