A Balanced Algorithm for In-City Parking Allocation: A Case Study of Al Madinah City

View full-text article in PMC

. 2021 May 1;21(9):3148. doi: 10.3390/s21093148

Algorithm 1 Pseudo code of the Parking and routing algorithm.

1:
procedureInitialization
2:
Define the input variables
3:
Define the outputs: $a v a i l a b i l i t y$ , $c o n g e s t i o n$ , $d r i v i n g T i m e$ , $b e s t P a t h$ and $b e s t S p o t$
4:
Set the weights based on the case(= 1,2,3)
5:
Set the distances between all junctions and between the junctions and the parking lots
6:
Initialize arrival rate, departure rate, traffic intensity value
7:
Initialize congestion rates for all links, waiting time on the gates
8:
Initialize availability rate for all parking lots based on the capacity
9:
Set time slots to 5 (PR1, PR2, PR3, PR4 and PR5)
10:
Set the simulation time for each time slot
11:
Divide the simulation time into T’s
12:
Define the parking lots (P1, P2, P3, P4, P5 and P6)
13:
Define the cost of the parking lots
14:
Define the states of the transition matrix based on the available spots
15:
end procedure
16:
procedureTransitionMatrix( $p a r k i n g L o t, a r r i v a l s, d e p a r t u r e s$ )
17:
updates the empty spots in the parking lot
18:
update the ratio of the states in the matrix
19:
Return updated transition matrix
20:
end procedure
21:
procedureParkingRoutingAlgorithm
22:
Call Initialization procedure
23:
Specify the time slot or study the five slots
24:
for each $P R$ in $t i m e S l o t s$ do
25:
for each T in $s i m u l a t i o n T i m e$ do
26:
Generate arrivals based on the arrival rate and traffic intensity
27:
for each $a r r i v a l$ in $a r r i v a l s$ do
28:
Specify the starting point
29:
for each P in $p a r k i n g L o t s$ do
30:
Get all path from starting point to the parking lot
31:
Call TransitionMatrix procedure for finding the availability rates
32:
for each $P a t h$ in $P a t h s$ do
33:
Get the congestion rate, waiting time at the gates
34:
Get waiting time at the gate
35:
Get the distance to the parking lot and the cost
36:
end for
37:
Generate departures based on the departure rate of the parking lot
38:
end for
39:
Find the objective function for all paths to the parking lots
40:
Define the best path and the best spot for this arrival based on the objective function
41:
Update all input variables based on the best values
42:
Send the best values to the arrival and store them in the outputs
43:
end for
44:
end for
45:
end for
46:
end procedure