全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

改进的A*算法在定制公交路径规划中的应用
Application of Improved A* Algorithm in Customized Bus Path Planning

DOI: 10.12677/CSA.2020.101003, PP. 21-28

Keywords: 路径规划,改进A*算法,定制公交,估价函数
Path Planning
, Improved A* Algorithm, Customized Bus, Valuation Function

Full-Text   Cite this paper   Add to My Lib

Abstract:

路径搜索是智能交通技术中的核心问题,定制公交路线需要考虑乘车便捷、运营成本、运行距离等因素,传统的A*算法一般用来求解两点间最短路径问题,该算法普遍存在搜索时间较长、效率较低、所求路径不一定最短等问题。因此,本文提出一种基于改进的A*算法的动态路径规划措施,将公交站点作为定制公交的乘车点,并把预计乘车人数与估价函数结合,不仅考虑了成本因素,还将路口作为路径规划的节点,对路径方向剪枝,提高搜索效率。本文针对改进后的A*算法进行实验,并与传统A*算法对比,实验结果表明,改进后的A*算法减少了路径搜索次数,提高了路径规划效率,同时降低公交公司的运营成本,达到了动态、实时路径规划的目的。
Path search is the core problem in intelligent transportation technology. Customized bus routes need to consider factors such as convenient travel, operating costs, and distance traveled. Traditional A* algorithms are generally used to solve the shortest path between two points. The algorithm has many problems such that the search time is long with low efficiency and the searched path is not necessarily the shortest. Therefore, this paper proposes a dynamic path planning measure based on the improved A* algorithm. The bus station is used as a point for customizing the bus, and the estimated number of passengers is combined with the valuation function. Not only is the cost factor considered, but also the intersection is taken as the nodes of the path plan pruning the path direction to improve the search efficiency. This paper conducts experiments on the improved A* algorithm and compares it with the traditional A* algorithm. The experimental results show that the improved A* algorithm reduces the number of route searches, improves the efficiency of route planning, and reduces the operating costs of bus companies for the purpose of dynamic and real-time path planning.

References

[1]  郭嫚. 基于多点对多点开行模式的定制公交线路规划研究[D]: [硕士学位论文]. 成都: 西南交通大学, 2018.
[2]  胡郁葱, 陈栩, 罗嘉陵. 多起终点多车型混载的定制公交线路规划模型[J]. 广西师范大学学报(自然科学版), 2018, 36(4): 1-10.
[3]  王俊培. 大城市定制公交服务体系研究[D]: [硕士学位论文]. 西安: 长安大学, 2015.
[4]  马继辉, 王飞, 王娇, 等. 定制公交站点和线路规划研究[J]. 城市交通, 2017(2): 21-25.
[5]  陆乾杰, 陈志平, 张林佳, 等. 基于蚁群算法多起点多终点社区公交路径规划[J]. 杭州电子科技大学学报(自然科学版), 2016, 36(3): 84-88.
[6]  Zhang, S.J. and Zhang, Y. (2018) A Hybrid Genetic and Ant Colony Algorithm for Finding the Shortest Path in Dynamic Traffic Networks. Automatic Control and Computer Sciences, 52, 67-76.
https://doi.org/10.3103/S014641161801008X
[7]  李少伟, 曹成涛. 基于A*算法的复杂交通环境下出行者最优路径分析研究[J]. 软件工程, 2019, 22(6): 29-32.
[8]  Huo, E.-Z., Miao, R. and Luan, S. (2019) Research on the Location Selection of Customized Shuttle Bus Stations Based on the MassData of Online Taxi-hailing Service. Abstract Proceedings of the 2019 World Transport Convention, Beijing, 2019, 33.
[9]  Liu, K. and Liu, C. (2019) The Study of Customized Bus Site and Route Planning Based on Site Segmentation Clustering Algorithm. Abstract Proceedings of the 2019 World Transport Convention (Cross-Cutting), Beijing, 2019, 110.
[10]  冯来春, 梁华为, 杜明博, 等. 基于A*引导域的RRT智能车辆路径规划算法[J]. 计算机系统应用, 2017, 26(8): 127-133.
[11]  彭澎. 基于A*算法的路径规划算法研究[D]: [硕士学位论文]. 马鞍山: 安徽工业大学, 2017.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133