Design and Implementation of the Optimization Algorithm in the Layout of Parking Lot Guidance

Zhendong Liu,Dongyan Li,Yurong Yang,Xinrong Lv,Xi Chen,Xiaofeng Li,Xingsi Xue

doi:10.1155/2021/6639558

Zhendong Liu, Dongyan Li + Show 5 more

Open Access

https://doi.org/10.1155/2021/6639558

Copy DOI

Abstract

The information guidance system for parking spaces in large- and medium-sized parking lots is not efficient at present. It tends to be difficult to find an empty parking space in parking lots in big cities. One of the problems is the large amount of calculation in the traditional Dijkstra algorithm. In this paper, an improved Dijkstra algorithm is presented and optimized to find the best parking path with the purpose of looking for the nearest free parking space based on the layout model in parking lot parking guidance. The experiments show that the improved Dijkstra algorithm can find the optimal parking space and the optimal parking path and improve the parking efficiency.

Highlights

With the continuous expansion of the scale of cities, the problem of parking difficulties has become increasingly prominent and traffic accidents frequently occur
The main reasons for the problem of “difficult parking” are as follows: the current urban parking spaces are in short supply; more importantly, in the process of searching for parking spaces, people can get less valuable parking space information; and there is a lack in parking space information management platform to guide vehicle drivers to park reasonably [1]
When the car owners arrives at the destination parking lot, they need to rely on the guidance of the managers in the parking lot or drive blindly to find the parking space, which wastes time and energy and brings new problems: parade parking, resulting in congestion in the parking lot

Summary

Introduction

With the continuous expansion of the scale of cities, the problem of parking difficulties has become increasingly prominent and traffic accidents frequently occur. When the car owners arrives at the destination parking lot, they need to rely on the guidance of the managers in the parking lot or drive blindly to find the parking space, which wastes time and energy and brings new problems: parade parking, resulting in congestion in the parking lot. It is an urgent problem that the guidance of parking spaces is imperfect and needs to be solved [5] To address this challenge, we established an abstract data model of parking guidance based on the layout model in parking lot parking guidance, optimized this data model by using Dijkstra’s improved algorithm, and found an optimal parking path with the lowest cost.

System Structure and Parking Space Model Establishment

Optimization Algorithm in the Layout of Parking Lot Guidance

Experimental Analysis

Conclusion