Dijkstra改进算法在停车场内部路径引导中的应用

针对大型停车场泊位引导效率低以及管理系统不完善等问题进行分析，对停车场内的路网特征进行研究。从用户角度分析其对最优泊位选择的影响因素，以寻找最优泊位为目的，提出一种Dijkstra改进算法，并在MAT‐LAB环境下进行仿真。改进的Dijkstra算法要比传统Dijkstra算法的计算效率提高65％，为用户进入大型停车场提供向导服务，帮助其尽快找到合适泊位，进而对提高停车场管理系统的智能化程度以及停车效率作出贡献。

Application of dijkstra improved algorithm to guiding the internal path of parking lot

As to the problems of low efficiency of parking guidance and imperfect parking management system in large parking lots ,a study is made on the characteristics of the road network in the parking lots . For the users’ interst ,this paper analyzes the factors that affect the choice of the optimal berth .An Dijkstra improved algorithm with constraint conditions is proposed ,and simulated by MATLAB . The improved Dijkstra algorithm is better than the traditional Dijkstra algorithm and the computational efficiency is improved by 65% ,w hich provides a guide for the users to enter the large parking lot and to help them find the optimal berth as soon as possible ,then improve the parking management system on the degree of intelligence and the parking efficiency .