摘要
路径搜索是智能交通技术中的核心问题,定制公交路线需要考虑乘车便捷、运营成本、运行距离等因素,传统的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.
出处
《计算机科学与应用》
2020年第1期21-28,共8页
Computer Science and Application
基金
山东省自然科学基金资助项目(编号:ZR2017BF043)
山东省大学生创新创业训练计划项目(编号:S201910429064).
