1. Introduction
Urban gated communities create a boundary separating the road system from the open community outside the walls or fences. The boundary walls on the boundary of living are quartered from each independent area. Though gated communities are attractive due to their lifestyle, elite and secure characteristics, they have heavy traffic congestion problems, especially in city center and at peak traffic times. The outside traffic flow cannot go through such communities, which seriously influences the traffic around them. The internal roads are not connected with the main roads of the outside traffic network. This reduces the density of the urban road network and the effective use of the residential roads which greatly increases the pressure on road access around the community.
Three typical internal road network types are square type, grid type, and inter-loop type networks. The inter-loop type has the highest density and multi-directional structure out of the three typical internal road networks. Therefore, based on the effects of the internal roads on the surrounding road capacity, the inter-loop type is most qualified to open, the grid type is the second choice, and the linear type is the last choice.
In order to evaluate the opening state of gated communities, it is necessary to analyze the mechanisms of traffic flow congestion at the boundary road networks accurately. Actually, there is no unified and fixed evaluation process for traffic operation degrees. Therefore, many studies or organizations accumulate a lot of real-time traffic flow information, such as volume, speed, journey time, and so on. The Washington State Transportation Department [
1] stated that the congestion evaluation degree is defined as the average peak travel time. The latest Highway Capacity Manual (HCM) [
2] used a level of service that was defined into six grades to evaluate road performance in the United States. However, it is perhaps not appropriate for the urban traffic state in China which has a specific road network structure. On the other hand, the trend entropy theory has become an important method for studying traffic flow. Shao et al. [
3] explored the principles and algorithm of the entropy-maximizing model (EM model) with gravitational prior probability. Yong et al. [
4] studied the entropy condition for the Lighthill–Whitham–Richards model of fractal traffic flow described by local fractional calculus. They also discussed the solutions of non-differentiability with graphs using the local fractional vibrational iteration method.
The traffic flow of a specific gated living quarter is characterized by its uniqueness, experience historical aspect, uncertainty, and complexity. Therefore, to address these shortcomings, historical specific traffic flow data should be studied sufficiently. Lozano et al. [
5] proposed a recognition algorithm for road congestion levels by analyzing real-time traffic flow data based on the K-means clustering analysis algorithm. Sun [
6] employed the fuzzy c-means (FCM) cluster analysis and fuzzy synthetic evaluation method to classify urban traffic into six different state classifications. However, it is difficult to obtain the quantitative evaluation results of traffic state. Antoniou et al. [
7] proposed an approach for local traffic flow state estimation and prediction based on data-driven computational approaches. It built a pre-existing modeling component in a methodologically novel way.
Researchers have taken a keen interest in exploring the problem of opening gated communities’ internal road systems. It has become to optimize the layout of the urban road network and to ease the increasingly serious traffic congestion. It leads to many problems, such as modification cost, noise pollution, safety, and so on. However, there has been little research on how to consider specific gated communities’ objectives and how to optimize open planning, which has become a realistic problem and urgently needs to be solved, thus motivating the present work. Further research remains to be conducted on the comprehensive strategies of gated community selection and opening. An outside road system analysis and influential factor evaluation of the traffic state at the boundaries around gated communities, which has the ability to decide the opening hours, is the objective of the present work.
In this paper, an overview of the framework and process of the comprehensive opening evaluation model is first described. Then, the methodology of traffic flow state identification and opening evaluation at the boundary is proposed. The evaluation standard for the specific gated community case by FCM clustering method is built. Finally, a case study based on a simulated gated community is carried out to demonstrate the performance and applicability of the proposed method.
2. Proposed Framework and Process of Comprehensive Opening Evaluation Model
There are several challenges in the analysis, selection, and evaluation of gated communities. Firstly, the qualified living quarter within a wide variety of boundary road structures needs to be analyzed. Secondly, it is necessary to accurately start the opening based on real-time evaluation. Thirdly, the uncertainty and complexity of traffic flow should be evaluated. Finally, it is important to obtain quantitative results of the opening state evaluation rather than qualitative results.
In the proposed framework, as shown in
Figure 1, firstly, the traffic state entropy values of the boundary road network and entropy production are calculated. Then, a new opening evaluation entropy model using the basic theory of thermodynamic traffic entropy is developed. The traffic flow data of the specific gated community is classified into five levels to determine the fuzzy standard of the opening state based on the FCM clustering method. At last, the comparison between the entropy value and standard is performed and discussed.
3. Evaluation of the Opening System at the Boundary Road Network
3.1. Variables of Interest at the Boundary Road Network
3.1.1. Free Flow Speed (uf)
A vehicle passes a certain section at the maximum speed without any interference. The corresponding density tends towards zero, and the traffic flow tends to zero.
3.1.2. Critical Speed (um)
When the flow volume increases gradually, the flow speed reaches the road capacity speed at
, and the corresponding density is called the critical density (
km). The traffic flow volume at this time is the maximum flow volume in the road section (
qm) [
6].
3.1.3. Jam Density (kj)
The jam density is defined as a density at which traffic flow tends towards zero-speed or the density at which vehicles queue. Meanwhile, the flow speed tends towards zero.
In this study, the following variables for the evaluation of the boundary road network were used to determine the threshold value of the opening entropy model.
3.2. Basic Traffic Flow Entropy Model at the Boundary Road Network
In an actual road traffic system, it is difficult to detect the traffic pressure increments and vehicle number increments in a unit of road per unit of time, but the traffic pressure increments and vehicle number increments between two states may be measured. Therefore, it is possible to define any one of the states as the initial state and to derive other state entropy values [
7,
8,
9,
10].
It is well known that entropy is used to describe the order or disorder of the system—the smaller the entropy value is, the more the system tends to be ordered. As
, the traffic road system has the highest degree of order which is defined as the initial state at this time. The other variables of the initial state are defined as the opening entropy,
and the density. Therefore, we may calculate the entropy of any specific state from the initial state. The basic entropy model is given as
where
P0 is the initial traffic flow press, and
x is the number of vehicles. Based on the initial state data (
and
) the basic entropy model is written as
By using above model, the opening entropy of any traffic flow state may be evaluated.
- 1.
Steady Traffic Flow State
When the traffic flow speed and density are unchanged with time, we define it as a steady traffic flow state. Additional, the traffic speed of the road section is considered to be the same within a short road section. Therefore, the number of input vehicles is equal to the number of output vehicles on the road section. Meanwhile, if the vehicle’s speed does not change, and the entire road section is in a steady state, then the entropy model of the steady traffic flow section is given as
The entropy value of steady traffic flow with speed u is obtained by
The congestion is also considered to be a kind of steady traffic flow state, in which the speed and density are also unchanged with time.
- 2.
Unsteady Traffic Flow State
If it is assumed that in a short period of time, the speed of the road section changes from u1 to u2, the entropy is generated as
The entropy rate in units of time is written as
3.3. Opening Evaluation Entropy Model
In order to visualize and evaluate the operation of the vehicle flow on the boundary of the gated communities, we introduce a new physical evaluation state as the opening state entropy, defined as . The study set the research object as a simulated boundary road system with the total length (L) being a road section. In the fixed length (L) road section, three critical state parameters are substituted into the basic entropy model. When vehicles are moving with free flow speed ( and k = 0), the local entropy rate is . At this moment, the traffic road system is steady and S = 0.
When vehicles are moving at the critical speed (, k = km), then
As the traffic flow density tends towards jam density (
,
k =
kf),
The opening evaluation entropy is defined in the range of 0–10. When vehicles are moving with free flow speed, i.e., , the opening evaluation entropy becomes the minimum value of 0. On the other hand, when u = 0, the opening evaluation entropy value is defined as the maximum value of 10.
Therefore, any u and k in a fixed length (L) of road, the road network opening entropy value is
Then, the opening evaluation entropy model is obtained as follows:
In addition, in order to determine the accurate time to open the inner road system of a gated community, the threshold value of the opening state in the entropy model should be defined. Here, we chose specific parameters’ values at the critical traffic state, For example, when vehicles are moving at a critical speed (, density k = km), the opening evaluation entropy value is . Then, we defined the threshold value of the opening state in the entropy model as . If , the boundary road networks is in correct order and the gated communities should be keep closed; if , the boundary road networks is in disorder, and the inter-road network should be open to the public to relieve the traffic jam.
3.4. FCM Clustering Analysis of Opening Traffic Data at Boundary
Clustering analyses identify the similarities and dissimilarities in data and classify data into groups based on similar characteristics. It can be used for large data analyses and divides multidimensional data into a specific number of classes.
In this paper, the fuzzy c-means (FCM) clustering algorithm was used to solve the threshold values of different traffic and opening states. The opening data and traffic flow at the boundary are continuously random, so it was necessary to build a clustering model to distinguish the opening state from others [
11,
12,
13,
14,
15,
16].
The modified FCM method was used to calculate the fuzzy range of each index. The input data, which is historic traffic flow data of the study gated community was defined as
where
m is the sample data number, and
n is the index number. The solution steps were as follows:
- Step 1.
Set initialization parameters. In this paper, the opening state data was classified into five different states: the smooth-close state (A), the stable-ready close state (B), the slow-open state(C), the congested-open state (D), and the very congested-open state (E). The cluster number was set to c = 5, the iterative stopping threshold was set to , and the exponential weight was set to t = 2.5. Choose the initial cluster centers , andomly from the . The iteration number was set to r = 0. Here, xij is the j-th sample, Ki is the i-th cluster center, and n is the number of evaluation indices.
- Step 2.
The membership matrix (
U(r)) was computed or updated. We set
as the distance between the
i-th cluster center (
Ki) for the
j-th sample. The matrix (
U(r)) was expressed by the following:
where
is the membership degree of the
j-th sample belonging to the
i-th cluster.
- Step 3.
The new cluster centers (
K(r+1)) were updated as follows:
- Step 4.
We set . If , in which the iterative stopping threshold , the algorithm was deemed to be finished, and the membership matrix (U) and the clustering center (K) were output. If , , we returned to Step 2.