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

Algorithm 1

ImDA().

is the set of free parking spaces, is the weight (path distance) of free parking spaces

1 calculate the distance between longitude and latitude of free parking spaces and longitude and latitude of the car M to be parked, the set of 5 free parking Spaces with the shortest distance is denoted as P and the free parking Spaces are marked as .

2 Supposing that the shortest time shortest path set is , the corresponding weights (path distance) is , the set is initialized to null and the weights is initialized to ;

3 While not all the elements in the set enter the set do

4 Select , is the end point of the shortest path from the current car ;

5 Update the weight of the shortest path from car to , indicates the path distance between node and node .

6 End while

7 Output the final weights of all empty parking nodes in the empty parking space set , and the berth corresponding to is the optimal berth.

8 The path corresponding to is the optimal path from the car M to the optimal P_{i .}