基于大型停车场停车冲突的路径优化研究

Research on Path Optimization Based on Parking Conflict in Large Parking Lot

针对大型停车场停车效率低、在停车高峰时期容易出现停车拥堵,对大型停车场的结构特点以及动态车流量进行分析,在改进Dijkstra算法的基础上,提出了一种考虑停车拥堵的Dijkstra算法,并且在Matlab环境下进行了单车仿真,进一步加入多车跟车模型进行优化,模拟仿真分析大型停车场内多车停车。结果表明:考虑停车拥堵的Dijkstra算法能够帮助驾驶员减少停车等待的时间,优化后的Dijkstra算法能够提高汽车在停车场高峰停车时间的通行效率,当汽车数量超过停车路径所能承受的最大数量时,可以使汽车的停车时间较传统的改进Dijkstra算法平均减少17%,当汽车数量小于停车路径上最大承受的数量时,能够使汽车避免停车等待,提高大型停车场高峰时期的停车效率。

In view of the low parking efficiency of large parking lots and the situation that parking congestion is easy to occur in the parking peak period,the structure characteristics and dynamic traffic flow of large parking lot are analyzed.Based on the traditional Dijkstra algorithm,this paper proposes a new Dijkstra algorithm considering parking congestion.With the simulation of Matlab,the parking condition of bicycle is analyzed.Besides,the multi-car following model is added to optimize the simulation analysis of multi-car parking in large parking lots depending on the parking model of the single vehicle.The simulation results indicate that the Dijkstra algorithm considering parking congestion can help drivers reduce the waiting time of parking.The optimized Dijkstraalgorithm can improve the traffic efficiency in parking peak time.Furthermore,when the number of car exceeds the maximum number in parking paths,it can make the parking time decrease 17 percentage,better than the parking time under traditional Dijkstra algorithm.When the number of car is less than the maximum number in parking paths,it can eliminate the waiting time of parking,which can improve the parking efficiency in the large parking lots.