# Agent-Based Modelling and Simulation to Assess the Impact of Parking Reservation System

Authors: Xun-You Ni; Daniel (Jian) Sun
Journal: Journal of Advanced Transportation
 (2017)

---

## Abstract

With the increasing popularity of smart phones, Parking Reservation System (PRS) becomes practical to reduce the travel time in cruising for vacant spaces. The aim of this study is to assess the impact of PRS explicitly. This paper was started with analyzing the processes of cruising for vacant spaces and making parking reservation decisions. The vehicles were divided into two categories: the intelligent vehicles and the regular ones. Only the intelligent vehicles have the ability to make a parking reservation beforehand, while the regular ones have to cruise for vacant spaces. All involved components were treated as different agents, including vehicles, parking lots, network, and management center. Based on this, agent-based simulation was introduced to evaluate the performances of the scenarios with different penetration rates. The simulation results indicate the average travel time increases with the improvement of the penetration rates for the regular vehicles. The assessment method presented in this study would assist in promoting the performances of PRS in urban areas.


---

## Body

## 1. Introduction

The shortage of parking spaces is one of the major ignored transportation issues in urban areas [1, 2], mainly because the situation gained less attention than the roadway planning at early periods [3]. Taking facility capacities and competition behavior into account [4, 5], drivers may find no vacant spaces when arriving at the target parking lot. Parking Guidance and Information System (PGIS) is a useful tool to assist drivers to identify the parking lot with vacant spaces [6, 7]. Based on the commonly used display terminal Variable Message Sign (VMS), PGIS releases the same parking information to all drivers that passed by [8], which generally induces many vehicles to compete for the limited spaces. When the last vacant space in the target parking lot was occupied, the rest of the drivers have to divert to the alternative ones. In recent years, with the rapid development of intelligent in-vehicle terminals (e.g., smart phones), drivers can receive real-time information and even reserve a parking space in advance [9]. With the real-time information, traffic congestions and parking problems could be both alleviated [10, 11]. Parking Reservation System (PRS) enables drivers to reserve a parking space beforehand. As a result, drivers can directly head to the reserved parking lot [12] and the travel time in cruising for vacant spaces decreases accordingly [13].To investigate the responding strategies of the reservation requests, Teodorović and Lučić [14] proposed an inventory control system to maximize the parking revenue. An integer programming approach was adopted to determine the optimal strategies under different vehicle arrival patterns. By introducing a parking space management center to handle all reservation requests, a model was proposed to minimize the total user costs [15]. The cost function was formulated as a weight sum of walking distance and monetary cost for using parking spaces. The reservation rule is that drivers who are satisfied with the assignment results can reserve the parking space; otherwise, they have to wait until the next allocation point. Based on the analysis of the interactions among the parking lot, the central server, and the vehicular drivers, an algorithm of appropriately assigning the parking spaces was proposed [16]. The results indicate the parking lots were utilized efficiently and the traffic congestions were alleviated. Unfortunately, the existing research mainly focused on replying to the reservation requests, seldom presenting the simulation steps explicitly. Consequently, it is critical to investigate the reservation process and provide a practical analysis tool.Agent-based simulation is suitable to model the activities of participants in Intelligent Transportation Systems (ITS) [17] and describe drivers’ responses to the parking information [18]. With the real-time information, agent-based simulation was used to replicate drivers’ behavior [19], in which drivers’ preferences and the impact of the information influencing the route selection were reflected. To describe the behavior of each driver within a spatial environment, Benenson et al. [20] implemented the agent-based simulation as an ArcGIS application. The application can explicitly simulate the entire parking process, including entering into parking zone, driving towards the destination, cruising for vacant spaces, and departing from the network. Moreover, based on the agent-based simulation package MATsim, cruising for vacant spaces according to the parking lot properties was discussed [21]. As for the parking reservation, Sana et al. [22] defined five types of agents: vehicle, traffic, global traffic, parking, and station, and the last one takes charging of preventing the reserved spaces from being illegally occupied. However, the simulation was also not illustrated explicitly. This paper tries to assess the impact of PRS by introducing agent-based simulation to describe the drivers’ responses to the parking information, as well as the processes of cruising for vacant spaces and making parking reservation decisions dynamically.The remainder of this paper is structured as follows. Section2 analyzes the processes of cruising for vacant spaces and making parking reservation decisions. In Section 3, all involved components were treated as different agents, including vehicles, parking lots, network, and management center. Agent-based simulation was introduced to describe the processes of cruising for vacant spaces and making parking reservation decisions. Section 4 takes Xujiahui CBD, Shanghai, China, as a numerical example to illustrate the proposed assessment algorithm. Finally, conclusions and recommendations for future work are provided in Section 5.


## 2. Processes of Cruising for Vacant Spaces and Making Parking Reservation Decisions

Parking choice behavior is one of the hot issues for parking research, and the related theories and methods considering the real-time information are constantly enriched and perfected [23]. The rules of choosing parking lots are varied, as drivers prefer to choose the parking lot with vacant spaces [24] while the parking lot status changes with time, and consequently drivers often have to cruise for vacant spaces [25]. With the assistance of PRS, the vehicles configured with smart phones can send a reservation request and probably avoid the cruising process. The vehicles were divided into two categories: the intelligent vehicles and the regular ones. Only the intelligent vehicles have the ability to make a parking reservation decision, while the regular ones have to cruise for vacant spaces. Processes of cruising for vacant spaces and making parking reservation decisions are analyzed in Sections 2.1 and 2.2.


### 2.1. Cruising for Vacant Spaces

Without the assistance of PRS, the cruising process is presented in Figure1.Figure 1
Process of cruising for vacant spaces.Figure1 presents the process of cruising for vacant spaces. In general, drivers who enter into the parking zone should make a parking choice decision. The rule of making parking choice decisions is based on whether the target parking lot is still desirable. If the target parking lot is desirable, drivers insist on selecting the target parking lot; otherwise, a parking choice is reconducted to minimize the parking disutility. By integrating a perceived waiting time, the parking disutility was calculated as follows [26]:(1)μijk=a1tij+a2dj+a3fjT+a4wjk,whereμijkis the parking disutility travelling from intersectioni, selecting parking lotj, with destinationk,tijis the travel time from intersection i to parking lotj,djis the perceived waiting time at parking lotj,fjis the fee charged at parking lotj,Tis the value of time,wjkis the walking time from parking lot j to destinationk, anda1,  a2,  a3, and a4 denote the relative important weighting coefficients of travel time, waiting time, fee charged, and walking time.Moreover, the perceived waiting time was calculated as follows:(2)dj=D,if parking lot status is full0,otherwise,whereD denotes the perceived waiting time at the parking lot without vacant spaces.For each vehicle, the comparison between the alternative parking lot and the target one is carried out to assist the parking choice decision-making. The alternative parking lot superior to the target one is expressed as(3)μijk<μij∗k,whereμij∗kis the parking disutility travelling from intersectioni, insisting on the target parking lotj∗, with destinationk.To describe driving towards the target parking lot, the spatial position is updated on the network. The updated algorithm is set as follows: if the vehicle arrives at an intersection, select the shortest route leading to the target parking lot and access the next link on the route. The shortest route is selected according to the Dijkstra algorithm [27]. If the vehicle is on a road link, move forwards according to the link average speed. The vehicular position is defined as the distance travelling from the upstream intersection. Moreover, if the distance is larger than the link length, the vehicular position is set equal to 0, which indicates the vehicle has reached the downstream intersection. If the vehicle arrives at the target parking lot and acquires a vacant space, the cruising process ends; otherwise, the driver has to make another parking choice decision and continue cruising for vacant spaces.


### 2.2. Making Parking Reservation Decisions

For the intelligent vehicles, the reservation process is comparably simplified, as shown in Figure2.Figure 2
Process of making parking reservation decisions.Figure2 presents the process of making parking reservation decisions. Drivers who enter into the parking zone should make a parking choice decision according to the rule mentioned and send a reservation request. The superior rule is further defined as the alternative parking lot with smaller parking disutility except for the following condition: the target parking lot was reserved but the alternative one has no vacant spaces. If the target parking lot becomes undesirable, drivers make a parking choice decision to minimize the parking disutility and send a new reservation request; otherwise, they insist on selecting the target parking lot. The responding rule of the reservation requests is defined as follows: if the status of the target parking lot is available, the request is accepted; otherwise, it is rejected [28]. Then, they drive towards the target parking lot according to the updated algorithm. If drivers arrive at the target parking lot, they would directly park their vehicles; otherwise, the reservation process continues.


## 2.1. Cruising for Vacant Spaces

Without the assistance of PRS, the cruising process is presented in Figure1.Figure 1
Process of cruising for vacant spaces.Figure1 presents the process of cruising for vacant spaces. In general, drivers who enter into the parking zone should make a parking choice decision. The rule of making parking choice decisions is based on whether the target parking lot is still desirable. If the target parking lot is desirable, drivers insist on selecting the target parking lot; otherwise, a parking choice is reconducted to minimize the parking disutility. By integrating a perceived waiting time, the parking disutility was calculated as follows [26]:(1)μijk=a1tij+a2dj+a3fjT+a4wjk,whereμijkis the parking disutility travelling from intersectioni, selecting parking lotj, with destinationk,tijis the travel time from intersection i to parking lotj,djis the perceived waiting time at parking lotj,fjis the fee charged at parking lotj,Tis the value of time,wjkis the walking time from parking lot j to destinationk, anda1,  a2,  a3, and a4 denote the relative important weighting coefficients of travel time, waiting time, fee charged, and walking time.Moreover, the perceived waiting time was calculated as follows:(2)dj=D,if parking lot status is full0,otherwise,whereD denotes the perceived waiting time at the parking lot without vacant spaces.For each vehicle, the comparison between the alternative parking lot and the target one is carried out to assist the parking choice decision-making. The alternative parking lot superior to the target one is expressed as(3)μijk<μij∗k,whereμij∗kis the parking disutility travelling from intersectioni, insisting on the target parking lotj∗, with destinationk.To describe driving towards the target parking lot, the spatial position is updated on the network. The updated algorithm is set as follows: if the vehicle arrives at an intersection, select the shortest route leading to the target parking lot and access the next link on the route. The shortest route is selected according to the Dijkstra algorithm [27]. If the vehicle is on a road link, move forwards according to the link average speed. The vehicular position is defined as the distance travelling from the upstream intersection. Moreover, if the distance is larger than the link length, the vehicular position is set equal to 0, which indicates the vehicle has reached the downstream intersection. If the vehicle arrives at the target parking lot and acquires a vacant space, the cruising process ends; otherwise, the driver has to make another parking choice decision and continue cruising for vacant spaces.


## 2.2. Making Parking Reservation Decisions

For the intelligent vehicles, the reservation process is comparably simplified, as shown in Figure2.Figure 2
Process of making parking reservation decisions.Figure2 presents the process of making parking reservation decisions. Drivers who enter into the parking zone should make a parking choice decision according to the rule mentioned and send a reservation request. The superior rule is further defined as the alternative parking lot with smaller parking disutility except for the following condition: the target parking lot was reserved but the alternative one has no vacant spaces. If the target parking lot becomes undesirable, drivers make a parking choice decision to minimize the parking disutility and send a new reservation request; otherwise, they insist on selecting the target parking lot. The responding rule of the reservation requests is defined as follows: if the status of the target parking lot is available, the request is accepted; otherwise, it is rejected [28]. Then, they drive towards the target parking lot according to the updated algorithm. If drivers arrive at the target parking lot, they would directly park their vehicles; otherwise, the reservation process continues.


## 3. Agent-Based Simulation Model

Since drivers prefer to select the parking lot with vacant spaces and the parking lot status changes with time, it is essential to describe the processes of cruising for vacant spaces and making parking reservation decisions dynamically. Agent-based simulation modelled drivers’ behavior by treating each vehicle as an autonomous agent, which is extensible according to the actual project demands. With the assistance of the agent-based simulation, this paper focuses on evaluating the performances of the scenarios with different penetration rates. Additionally, the penetration rate is the ratio of the intelligent vehicles that are able to make parking reservation decisions.


### 3.1. Agent Design

To implement the agent-based simulation, agents which describe the activities of participants have to be designed. For instance, the intelligent vehicles receive real-time information and send the reservation requests via smart phones, while the regular ones have to cruise for vacant spaces. The parking and traffic information mainly includes the parking lot status and the link average speed, while the remaining information is static. Management center takes charge of replying to the reservation requests. All the involved components were treated as different agents, including vehicles, parking lots, network, and management center, as follows.


#### 3.1.1. Vehicle Agent

Each vehicle is treated as an autonomous agent with six attributes: origin, destination, an intelligent flag indicating whether the vehicle is an intelligent one, target parking lot, entering time, and departing time. As for the attributes, the first three are static while the rest are the dynamic ones. Moreover, the first three are known for each vehicle and the rest are updated according to the simulation conditions. The vehicle agents move forwards on the road network individually. When entering into the parking zone, the vehicular attributes are initialized. Then, the vehicles are loaded on the network and travel along the route leading to the target parking lot. If arriving at the downstream intersection, the vehicle would access the next link directly connected.


#### 3.1.2. Parking Lot Agent

The parking lot agent also includes two types of attributes: the static and the dynamic ones. The static attributes include name, location, capacity, and fare charged for each parking lot, while the dynamic one is mainly the parking lot status. If no vacant spaces within the specified parking lot, the status becomes FULL; otherwise, the status is available.


#### 3.1.3. Network Agent

Road network was treated as network agent, mainly consisting of eight attributes: link length, link lanes, link density, link free-flow speed, link minimal speed, link average speed, intersection position, and the connecting relationships between the links and the intersections. The link density and the average speed change with time, while the remaining attributes are static, and the link density is defined as the number of vehicles within one unit length of the link, which can be used to determine the link average speed.


#### 3.1.4. Management Center Agent

Management center agent is responsible for handling the reservation requests and updating the reservation list. To reserve at least one space in the reserved parking lot and prevent the reserved spaces being illegally occupied, the rules of attaching/detaching operations are defined as follows: if the reservation requests were accepted, attach the vehicles to the reserved parking lot; otherwise, drivers make a parking choice decision according to the rule discussed. When the intelligent vehicles arrive at the reserved parking lot, they have to be detached from the parking lot. The attaching/detaching operations form the reservation list, which denotes the reservation relationships of the intelligent vehicles and the reserved parking lots at the simulation iterations. In the reservation list, the spaces are named as the reserved ones.


### 3.2. Agent-Based Simulation Framework

In the simulation environment, only vehicle agents move dynamically. The possible states of the vehicle agents are entering into the parking zone, cruising for vacant spaces or making parking reservation decisions, heading to the target parking lot, and departing from the network. By incorporating the agent design and the processes of cruising for vacant spaces and making parking reservation decisions, the agent-based simulation is illustrated in Figure3.Figure 3
Framework of the agent-based simulation.The overall process of the simulation is summarized as follows.Step 0 (initialization). Set the link flow, the link density, the total travel time, and the total walking time equal to 0. Then, initialize the current iteration to 1 second, the link travel time to the free-flow travel time, and the number of vacant spaces in the parking lots to the capacities. Additionally, the interval iteration is set as 1 second.Step 1. Update the parking lot status and traffic conditions. Parking lot agent, management center agent, and network agent take charge of updating the parking lot status, the reservation list, and the traffic conditions.(a)
Update the parking lot status. The number of vacant spaces is computed as follows:(4)qj=max⁡qj∗-ρj-hj+ωj,0,whereρjis the number of the reserved spaces in parking lotj,hjis the number of vehicles arriving at parking lotj,ωjis the number of vehicles departing from parking lotj, andqjandqj∗are the number of vacant spaces in parking lot j at current and previous iterations, respectively.The parking lot status is updated according to the number of vacant spaces. If there are no vacant spaces in the parking lot, the status becomes FULL; otherwise, the status is available.(b)
Update the traffic conditions. The link density is calculated as follows:(5)ga=xaηaLa,wheregais the vehicular density on link a,  xa is the traffic flow on link a,  ηa is the number of lanes of link a, and La is the length of link a.To capture the link average speed varying with the density, Li et al. [29] proposed a traffic flow model as follows:(6)va=vaf,ga≤gabva0+vaf-va01-ga-gabgaj-gabγ,gab<ga≤gaj,wherevais the average speed on link a,  va0 is the minimal speed on link a,  vaf is the free-flow speed on link a,  gab is the density breakpoint on link a,  gaj is the jam density on link a, and γ is the parameter.(c)
Update the reservation list according to the attaching/detaching operations (as discussed in Section3.1).Step 2. Vehicles enter into the parking zone. The origin, the destination, and the intelligent flag are known for each vehicle. If the vehicle is an intelligent one, initialize the intelligent flag equal to 1; otherwise, the value is 0. Then, load the vehicles on the network and set the attribute entering time equal to the current time.Step 3. Examine whether the vehicles arrive at the target parking lot. For each intelligent vehicle, if drivers arrive at the reserved parking lot, their vehicles would be directly parked and detached from the parking lot. For each regular one, if drivers obtain a vacant space, the cruising process ends. Then, the departing time is set equal to the current time and the parked vehicles are removed from the network. The total travel time is calculated as follows:(7)T=T∗+T2-T1,whereTandT∗are the total travel time at the current and previous iterations andT1andT2are the entering time and departing time for the vehicle, respectively.The total walking distance is computed as follows:(8)W=W∗+Γjk,whereΓjkis the walking distance from the target parking lot j to destination k for the vehicle andWandW∗are the total walking distance at current and previous iterations, respectively.Step 4. Make parking choice decisions according to the rule discussed in Sections 2.1 and 2.2. Additionally, if an alternative parking lot is reserved, the vehicle should be detached from the target parking lot and attached to the alternative one.Step 5. Drive towards the target parking lot according to the update algorithm, as presented in Section 2.1.Step 6 (stop criteria). If all the parking lots are unavailable, stop and export the performances; otherwise, continue the simulation and go to Step 1. The performances are indicated by two indicators: average travel time and average walking distance. Travel time is one of the major indicators to assess the traffic conditions in the congested urban areas, and walking distance determines the reasonability of the parking guidance scenarios. For the parked vehicles, the average travel time is the total travel time divided by the number of vehicles. Similarly, the average travel distance is computed.


## 3.1. Agent Design

To implement the agent-based simulation, agents which describe the activities of participants have to be designed. For instance, the intelligent vehicles receive real-time information and send the reservation requests via smart phones, while the regular ones have to cruise for vacant spaces. The parking and traffic information mainly includes the parking lot status and the link average speed, while the remaining information is static. Management center takes charge of replying to the reservation requests. All the involved components were treated as different agents, including vehicles, parking lots, network, and management center, as follows.


### 3.1.1. Vehicle Agent

Each vehicle is treated as an autonomous agent with six attributes: origin, destination, an intelligent flag indicating whether the vehicle is an intelligent one, target parking lot, entering time, and departing time. As for the attributes, the first three are static while the rest are the dynamic ones. Moreover, the first three are known for each vehicle and the rest are updated according to the simulation conditions. The vehicle agents move forwards on the road network individually. When entering into the parking zone, the vehicular attributes are initialized. Then, the vehicles are loaded on the network and travel along the route leading to the target parking lot. If arriving at the downstream intersection, the vehicle would access the next link directly connected.


### 3.1.2. Parking Lot Agent

The parking lot agent also includes two types of attributes: the static and the dynamic ones. The static attributes include name, location, capacity, and fare charged for each parking lot, while the dynamic one is mainly the parking lot status. If no vacant spaces within the specified parking lot, the status becomes FULL; otherwise, the status is available.


### 3.1.3. Network Agent

Road network was treated as network agent, mainly consisting of eight attributes: link length, link lanes, link density, link free-flow speed, link minimal speed, link average speed, intersection position, and the connecting relationships between the links and the intersections. The link density and the average speed change with time, while the remaining attributes are static, and the link density is defined as the number of vehicles within one unit length of the link, which can be used to determine the link average speed.


### 3.1.4. Management Center Agent

Management center agent is responsible for handling the reservation requests and updating the reservation list. To reserve at least one space in the reserved parking lot and prevent the reserved spaces being illegally occupied, the rules of attaching/detaching operations are defined as follows: if the reservation requests were accepted, attach the vehicles to the reserved parking lot; otherwise, drivers make a parking choice decision according to the rule discussed. When the intelligent vehicles arrive at the reserved parking lot, they have to be detached from the parking lot. The attaching/detaching operations form the reservation list, which denotes the reservation relationships of the intelligent vehicles and the reserved parking lots at the simulation iterations. In the reservation list, the spaces are named as the reserved ones.


## 3.1.1. Vehicle Agent

Each vehicle is treated as an autonomous agent with six attributes: origin, destination, an intelligent flag indicating whether the vehicle is an intelligent one, target parking lot, entering time, and departing time. As for the attributes, the first three are static while the rest are the dynamic ones. Moreover, the first three are known for each vehicle and the rest are updated according to the simulation conditions. The vehicle agents move forwards on the road network individually. When entering into the parking zone, the vehicular attributes are initialized. Then, the vehicles are loaded on the network and travel along the route leading to the target parking lot. If arriving at the downstream intersection, the vehicle would access the next link directly connected.


## 3.1.2. Parking Lot Agent

The parking lot agent also includes two types of attributes: the static and the dynamic ones. The static attributes include name, location, capacity, and fare charged for each parking lot, while the dynamic one is mainly the parking lot status. If no vacant spaces within the specified parking lot, the status becomes FULL; otherwise, the status is available.


## 3.1.3. Network Agent

Road network was treated as network agent, mainly consisting of eight attributes: link length, link lanes, link density, link free-flow speed, link minimal speed, link average speed, intersection position, and the connecting relationships between the links and the intersections. The link density and the average speed change with time, while the remaining attributes are static, and the link density is defined as the number of vehicles within one unit length of the link, which can be used to determine the link average speed.


## 3.1.4. Management Center Agent

Management center agent is responsible for handling the reservation requests and updating the reservation list. To reserve at least one space in the reserved parking lot and prevent the reserved spaces being illegally occupied, the rules of attaching/detaching operations are defined as follows: if the reservation requests were accepted, attach the vehicles to the reserved parking lot; otherwise, drivers make a parking choice decision according to the rule discussed. When the intelligent vehicles arrive at the reserved parking lot, they have to be detached from the parking lot. The attaching/detaching operations form the reservation list, which denotes the reservation relationships of the intelligent vehicles and the reserved parking lots at the simulation iterations. In the reservation list, the spaces are named as the reserved ones.


## 3.2. Agent-Based Simulation Framework

In the simulation environment, only vehicle agents move dynamically. The possible states of the vehicle agents are entering into the parking zone, cruising for vacant spaces or making parking reservation decisions, heading to the target parking lot, and departing from the network. By incorporating the agent design and the processes of cruising for vacant spaces and making parking reservation decisions, the agent-based simulation is illustrated in Figure3.Figure 3
Framework of the agent-based simulation.The overall process of the simulation is summarized as follows.Step 0 (initialization). Set the link flow, the link density, the total travel time, and the total walking time equal to 0. Then, initialize the current iteration to 1 second, the link travel time to the free-flow travel time, and the number of vacant spaces in the parking lots to the capacities. Additionally, the interval iteration is set as 1 second.Step 1. Update the parking lot status and traffic conditions. Parking lot agent, management center agent, and network agent take charge of updating the parking lot status, the reservation list, and the traffic conditions.(a)
Update the parking lot status. The number of vacant spaces is computed as follows:(4)qj=max⁡qj∗-ρj-hj+ωj,0,whereρjis the number of the reserved spaces in parking lotj,hjis the number of vehicles arriving at parking lotj,ωjis the number of vehicles departing from parking lotj, andqjandqj∗are the number of vacant spaces in parking lot j at current and previous iterations, respectively.The parking lot status is updated according to the number of vacant spaces. If there are no vacant spaces in the parking lot, the status becomes FULL; otherwise, the status is available.(b)
Update the traffic conditions. The link density is calculated as follows:(5)ga=xaηaLa,wheregais the vehicular density on link a,  xa is the traffic flow on link a,  ηa is the number of lanes of link a, and La is the length of link a.To capture the link average speed varying with the density, Li et al. [29] proposed a traffic flow model as follows:(6)va=vaf,ga≤gabva0+vaf-va01-ga-gabgaj-gabγ,gab<ga≤gaj,wherevais the average speed on link a,  va0 is the minimal speed on link a,  vaf is the free-flow speed on link a,  gab is the density breakpoint on link a,  gaj is the jam density on link a, and γ is the parameter.(c)
Update the reservation list according to the attaching/detaching operations (as discussed in Section3.1).Step 2. Vehicles enter into the parking zone. The origin, the destination, and the intelligent flag are known for each vehicle. If the vehicle is an intelligent one, initialize the intelligent flag equal to 1; otherwise, the value is 0. Then, load the vehicles on the network and set the attribute entering time equal to the current time.Step 3. Examine whether the vehicles arrive at the target parking lot. For each intelligent vehicle, if drivers arrive at the reserved parking lot, their vehicles would be directly parked and detached from the parking lot. For each regular one, if drivers obtain a vacant space, the cruising process ends. Then, the departing time is set equal to the current time and the parked vehicles are removed from the network. The total travel time is calculated as follows:(7)T=T∗+T2-T1,whereTandT∗are the total travel time at the current and previous iterations andT1andT2are the entering time and departing time for the vehicle, respectively.The total walking distance is computed as follows:(8)W=W∗+Γjk,whereΓjkis the walking distance from the target parking lot j to destination k for the vehicle andWandW∗are the total walking distance at current and previous iterations, respectively.Step 4. Make parking choice decisions according to the rule discussed in Sections 2.1 and 2.2. Additionally, if an alternative parking lot is reserved, the vehicle should be detached from the target parking lot and attached to the alternative one.Step 5. Drive towards the target parking lot according to the update algorithm, as presented in Section 2.1.Step 6 (stop criteria). If all the parking lots are unavailable, stop and export the performances; otherwise, continue the simulation and go to Step 1. The performances are indicated by two indicators: average travel time and average walking distance. Travel time is one of the major indicators to assess the traffic conditions in the congested urban areas, and walking distance determines the reasonability of the parking guidance scenarios. For the parked vehicles, the average travel time is the total travel time divided by the number of vehicles. Similarly, the average travel distance is computed.


## 4. Numerical Example

Xujiahui CBD, Shanghai, China, was built in the 1990s, providing the comprehensive commercial services, such as shopping, entertainment, and business. The core area starts from Yishan Rd in the west and ends at Wanping Rd and starts from Guangyuan Rd in the north and ends at Lingling Rd. It covers 4.04 square kilometers, with the radius is around 1000 meters, and the center locates at an intersection intersected by five roads: Huashan Rd, Hongqiao Rd, North Caoxi Rd, Zhaojiabang Rd, and Hengshan Rd. Location and layout of Xujiahui CBD are presented in Figure4.Figure 4
Location and layout of Xujiahui CBD, Shanghai, China.Figure5 presents the network of Xujiahui CBD, consisting of 101 nodes, 159 road links, 5 origins (from 1 to 5), 2 destinations (from 6 to 7), and 6 major parking lots (from 8 to 13), with 2768 parking spaces in total. Labels along the links are the lengths, with unit meter. Parking demands have 10 Origin-Destination (OD) pairs. For simplification, the arrival rate for each OD pair was assumed as 2 vehicles per minute and the departing ratio for each parking lot was set as 0.5 vehicles per minute. The bold lines denote the arterials, and the ordinary lines are the branches. Capacities and fees charged for the parking lots were obtained and are presented in Table 1.Table 1
Capacities and fees charged for the parking lots.
Parking lot index
Capacity
Fee (RMB/h)
8
1260
10
9
500
9
10
191
15
11
333
10
12
250
15
13
234
10Figure 5
Network of Xujiahui CBD, Shanghai, China.As for the penetration rates, five typical scenarios were evaluated as 0.2, 0.4, 0.6, 0.8, and 1.0. The scenario with penetration rate 0.2 was named as Scenario 1, and the remaining scenarios were denoted as Scenario 2, Scenario 3, Scenario 4, and Scenario 5 in sequence. By implementing the agent-based simulation to evaluate the five scenarios, the number of the reserved spaces was obtained and is shown in Figure6.Figure 6
Number of the reserved spaces with the scenarios, (a) Scenario 1, (b) Scenario 2, (c) Scenario 3, (d) Scenario 4, and (e) Scenario 5.
(a)
(b)
(c)
(d)
(e)For all the scenarios, the number of the reserved spaces increases when the target parking lot has vacant spaces and decreases under the condition that the majority of the intelligent vehicles arrive at the target parking lot. Between the trends rise and decline, most intelligent vehicles are heading to the target parking lot with the status FULL. At the stage, the indicator reaches the maximum value. Moreover, the fluctuations indicate the intelligent vehicles are able to change the reservation decisions and reserve the alternative parking lot. It is obvious that P8 and P10 are the most popular parking lots, while the remaining parking lots are comparably less utilized.The parking demands served by each parking lot are shown in Table2.Table 2
Parking demands served by each parking lot.
Scenario
Vehicle type
⁢Parking lot index
8
9
10
11
12
13
1
Intelligent
278
71
109
9
7
107
Regular
1055
462
153
210
275
157
2
Intelligent
548
184
154
43
81
150
Regular
785
350
108
174
201
115
3
Intelligent
816
292
196
87
162
188
Regular
517
243
67
127
120
78
4
Intelligent
1078
397
232
149
232
229
Regular
255
137
31
67
50
37
5
Intelligent
1333
533
263
216
284
267The performances of PRS are presented in Figures7 and 8. Figure 7 presents the average travel time with the scenarios. For the regular vehicles, the average travel time increases with the improvement of the penetration rates. For the intelligent ones, the indicators are roughly equal. That is, too many intelligent vehicles reserve the desirable parking lots in advance, which does harm on the regular vehicles. Moreover, the average travel time for the regular vehicles is larger than the value for the intelligent vehicles, owing to the process of cruising for vacant spaces.Figure 7
Average travel time with the scenarios.Figure 8
Average walking distance with the scenarios.The average walking distances were obtained and are shown in Figure8. With the increasing of the penetration rates, no large difference occurs in the average walking distance for the scenarios. For the intelligent vehicles and the regular ones, the maximum growth values of the indicator are 44.68 meters and 20.10 meters, respectively. Consequently, it may be acceptable for drivers in the congested urban areas.


## 5. Conclusions

With the wide ownership and usage of smart phones, PRS becomes practical to reduce the travel time in cruising for vacant spaces. This paper assesses the impact of PRS by introducing agent-based simulation to model the drivers’ responses to the parking information, as well as the processes of cruising for vacant spaces and making parking reservation decisions dynamically. The involved functionality components were treated as different agents, including vehicles, parking lots, network, and management center. Conclusions are drawn as follows:(i)
To describe the vehicles moving on the network dynamically, the processes of cruising for vacant spaces and making parking reservation decisions were analyzed. Vehicles were divided into two categories: the intelligent vehicles and the regular ones. Only the intelligent vehicles have the ability to make a parking reservation decision, while the regular ones have to cruise for vacant spaces.(ii)
Agent-based simulation was introduced to describe the processes of cruising for vacant spaces and making reservation decisions dynamically. Of all involved components, only the vehicle agents can move dynamically.(iii)
To reserve at least one space in the reserved parking lot, the rules of attaching/detaching were defined. If the reservation requests were accepted, the vehicles are attached to the reserved parking lot; otherwise, drivers make a parking choice decision according to the rule discussed. Moreover, if the intelligent vehicles arrive at the target parking lot, they have to be detached from the parking lot.The simulation results indicate the average travel time increases with the improvement of the penetration rates for the regular vehicles. While the results are promising, further studies may be conducted to improve the performances of the proposed method. As a foundation of cruising for vacant spaces and making parking reservation decisions is the parking disutility function, it is critical to adjust the parameters to describe the processes accurately. Moreover, the parameters of the traffic flow model used in this study may be further investigated. With large amount of field data, agent-based simulation may be studied to evaluate the performances of PRS more practically. Further studies may implement the proposed algorithm in a real environment, and then the performances with more traffic data can be assessed.



---

*Source: 2576094-2017-07-05.xml*