考虑客源竞争的柔性交通动态选址研究

Qi Wang, Wen-hong Lv, Ge Gao, Guimin Gong
{"title":"考虑客源竞争的柔性交通动态选址研究","authors":"Qi Wang, Wen-hong Lv, Ge Gao, Guimin Gong","doi":"10.1109/ICCECE58074.2023.10135373","DOIUrl":null,"url":null,"abstract":"In order to reduce the travel of taxis and private cars and meet the personalized travel needs of passengers, a site selection method is proposed to avoid the conventional bus service area and compete for taxi customers. Flexible bus site selection includes fixed site selection and dynamic site selection. Firstly, 1000 points in the morning and evening peak periods of Shenzhen taxi track data were selected, and the theoretical fixed stations were obtained by using the clustering algorithm combined with DBSCAN and K-means. The service areas of conventional bus stations were marked to avoid the conventional bus passenger sources, and the location optimization from theoretical stations to actual stations was realized. Secondly, a dynamic site selection model aiming at minimizing the total cost of the system was constructed and solved by genetic algorithm. Finally, it is verified by an example. The results show that this method has good usability in avoiding the regular bus passenger source and competing with the taxi passenger source by taking the taxi data as the demand point and avoiding the service area of the regular station.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Dynamic Site Selection of Flexible Transit Considering Passenger Source Competition\",\"authors\":\"Qi Wang, Wen-hong Lv, Ge Gao, Guimin Gong\",\"doi\":\"10.1109/ICCECE58074.2023.10135373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to reduce the travel of taxis and private cars and meet the personalized travel needs of passengers, a site selection method is proposed to avoid the conventional bus service area and compete for taxi customers. Flexible bus site selection includes fixed site selection and dynamic site selection. Firstly, 1000 points in the morning and evening peak periods of Shenzhen taxi track data were selected, and the theoretical fixed stations were obtained by using the clustering algorithm combined with DBSCAN and K-means. The service areas of conventional bus stations were marked to avoid the conventional bus passenger sources, and the location optimization from theoretical stations to actual stations was realized. Secondly, a dynamic site selection model aiming at minimizing the total cost of the system was constructed and solved by genetic algorithm. Finally, it is verified by an example. The results show that this method has good usability in avoiding the regular bus passenger source and competing with the taxi passenger source by taking the taxi data as the demand point and avoiding the service area of the regular station.\",\"PeriodicalId\":120030,\"journal\":{\"name\":\"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCECE58074.2023.10135373\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了减少出租车和私家车的出行,满足乘客的个性化出行需求,提出了避开传统公交服务区,争夺出租车客源的选址方法。公交灵活选址包括固定选址和动态选址。首先选取深圳出租车轨道数据早高峰和晚高峰时段的1000个点,采用DBSCAN和K-means相结合的聚类算法得到理论固定站;通过对常规公交站点服务区域进行标识,避开常规公交客源,实现了从理论站点到实际站点的区位优化。其次,构建了以系统总成本最小为目标的动态选址模型,并采用遗传算法进行求解;最后,通过实例进行了验证。结果表明,该方法以出租车数据为需求点,避开常规车站服务区,在避开常规公交客源和与出租车客源竞争方面具有良好的可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Dynamic Site Selection of Flexible Transit Considering Passenger Source Competition
In order to reduce the travel of taxis and private cars and meet the personalized travel needs of passengers, a site selection method is proposed to avoid the conventional bus service area and compete for taxi customers. Flexible bus site selection includes fixed site selection and dynamic site selection. Firstly, 1000 points in the morning and evening peak periods of Shenzhen taxi track data were selected, and the theoretical fixed stations were obtained by using the clustering algorithm combined with DBSCAN and K-means. The service areas of conventional bus stations were marked to avoid the conventional bus passenger sources, and the location optimization from theoretical stations to actual stations was realized. Secondly, a dynamic site selection model aiming at minimizing the total cost of the system was constructed and solved by genetic algorithm. Finally, it is verified by an example. The results show that this method has good usability in avoiding the regular bus passenger source and competing with the taxi passenger source by taking the taxi data as the demand point and avoiding the service area of the regular station.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信