 Research
 Open Access
 Published:
Optimized combination model and algorithm of parking guidance information configuration
EURASIP Journal on Wireless Communications and Networking volume 2011, Article number: 104 (2011)
Abstract
Operators of parking guidance and information (PGI) systems often have difficulty in providing the best car park availability information to drivers in periods of high demand. A new PGI configuration model based on the optimized combination method was proposed by analyzing of parking choice behavior. This article first describes a parking choice behavioral model incorporating drivers perceptions of waiting times at car parks based on PGI signs. This model was used to predict the influence of PGI signs on the overall performance of the traffic system. Then relationships were developed for estimating the arrival rates at car parks based on driver characteristics, car park attributes as well as the car park availability information displayed on PGI signs. A mathematical program was formulated to determine the optimal display PGI sign configuration to minimize total travel time. A genetic algorithm was used to identify solutions that significantly reduced queue lengths and total travel time compared with existing practices. These procedures were applied to an existing PGI system operating in Deqing Town and Xiuning City. Significant reductions in total travel time of parking vehicles with PGI being configured. This would reduce traffic congestion and lead to various environmental benefits.
1. Introduction
Intelligent transportation systems (ITS) can significantly alleviate the problems of congestion, pollution, and accidents within an urban centre, by releasing the realtime traffic information to drivers. Parking guidance information system (PGIS) is one of ITS applications, which displays the information about the direction to and availability of parking spaces to reduce the time finding available spaces as well as the queuing time during peak period relying on the variable message signs (VMS) [1–4]. Recent advances in the development of wireless vehicular networks have become a cornerstone of ITS. Security is a fundamental issue for vehicular networks since without security protection ITS communication does not work properly [5, 6]. For large parking lots, through Wireless sensor networks and vehicular communication, a new smart parking scheme were proposed for providing the drivers with realtime parking navigation service, intelligent antitheft protection, and friendly parking information dissemination [7–10].
In most large cities in China, parking guidance sign boards have been set for displaying parking information. Parking guidance signs, as a method of mass guidance strategy, can display the name, parking space occupancy, and driving direction to car parks for drivers. But whether the car park information leads to better effect, and how to depict the best car park availability information to drivers are still under research in China [11, 12].
In the recent researches and applications of PGIS around the world, it is commonly used to display the same parking information for vehicles coming from different directions. Although this method can truly reflect the utilization of the parking spaces in the monitored areas, there still exists a problem that the drivers coming from different directions are likely to behave all the same with each other [13–15]. So how to determine the best availability status to display on the signs is becoming a common problem. This particularly relates to periods where demand levels are approaching capacity. Since signs are generally located some distance from car parks, PGI system operators must determine when to display FULL for car parks before their utilization has reached capacity.
2. System analyses
When there is no parking guidance system, the driver would select the parking spaces based on his own demand and judgment. If it comes to the popular parking spaces within the urban area, drivers are likely to make the similar decisions. This situation will lead the parking demand to exceed the parking capacity. Meanwhile, too many vehicles searching for parking spaces will cause traffic congestion in peak time.
The temporal utilization of car parks is influenced by the arrival and departure rates of vehicles. Drivers' choice behavior is influenced by driver characteristics as well as the attributes of car parks and PGI signs. The optimized model of PGIS configuration is based on the real parking supply and demand conditions to display optimized parking information on VMS to influence the performance of parking system in central city. Figure 1 describes how the total travel time of vehicles is estimated based on the drivers' parking choice behavior and predicted arrival rates at car parks.
Since the optimized model of PGIS configuration considers the parking choice behavior, the following assumptions were made to provide simplistic representation of the model.

(1)
All the parking spaces are offstreet.

(2)
There is no illegal parking.

(3)
If the drivers observe the PGI sign board, they will make their parking choice at the location of the sign boards.
3. Parking choice behavior model
From the perspective of Microeconomics, the parking space chosen is determined by the impedance of the parking spaces. The drivers will always choose the parking space with the lowest impedance, which is related to the consumed time and cost [11, 16–18]. The time consumed includes trip time T_{m}, waiting time T_{w}, and access time T_{a}. The cost is mainly the parking fee p. The total parking utility U is calculated as
where α, β, γ, μ, τ are all utility parameters. T_{m} is the time consumed for the invehicle traveling from the location of VMS to the parking space. T_{w} is the queuing time before entering the park. T_{a} is the walk time from the parking set to the destination. p(t) is related to the parking price and the expected parking duration.
The length from the location of VMS to the parking space is the nearest network distance. The average speed is related to the road impedance function and can be calculated by the BPR function proposed by the U.S. Federal Highway Administration [14]. The trip time is calculated as
where L_{m} is the distance from the location of VMS to the parking space, km; ν_{m} is the average speed of the vehicle, km/h; q_{i} road traffic flow, pcu/h; C_{i} is the road capability, pcu/h; ν_{0} is the freeflow speed, km/h; ω_{i}, φ_{i} are all model parameters; i = 1, 2 stands for motor vehicles and nonmotor vehicles.
The access time refers to the walk time from the parking space to the destination. It can be calculated based on the average distance from the parking space to the activity spot and the average walk speed can be calculated by
where l_{a} is the distance from the parking to the activity spot, km; ν_{a} is the average walk speed, km/h.
Though there are various possibilities for parking behavior, it is always expected to choose the best (with the lowest impedance) parking space. From the view of drivers, under the normal condition of parking areas, the parking spaces with certain location, convenient service, short distance to the destination and acceptable waiting time are likely to attract more vehicles [19, 20]. A constant perceived waiting time is assumed at car parks for drivers observing the PGI signs displaying car parks to be unavailable. Drivers not observing the PGI signs are also assumed to perceive a constant waiting time at car parks having a high utilization (e.g., above 95%). These drivers are having information regarding the actual utilization of car parks.
Thus, assuming that a set of drivers selecting parking space j in zone k from the location VMS i, the parking choice model of having observing PGI signs can be constructed as
where P_{ ijk } is the probability to select parking space j from location i to destination zone k with having observing PGI signs; U_{ ijk } (T_{m}, T_{w}, T_{a}, p) is the utility function of parking space j, %; θ is a scale parameter. Here,
S_{ t } is the start of time interval t and S_{t+1}is the start of time interval t + 1, where C is the perceived waiting time at car park (min).
The parking choice model of having not observing PGI signs can be constructed as,
where ${P}_{ijk}^{0}$ is the probability to select parking space j from location i to destination zone with having not observing PGI signs. Here,
where U_{ j } is the utility of car park j at time D_{ l } (%), F the nonobservers utility threshold (%), and D_{ l } is the time that the PGI display configuration for interval l is determined.
4. Parking arrivals dynamic estimation
The model developed here assumes that the availability status of car parks displayed on the PGI signs is constant for small time intervals (e.g., 5 or 10 min). The arrival of vehicles at car parks must be predicted for three separate periods (Figure 2).
During the first period, the arrival rate in park j is constant and equals to the existing rate experienced when the display configuration was determined. Assume drivers make decision at the time D_{ l }, reach the PGI sign i at the time S_{ l }, This rate is assumed to continue until vehicles begin arriving at car parks after observing the new configuration that has been determined. This involves determining the minimum travel time from signs to car parks.
For the second period, from the time S_{ l } + min{t_{ ij }}, the arrival rate is dually influenced by the last display configuration and the determined one because of the different travel times from the signs to car parks in the network, till the time S_{ i } + max{t_{ ij }}.
For the third period, from the time S_{ i } + max{t_{ ij }} to S_{l+1}+ min{t_{ ij }}, the arrival rate at parking lot j is only influenced by the current dispay configuration. This period terminates when it is possible for vehicles to arrive at a car park after observing the next display configuration after the one to be determined.
where r_{ j }(t) is the arrival rate of park j, x = 1,2,3...,I, P(Y) the probability observed PGI sign board and P(N) is the probability did not observe PGI sign board and ${t}_{ij}^{x}$ is sequenced from lesser to greater, x = 1,2,...,I. q_{ ij } is the parking flow rate from deciding node i to park j.
Therefore, the total amount of arriving parking vehicles can be calculated as:
5. Parking guidance model
To implicate the parking guidance configuration strategies, an objective function should be determined and a mathematical optimized model should be constructed. Comparing to the conventional parking without the parking guidance, the advantage of parking guidance can be shown clearly as following. The origin of the model is to get the shortest vehicle kilometers of travel (time) in urban area to get to the first choice parking space. Usually, the total travel time T is easy to get and it can represent the meaning of vehicle kilometers of travel [21]. Thus, T is regarded as the decision variable in this article. For parking space j, the objective function can be built as follow:
where T_{m} is the time consumed from location i to parking space j for vehicle m, min; R_{ j }(l) is the total amount of vehicles of park j coming from location i to destination zone k in time l, veh/h; l is the time interval of the status displayed on VMS, min.
The realtime utilization of parking spaces can be divided into 'F' (Full) and 'E' (Empty) where 'F' represents the parking space is full and 'E' represents the parking space is still available as well as the number of parking sets available displayed on the VMS. Considering Equations 810, we can find that the objective function T is influenced by P_{ ijk } directly and can influence the parking choice through the status displayed on VMS. Its nature is to get the optimized value of objective function through the configuration of the status displayed on VMS. For the status displayed on VMS in each display interval, the following 'configuration optimization method' is proposed to demonstrate how it works.
When j parking spaces are available, I signs display 'F' or 'E' randomly. The same parking space would have different status in different zone. Thus, the final optimization results obtained through continuous iterative calculation based on the method. The constrained conditions are as follows:
where δ_{ ijk } is a Boolean variable which represents the utilization of parking space j in zone k from sign i. τ_{ ijk } is the utilization of car park. σ_{ j } is the threshold.
Based on this method, the availability status displayed on each VMS can be determined by Equations 10 and 11 instantaneously.
6. Model algorithm
If each PGI sign board displays the availability status of all parking spaces in this system, there will be 2^{IJ} possible status combinations for each interval. Because of the large amount of possible display configurations and the complexity of the relationships, an accuracy solution procedure cannot be applied. Thus, an algorithm with a faster convergence speed and more accurate result is very necessary.
Genetic algorithm (GA) is a selforganized and adoptive artificial intelligent (AI) technology based on the simulation of Darwin's Biological Evolution Theory and Mendel's Genetic Variation/Mutation Theory. It can be classified as the configuration search and optimization method. From the eyes of overall optimization, GA does not need to calculate the partial derivative; neither does it need the continuity and differentiability of the optimized objects. Compared to the former two, every step in GA makes full use of available status to guide the search procedure, in order to pass on the good information to the offspring as well as to eliminate the bad information. Besides, GA allows more than one current result during the search time, to obtain good robustness. It can not only enhance the optimization level on numerical results but also get the approximate linear acceleration effect [22, 23]. Thus, GA can find the optimized result in a reasonable time.
As GA works based on probability while the parking choice probability is influenced by the saturation of parking spaces, according to Equation 11, the availability status displayed on VMS during a specified time interval are coded as the chromosome:
where [l/J] is an integer less than or equal to l/J.
Based on standard genetic algorithm (SGA) and 'configuration optimization method', procedures of mortified SGA are implemented;

1.
Coding: Binary coding is the simplest coding method. Since δ_{m} in Equation 12 has two values, 0 or 1, the binary coding is possible. It can make Gene Icon with low rank, short length, and high fitness to generate more offspring. This method speeds up the convergence and agrees with the principle of GA.
Since GA cannot address the spatial solution set data, the chromosome variables δ_{m} is first coded as binaries to make them the genetic string structure data in genetic space. When coding, more than one variable can be code, or all variables can be coded into one chromosome to make each variable as a part of the chromosome. To make the article compact and the presentation easy, we code j parking spaces in zone k as I chromosomes based on the entrance number just like what Figure 3 shows. Each chromosome is a data string composed by 1 and 0.

2.
Generate initial solution set: Based on the characteristics of GA, for the fixed m(m = 1,2,...,IJ) VMSs' status, H = 2^{IJ} initial solution sets are determined randomly, then N = H initial population can be obtained. In the model, N is determined by the number of parking spaces in the certain zone and the accuracy of solution.

3.
Determination of fitness function and calculation of individual fitness: This model aims at the shortest total travel time in certain zone. The fitness function is the objective function in Equation 10.
The constrained conditions are given in Equation 11. Put N initial populations into Equation 10 and the related fitness can be get.
During the calculation, the binary coded individual should be decoded as the decimal form in the search space. For example, 10100 should be decoded as 20.

4.
Population's selection and duplication: In order to select good individuals from the N = H initial populations, the probability method which is direct proportional to the individual fitness is adopted. The detail procedures are as follows;
○ Optimize the initial population for N times, get the individual fitness f_{ i } = min (T_{ i }) (I = 1,2,...,N).
○ Calculate out the sum of all the individual fitness $S={\sum}_{i=1}^{N}f$.
○ Calculate out the percentage of the value of the individual is fitness in S.
○ Based on the aim to get the shortest total travel time, the order of selection probability P_{ i } as the reverse order of f_{ i }/S is determined, which means the one with the lowest fitness will get the highest probability to be selected out.
○ Based on the selection probability and the number of population, the duplication is conducted, which means when δ_{ j } (j = 1,2,...,m)s selection probability is P_{ j }, N × P_{ j } individuals from duplication can be get. The population with large selection probability will get more choice to be duplicated and those with small selection probability would be eliminated. Because of duplication, the populations in mating pool reduce the average travel time in certain zone. However, no new chromosome is given birth to, leaving the fitness of the best individuals in the population unchanged.

5.
Crossover: The detail procedures of crossover are as follows:
○ Pair the δ_{ j }(j = 1,2,...,m) in the population where there are N = m individuals randomly.
○ Identify the crossover probability P_{c}, standing for the percentage of individuals which involves into crossover. For example, if P_{c} = 0.5, then half of the population are paired and the information is exchanged. The larger P_{c} is the fast the exchanges are and more possible the good individuals are produced, the fast the speed of convergence is.
○ Decide the crossover location in the paired individuals. The paired ones exchange part of the binary information, leaving other parts unchanged. Two new individuals are produced by crossover. Figure 4 shows how singlepoint crossover works.
Mutation:
For mutation, the larger P_{m} is, the more possible the good individuals are produced. However, algorithm convergence would be ineffective; if P_{m} is too small, then the variation ability would be bad, which could make the initial population become a same population too early. The value empirically in the suggested range can be selected.

6.
Termination: Take the mutated population into step (3) to calculate out the minimum fitness of total travel time in certain zone. Whether the algorithm should be terminated is determined by the principles set above. There are two conditions in which the algorithm can be terminated.
For the fixed m, if there exist an individual δ_{ j }(1 < j ≤ H) which makes min (T) < min (T_{ini}), then make min (T_{ini}) = min (T), repeat the selection, crossover and mutation to conduct the iteration.
The number of offspring has exceeded the minimum times of iteration M set before.
7. Model application
7.1. Example 1
Most cities in China are on the beginning stage of PGIS. This article takes parts of the urban area of Deqing in Zhejiang Province as one example to simulate PGIS. The sketch map and the division of a certain parking zone are showed in the Figure 5. Through the analysis of the popular car park 1, the effects of the optimized model of PGIS configuration can be tested.
In this example, l = 10 min and the average parking duration of all the vehicles is 1 h. The parking spaces, with the same parking fee for 3 yuan/h, have the capacity of 100. Take the saturation threshold τ_{111} = τ_{333} = τ_{444} = 80%. Because of the good location, the parking space 1 in zone 1 has the largest attraction for the vehicles, with a saturation of above 90% in peak period. q_{ ij }s value can be determined by Table 1.
Take I = J = K = 4, then N = H = 2^{4 × 4}, which means on the 4 VMSs at the entrance in urban area, there exists 2^{16} combinations of status for 4 parking spaces. As the initial population contains the possible maximum combinations, it can guarantee the accuracy. Setting P_{c} = 0.6, P_{m} = 0.005, M = 5000. The result is shown in Table 2.
Based on the table above, it can be concluded that the total travel time is reduced largely when the proposed PGIS is applied, which indicates that total effect of PGIS is better than the condition without PGIS, as is shown in Figure 6.
Min T appears when there are high τ_{111}(95 to 100%) and they are above the threshold. In this case, because of the status displayed on the VMS, parts of the drivers do not choose parking space 1 but choose other proper parking spaces, resulting in less vehicles in parking space 1, optimizing the total travel time. After proposed PGIS are applied, under the condition of high saturation of popular parking spaces, the utility of available parking sets can be improved and the parking source can be made full use of.
7.2. Example 2
Example 2 is also used to investigate the operational performance of the PGI system for Xiuning City, a regional centre approximately 50 km south of Huangshan Mountain. The existing PGI system, which was built in 2010, provides availability information for offstreet 4 car parks (Figure 7). Onstreet parking is not permitted within the city centre.
Traffic count data from peak period as well as landuse pattern information are used to estimate an origin and destination matrix. High volumes are observed entering the city centre from links with PGI signs S_{1}, S_{2}, and S_{4}. Due to the railway station, high proportion traffic is estimated to have its final destination in zone Z3, with moderate level of demand for zones Z1, Z2, and Z4. All car parks except P3 had approximately 70% utilization at the time at which the configuration of signs for the next display interval is determined. All car parks in Xiuning City are offstreet with the same fee structure for shortterm parking. Estimates of in vehicle travel times and walking times are based on the location of the car parks, traffic, and pedestrian links within the city centre (Figure 7). Each choice parker is assumed to have the same parking duration of 1 h.
According to the field survey and computation results, the optimization model is able to identify PGI display configurations that substantially reduce the total travel time. The total travel time is estimated to be 36.6 and 59.8 h where the utilization threshold was below and above this level, respectively, which lead to a maximum reduction of approximately 41% (Table 3).
8. Conclusion
This article described procedures that were developed for investigating the effect of PGI sign boards on parking choice behavior. An optimized model was able to distribute the exceeding parking demand into proper parking spaces. Through guiding the drivers to choose the proper parking spaces instead of popular ones, the total travel time can be reduced. In this model, some simplify assumptions would perhaps overestimate the effect of PGI sign board on parking choice behavior. In particular, if the observers were not assumed to believe the PGI sign board, the potential of PGIS to influence and manage traffic movement as well as parking choices would be reduced. A similar reduced effect would occur if any illegal parking was considered.
Abbreviations
 AI:

artificial intelligent
 GA:

genetic algorithm
 ITS:

intelligent transportation systems
 PGI:

parking guidance and information
 PGIS:

parking guidance information system
 SGA:

standard genetic algorithm
 VMS:

variable message signs.
References
 1.
Asakura Y, Kashiwadani M: Evaluation of availability information service by parking choice simulation model. In Proceedings of the International Conference on Advanced Technologies in Transportation and Traffic Management. Centre for Transportation Studies, Nanyang Technological University, Singapore; 1994:335342.
 2.
Polak J, Hilton I, Axhausen K, Young W: Parking guidance and information systems: performance and capability. Traffic Eng Control 1990, 31(10):519524.
 3.
Thompson R, Richardson A: A parking search model. Transport Res A 1998, 32: 159170.
 4.
Caicedo F: Gestión de aparcamientos subterráneos. In Edicions. UPC, Barcelona; 2005.
 5.
Lee JH, Chen J, Ernst T: Securing mobile network prefix provisioning for NEMO based vehicular networks. Math Comput Modell 2011, in press.
 6.
Choi H, Kim I, Yoo J: Secure and efficient protocol for vehicular ad hoc network with privacy preservation. EURASIP J Wirel Commun Netw 2011, 114.
 7.
Chinrungrueng J, Sunantachaikul U, Triamlumlerd S: Smart parking: an application of optical wireless sensor network. Proceedings of the the 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), Hiroshima, Japan 2007, 6669.
 8.
Lu R, Lin X, Zhu H, Shen X: SPARK: a new VANETbased smart parking scheme for large parking lots. In The 28th IEEE International Conference on Computer Communications (INFOCOM 2009). Rio de Janeiro, Brazil; 2009:1925.
 9.
Bi Y, Sun L, Zhu H, Yan T, Luo Z: A parking management system based on wireless sensor network. Acta Automat Sin 2006, 32(6):968977.
 10.
Lee S, Dukhee Y, Amitabha G: Intelligent parking lot application usingwireless sensor networks. Proceedings of CTS, Irvine, CA, USA 2008, 4958.
 11.
Mei Z, Xiang Y, Chen J, Wang W: Optimizing model of curb parking pricing based on parking choice behavior. J Transport Syst Eng Inf Technol 2010, 10: 99104.
 12.
Zhang B, Yan K, Zhou X: Optimization of selecting PGI sign locations based on parking guidance behavior survey. International Conference on Transportation Engineering, Proceedings of the First International Conference, Chengdu, China 2007, 3439.
 13.
Thompson R, Takada K, Kobayakawa S: Optimization of parking guidance and information systems display configurations. Transport Res C 2001, 9: 16985.
 14.
Yan H, Yang X, Yan B: Parking choice model study for special events. China J Highway Transport 2005, 18: 9093.
 15.
Caicedo F: The use of space availability information in PARC systems to reduce search times in parking facilities. Transport Res C 2009, 17: 5668. 10.1016/j.trc.2008.07.001
 16.
Tsamboulas D: Parking fare thresholds: a policy tool. Transport Policy 2001, 8: 115124. 10.1016/S0967070X(00)000408
 17.
Shoup D: The High Cost of Free Parking. American Planning Association, Chicago; 2005.
 18.
Marshall W, Garrick N: Parking at mixeduse centers in small cities. Transportation Research Record 2006, 164171.
 19.
Oppenlander J: Optimal location and sizing of parking facilities. ITE Compendium of Technical Papers 1988, 1: 46.
 20.
Shoup D: The trouble with minimum parking requirements. Transport Res A 1999, 33: 549574.
 21.
Rye T, Hunton K, Ison S, Kocak N: The role of market research and consultation in developing parking policy. Transport Policy 2008, 15: 387394. 10.1016/j.tranpol.2008.12.005
 22.
Zhou M, Sun S: The Theory and Application Of Genetic Algorithm. National Defence and Industry Press, Beijing; 2009.
 23.
Clement S, Anderson J: Traffic signal timing determination. Proceedings of the Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, Conf. Publ. No. 446, IEE, London, UK 1997, 6368.
Acknowledgments
The work is supported by the National Natural Science Foundation of China (no.50908205) and the National Hightech Research and Development Program (863 Program) (no.2011AA110304).
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Mei, Z., Tian, Y. Optimized combination model and algorithm of parking guidance information configuration. J Wireless Com Network 2011, 104 (2011). https://doi.org/10.1186/168714992011104
Received:
Accepted:
Published:
Keywords
 parking guidance information
 parking choice
 optimized display model
 genetic algorithm