改进Dijkstra的灵活公交路径规划算法

Enhancing the Flexible Public Transit Route Planning Algorithm Based on Dijkstra

实现高质量的交通服务,提供一种满足人们出行需求、具有便利性和舒适性的交通路径规划算法至关重要。但由于实际的路线规划面临着各种限制条件,使得线路安排比较复杂。为了降低运营成本并改善乘客的出行体验,本文提出启发式多目标路线规划算法BusRout。实验结果表明,BusRout能够有效减少公交车的运营成本,缩短乘客的等待时间,从而提高公交运营的效率和乘客的满意度。

It is crucial to provide a convenient and comfortable transportation path planning algorithm that meets people's travel needs in order to achieve high-quality transportation services.However,due to various constraints in actual route planning,the route arrangement is relatively complex.In order to reduce operating costs and improve passenger travel experience,this paper proposes a heuristic multi-objective route planning algorithm BusRout.The experimental results indicate that BusRout can effectively reduce the operating costs of buses,shorten passenger waiting time,and thus improve the efficiency of bus operations and passenger satisfaction.