Dijkstra优化算法在停车场车位引导系统中的应用  

Dijkstra Optimization Algorithm Used in Parking Lots Guidance System

作　　者：张玉杰[1] 田硕[1] 

机构地区：[1]陕西科技大学电气与信息工程学院,西安710021

出　　处：《计算机测量与控制》2014年第1期191-193,共3页Computer Measurement &Control

基　　金：西安市科技计划项目(CX1259(2))

摘　　要：针对目前城市停车难、停车位使用效率低、大型停车场车位引导系统不完善等问题,结合一具体停车场车位引导系统的结构模型,从改善引导算法入手,对现有几种引导算法比较后选取Dijkstra算法,并从驾驶员的角度对最佳停车位进行分析,以寻找最佳停车位为目的,提出了一种带约束条件的Dijkstra优化算法,在VC++6.0环境下进行仿真,结果表明,优化后的Dijkstra算法的运算时间及复杂度明显降低,应用在停车场中,可在最短时间为驾驶员选择出最佳停车位并提供从入口到最佳停车位的路径引导,提高了目前停车场车位引导系统的智能化、人性化程度,对停车场效率的提高有一定贡献。Aiming at the problems of city parking difficultly, inefficient use of parking lots, and inperfect large parking lots guideline sys tern, combining the parking structure model of a parking lots guideline system, obtaining from the improved guidance algorithm, this paper selected the Dijkstra algorithm after comparing several kinds of algorithm, analysis the best parking lot in the view of drivers, then put for- ward a kind of Dijkstra optimization algorithm with constrains for the purpose of looking for the best parking lot, finished the simulation on the VC＋ ＋6.0 envionment. The results show that the optimized Dijkstra algorithm significantly reduces the operation time and complexity of the Traditional Dijkstra algorithm, be used in the parking lots guidance system, can choose the best parking lot and provide the path to guidance for drivers in the shortest possible time, and improve the degree of system intelligent and human nature, it has certain contribution on improving parking efficiency.

关 键 词：智能交通 车位引导 DIJKSTRA算法 引导算法 停车场 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]