基于旅客出行需求数据的机场巴士站点布局与路径优化研究

doi:10.3976/j.issn.1002-4026.20240131

Abstract

Abstract:

This study analyzed actual passenger travel demand based on city bus and subway card swipe data to provide data support for airport bus station selection and route optimization. First, travel demand centers were identified by analyzing card swipe data, and the K-medoids clustering algorithm was used to cluster city-wide travel demands. The resulting travel demand centers, along with major transportation hubs such as railway stations, were selected as shuttle bus stations to provide passengers with convenient transfer services. Second, optimal routes between stations were generated using network analysis and route optimization algorithms to improve the service coverage and operational efficiency of the airport shuttle. Finally, recommended routes were refined through manual adjustments of the optimal routes. A comparative analysis of route evaluation results revealed that the optimal airport shuttle routes significantly reduced the total walking distance of passengers. This study optimized airport bus station layout and route planning based on actual travel demand, providing scientific support for improving airport transfer services.

Key words: airport travel demand, demand center identification, airport shuttle bus, station selection, route optimization

CLC Number:

U491

HE Jia, ZHAO Xiaoqi. Research on the layout and route optimization of airport shuttle bus stations based on passenger travel demand data[J].Shandong Science, 2025, 38(6): 115-124.

Figures/Tables 9

Fig.1

Fig.2

Fig.3

Table 1

Fig.4

Table 2

Fig.5

Fig.6

Fig.7

References 26

[1]	赵天天. 改进的K-means算法在校车站点布局中的应用[J]. 地理空间信息, 2021, 19(1): 116-118. DOI:10.3969/j.issn.1672-4623.2021.01.031.
[2]	王洪涛. 校车站点布局的仿真模拟[J]. 信息与电脑(理论版), 2021, 33(13): 43-48. DOI:10.3969/j.issn.1003-9767.2021.13.014.
[3]	陆炜, 郑浩南, 王富. 基于街区制的微循环公交系统规划方法研究[J]. 交通与运输, 2024, 40(2): 88-93.DOI:10.3969/j.issn.1671-3400.2024.02.018.
[4]	田诗佳, 包丹文, 程昊. 城市辖区机场巴士站点需求度评价及选址方法[J]. 交通运输研究, 2023, 9(2): 22-32. DOI:10.16503/j.cnki.2095-9931.2023.02.003.
[5]	年光跃, 黄建云, 潘海啸. 基于机器学习空间聚类的出租车停靠站点布局规划[J]. 交通运输研究, 2024, 10(1): 10-17. DOI:10.16503/j.cnki.2095-9931.2024.01.002.
[6]	管新梅. 连云区公共自行车租赁点的布局优化研究[D]. 徐州: 中国矿业大学, 2019. DOI:10.27623/d.cnki.gzkyu.2019.000446.
[7]	邬群勇, 万云鹏. 基于多指标协同的公交大站快车站点推荐方法[J]. 交通运输系统工程与信息, 2021, 21(1):162-168.DOI:10.16097/j.cnki.1009-6744.2021.01.025.
[8]	ZHAO R Q, LIU W, ZHANG F N, et al. Passenger shuttle service network design in an airport[J]. Transportmetrica B: Transport Dynamics, 2022, 10(1): 1099-1125. DOI:10.1080/21680566.2021.2008279.
[9]	陆学智, 文浩. 机场大巴营运网络设计模型和算法研究[J]. 公路与汽运, 2017(1): 44-49. DOI:10.3969/j.issn.1671-2668.2017.01.011.
[10]	李云伟. 响应预约需求的定制公交站线规划方法研究[D]. 北京: 北京交通大学, 2019. DOI:10.26944/d.cnki.gbfju.2019.001237.
[11]	马昌喜, 王超, 郝威, 等. 突发公共卫生事件下应急定制公交线路优化[J]. 交通运输工程学报, 2020, 20(03):89-99.DOI:10.19818/j.cnki.1671-1637.2020.03.008.
[12]	郭亚然, 周和平, 彭巍. 基于区间路网信息的机场定制巴士路径优化[J]. 长沙理工大学学报(自然科学版), 2018, 15(3): 21-26. DOI:10.3969/j.issn.1672-9331.2018.03.005.
[13]	SIGLER D, WANG Q C, LIU Z C, et al. Route optimization for energy efficient airport shuttle operations: A case study from Dallas Fort worth International Airport[J]. Journal of Air Transport Management, 2021, 94: 102077. DOI:10.1016/j.jairtraman.2021.102077.
[14]	胡启洲, 邓卫, 田新现. 基于四维消耗的公交线网优化模型及蚁群算法[J]. 东南大学学报(自然科学版), 2008, 38(2): 304-308. DOI:10.3321/j.issn:1001-0505.2008.02.024.
[15]	戴帅, 陆化普, 胡启洲. 基于一体化的多层次公交线网优化研究[J]. 数学的实践与认识, 2011, 41(1): 85-93.
[16]	李士强, 张云鹏, 田崇新. 基于Python的网络地图坐标转换方法研究[J]. 测绘与空间地理信息, 2019, 42(7): 46-48. DOI:10.3969/j.issn.1672-5867.2019.07.013.
[17]	余洋. K-Medoids聚类算法的计算机信息处理技术研究[J]. 信息与电脑(理论版), 2024, 36(11): 23-25.
[18]	吴松涛. 欧氏距离聚类在点位优化中的应用[J]. 环境与发展, 2020, 32(11): 144-145. DOI:10.16647/j.cnki.cn15-1369/X.2020.11.067.
[19]	文浩. 机场大巴营运网络设计模型与算法研究[D]. 长沙: 长沙理工大学, 2015.
[20]	孔钦, 刘晨, 顾永鑫. 基于贪心算法的常态化防疫交通路线智能推荐系统[J]. 现代信息科技, 2022, 6(17): 33-37. DOI:10.19850/j.cnki.2096-4706.2022.17.008.
[21]	申燚, 赵泽钰, 袁明新, 等. 基于四叉树扇形层值聚类的无人船障碍物检测[J]. 科学技术与工程, 2024, 24(13): 5427-5435.DOI:10.12404/j.issn.1671-1815.2304084.
[22]	连晓燕. 机场巴士网络优化设计问题研究[D]. 北京: 首都经济贸易大学, 2020.
[23]	樊东卫, 何勃亮, 李长华, 等. 球面距离计算方法及精度比较[J]. 天文研究与技术, 2019, 16(1): 69-76. DOI:10.3969/j.issn.1672-7673.2019.01.009.
[24]	SENTHILKUMAR S R, JABAK V H, VIDYASHANKAR G, et al.Optimized bus route finder for educational institutes using haversine formula[C]//2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). Kamand: IEEE, 2024: 1-4. DOI: 10.1109/ICCCNT61001.2024.10725509.
[25]	ANDREOU A, MAVROMOUSTAKIS C X, BATALLA J M, et al. UAV trajectory optimisation in smart cities using modified A^* algorithm combined with haversine and vincenty formulas[J]. IEEE Transactions on Vehicular Technology, 2023, 72(8): 9757-9769. DOI: 10.1109/TVT.2023.3254604.
[26]	PRASETYA D A, NGUYEN P T, FAIZULLIN R, et al. Resolving the shortest path problem using the haversine algorithm[J]. Journal of critical reviews, 2020, 7(1): 62-64.

Metrics

Comments

Recommended 0

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0

站名	处理方式
崇文门	保留,结合走向纳入2号线
高米店北	初始路线已覆盖
安贞桥	初始路线已覆盖
立水桥	优化线路里程,将原5号线天通苑南修改为该站点
东直门	初始路线已覆盖
北新桥	初始路线已覆盖
北京南站	初始路线已覆盖
车公庄	优化线路走向,原3号线改走西二环,将车公庄西修改为该站点
玉泉路	新增站点,并入4号线
呼家楼	初始路线已覆盖
生命科学园	新增站点,并入5号线
南法信	新增站点,并入接驳线
海淀黄庄	新增站点,并入4号线
阎村	距离现有线路过远,删除处理
三元桥	初始路线已覆盖
通州北关	新增站点,并入2号线
亦庄桥	新增站点,并入1号线
望京南	初始路线已覆盖
四惠	新增站点,并入2号线

Research on the layout and route optimization of airport shuttle bus stations based on passenger travel demand data

RichHTML

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 9

References 26

Related Articles 2

Metrics

Comments

Recommended 0

[1]	LU Wen-qi, GU Yuan-li, LI Meng, WANG Shuo, ZHANG Yuan. An algorithm for point to point shortest paths based on preprocessing [J]. SHANDONG SCIENCE, 2018, 31(2): 64-71.
[2]	WEI Chao, LONG Jiancheng. Optimal design of urban rail transit feeder bus routes [J]. SHANDONG SCIENCE, 2015, 28(3): 65-73.

初始路径算法
输入: station_points, G, T2_lat, T2_lon
输出: route
1.从T2_lat, T2_lon获取T2的最近节点T2_node
2.对于每个站点(station_name, lon, lat):
计算其最近的路网节点station_node
3.对于每个站点,计算从T2_node到station_node的最短路径distance 4.使用贪心算法进行路线规划: 1.初始化visited={}和route=[] 2.将N_c设置为T2_node 3.重复直到所有站点都被访问: a.对于每个未访问的站点,计算从N_c到该站点的路径长度 b.选择最短路径对应的站点closest_station c.将closest_station加入route d.将该站点标记为已访问 e.更新N_c为closest_station的节点 5.更新站点数据中“站点顺序”列 6.保存结果到输出文件