Analysis of Urban Rail Transit Station Planning Combining Simulated Annealing Algorithm

. As a crucial node in the network system of urban transportation infrastructure, the consistent planning of the urban rail transit stations scientiﬁcally and reasonably is of highly signiﬁcant importance to have a thorough understanding of the functional area division of a city and assess the improvement of facilities correlated with the rail transit infrastructure. In this study, the simulated annealing algorithm (SAA) is applied to the data analysis of the rail transit stations in a city. The method for the analysis of the urban rail transit stations combined with the SAA can achieve the dimensionality reduction in high-dimensional data information and the assessment of the similarity in traﬃc rail transits eﬀectively. Finally, through in-depth analysis of the daily passenger ﬂow features and the spatial location distribution of each type of station, a valuable reference can be obtained for the planning and design of urban rail transit stations.


Introduction
Rail transit stations are the critical nodes of the most fundamental road transportation network systems in urban rail transit. With the full extension of many urban rail transits in China, rail transit has gradually occupied an increasingly significant position in urban transportation. Scientific and reasonable planning of rail connection stations is of highly significant importance to have a thorough understanding of the division of the functional areas in a city, know the travel habits of urban residents, master the urban spatial pattern and evolution process, and evaluate the urban rail transit infrastructure effectively. From the perspective of the features of urban rail lines, the tough problem of unbalanced passenger flow between urban areas can be resolved effectively through the application of urban rail transit station planning, and the quality of passenger services can be guaranteed as well. e studies on urban rail transit station planning and optimization station to save the travel time of passengers effectively are of vital significance [1][2][3]. According to the case analysis of website planning, the operation mode of the train is formulated according to the operation conditions and driving route of the train [4]. On the premise of the shortest time required for direct passenger travel, the optimization model of train operation plan is studied [5]. Under the condition that the train schedule is unchanged, taking full consideration of several constraints such as the topological structure of the road network, a parking method combining fast and slow trains is proposed [6]. In the urban rail transit station planning mode, based on the detailed analysis of passenger travel costs, a bi-objective hybrid nonlinear programming model is built [7] .
As an important part of national road infrastructure, the urban rail transit network plays an important role and value in promoting people to travel and convenient travel. On the other hand, as the artery of urban development, the planning and construction of urban rail transit network must be comprehensively considered in combination with the scale of the city, the distribution of functional areas, and the actual travel needs of residents. erefore, in the process of planning and construction, the characteristics of urban rail transit lines must be comprehensively considered and analyzed to avoid the imbalance of passenger flow temporal and spatial distribution, average ride distance, and other indicators. Based on the characteristics of urban rail transit lines, realizing the linkage of multiple transportation modes and constructing a reasonable line stop scheme and operation frequency will help to maximize the social and economic benefits of urban rail transit lines.
Scientific and reasonable urban rail transit station planning is inseparable from the effective prediction of passenger flow, as well as the research support of urban public transport station spacing and urban rail transit station location. Firstly, the research on rail transit passenger flow prediction mainly focuses on the influence of price mechanism, departure time, and other factors, as well as the station accessibility analysis based on spatial model. Secondly, the research on urban public transport station spacing mainly focuses on the analysis and optimization of rail transit station spacing, for example, the analysis of influencing factors based on a double-layer optimization model. In addition, the research on the location of urban rail transit stations mainly focuses on several factors such as pipeline positioning and operation cost and uses diagnostic models to confirm the optimal location.
With the continuous advances of science and technology, the techniques of mining and visualization based on the simulated annealing algorithm (SAA) have also been developed rapidly. e simulated annealing algorithm is applied in many fields such as urban space, urban hierarchical systems, and spatial and temporal activities of residents. In this study, the traffic data of Japanese tourists using IC cards on rail stations in a certain city for three consecutive months were analyzed, which covered 195 complete data source websites. e IC card inbound and outbound data are used to establish a time series of card data to study the problems in the planning of the rail transit stations.

Station Optimization Model Based on the
Simulated Annealing Algorithm e stop scheme for urban rail transit trains is analyzed, similar to that of the stop scheme for rail transit trains. e transfer method between trains is developed without considering the passengers and the trains with different speeds. e difference in the running time of the train is mainly dependent on the effect of the rail stop stations, including the initial departure time, the stop time, and the waiting time.
e trains are only running and stopping at the set stations, and each station has its respective operating conditions. e formulation and consideration of parking scheme in rail transit train are jointly determined by multiple factors, and the actual parking scheme formulated for this purpose is also in different forms. Among them, the scheme of crossstation parking can effectively reduce the operation time of rail trains, but this scheme also has significant disadvantages, mainly in that the waiting time of passengers at the station is difficult to control. Secondly, based on the centripetality and tidal passenger flow of passengers, a targeted rail transit parking scheme is formulated, which can optimize the travel time of passengers. In addition, based on the integer programming model, analyzing the dynamic changes in rail train operation cost can significantly improve the economy of rail train operation. Generally speaking, the parking scheme in rail transit trains is to achieve an effective balance between passenger flow distribution, convenient transfer, and operation cost. e length of travel time of passengers is a crucial index to measure the service level of urban rail transit. Hence, the method for minimizing the travel time of passengers is an essential goal of optimizing the train stop schemes [8,9]. e travel time of passengers includes the waiting time and the movement time of the passengers. Since the travel time of the passengers is fixed, and the corresponding price is the same based on the scheme, the passenger travel time is not discussed in this study.
As an important part of urban rail transit station planning, the optimization of passenger travel time is an important means to improve passenger travel experience, travel convenience, and reduce travel cost. Generally speaking, the length of passenger travel time is often directly related to the number of stations. Dense stations will greatly reduce the travel cost of passengers, but will bring significant growth in station construction cost, especially in operation and maintenance cost. erefore, the optimization of passenger travel time needs to comprehensively consider the influence of various factors, especially the cost of the operator. e optimization of passenger travel time needs to establish the upper-and lower-level models of operation and travel, comprehensively consider the optimization of passenger travel time and the cost of the operator, define the sum of the two as the comprehensive transportation cost of urban rail transit, and establish the optimization model based on passenger convenient travel.
Taking the urban rail transit station planning model into consideration, whether there are rail transit trains at each station in the route and whether each station of rail transit stops are different. Hence, passengers have different choices of trains that they can take based on the section where the departure point is located, and the waiting time of the passengers is different accordingly. Since the train has the overtaking possibility, the waiting time of passengers taking the train at the initial departure station will also be increased accordingly. In comparison, the route operation section can be divided into two parts: the noncollinear operation section of the rail transit and the rail transit section (as shown in Figure 1).
Based on the location of the departure point of passengers, the model for calculating the waiting time of passengers is developed as follows: In the above equation, t w,i is the waiting time of passengers at different starting points; Q i,j is the passenger flow from station i to station j; t is the length of the research period; n is the number of stations on the whole line; f 1 , f 2 , and f 3 indicate the stop time of trains corresponding to the rail transit and the stops at each station during the morning rush hours. x f,e , x f,1 , and x s,1 stand for the time point when passengers take the rail transit train, respectively. When the passengers take a rail transit train x f,e , the value of 1 is taken; the value taken under deceleration is x f,1 , and the value of 1 is taken; the value taken for the rest is 0. e value taken under acceleration when passengers take a rail transit train is x s,1 , and the value of 1 is taken; the value taken for the rest is 0. When passengers take a rail transit train, the value taken for x f,1 and x s,1 is 1, and the value taken for the rest is 0. When passengers take any train, the value taken for all the aforesaid three is 1.

e Model of Stop and Departure Cases
(1) Starting point i is a train in a non-co-line section of rail transit; that is, passengers take a rail transit train. (2) Starting station i is a stop in the non-co-line operation section of rail transit, and terminal j is the train of the corresponding section; that is, passengers take the rail transit train. e terminal j is the train station in the corresponding section. (3) Starting station i is a station with a relatively small operation interval in the rail transit line. Terminal j is a train station in a rail transit section. Terminal j is a late train station in the non-co-line rail transit interval; that is to say, passengers take a rail transit train. (4) e starting station i is a common rail transit stop: the terminal j is a train in a rail transit section, where passengers can take rail transit trains with a higher capacity. Terminal j is an express station in the rail transit section, where passengers can take all trains available. e terminal station j is a station with a relatively slow rail transit in the non-co-line operation section, which indicates that passengers can take a rail transit train. Terminal j is a train station in a non-co-line section of the rail transit; that is, passengers can take a rail transit train.

Total Waiting Time of Passengers at
Stops. e total waiting time of passengers for the train is mainly composed of two parts. e first part is the regular stop time experienced by passengers when they travel by training running at different speeds. e second part is the other possible waiting time of passengers when they take the train during their trip, as shown in Figure 2.
e waiting time of passengers from getting on the train from station i and getting off the train at station j is as follows: In the above equation: t k,1 and t k,2 indicate the train stop time at the kth station and the kth station in turn. s k is the variable ranging from 0 to 1. In the case of emergency stops, the value of 1 is taken; otherwise, the value of 0 is taken. c k indicates the variable ranging from 0 to 1. In the case when the train takes shelter shunt, the value of 1 is taken; otherwise, the value of 0 is taken.
Based on the above analysis, the objective function with the minimum total travel time Z can be established as follows: f ≥ 12, (8) Equations (6) and (7) can ensure that all types of trains in a certain time period will be operated at least once. In the case that the other conditions remain unchanged, it is stipulated in the construction standard for the urban rail transit projects that the train operation should not be less than 12 h during peak hours. Hence, equation (8)  that when the number of trains is a, the trains on each traffic route should meet the requirements of the full load rate η max in the section.

Specific Calculation
Steps of the Genetic Algorithm. In the simulated annealing algorithm put forward in this study, the optimization model for the departure scheme of urban rail transit line trains is a monocular nonlinear planning model. e specific steps for the calculation in the genetic algorithm are described as follows: (1) e parameters of several variables should be determined, including initial temperature and population number, variation, and difference. Chromosomes that meet the constraints are established. (2) Encode and decode, and use binary to encode. en, the initial population is formed by randomly obtaining the feasible solution. e chromosome genes are encoded using a binary encoding method in the form of 110110101, one of which stands for a stop station, and so on.
(3) In addition, the objective function is processed by determining the fitness function, and the weight coefficient is established. e initial generation is randomized. e number of the first group should be selected in a reasonable and scientific manner. e fitness of each chromosome is calculated. Adaptability is the only index that can reflect the superiority and inferiority of chromosomes, and the genetic algorithm is to identify the most adaptable chromosomes.
In the above equation: F(x) indicates the fitness function established; M indicates the maximum value estimated based on the model; and Z(x) indicates objective function. (4) e duplication, crossover, and mutation operators are used to prepare the individuals at the child nodes. e aforesaid three operators are the basic operators of the genetic algorithm, where replication has indicated the natural law of superiority and inferiority, the crossover has indicated the concept of sexual reproduction, and mutation has indicated the mutation of genetic factors in the evolutionary process.

Data Description.
Based on the data from the Rail Transit Bureau, there are 74,516,289 complete trips (including card settlement records for complete admission and exit stations) in the city from March 1 to 20, 2018, without major special festivals, and there are a total of 209 at rail stations. For the purpose of ensuring the accuracy and quality of the data, the acquired data are processed, and the stations with incomplete settlement records of inbound and outbound cards are removed [10,11]. e essential data information contained in the records is shown in Table 1.

Symbolic Representation.
Based on the SAA, the length m in a random time period is converted into the length n (n ≪ m). e code line n is the number of segmented subsequences. According to the time series thus obtained, the process of the SAA algorithm can mainly be divided into 3 steps as follows: (1) e time series X of the normalized source is standardized based on equation (1) into a series with the mean value of 0 and the square difference of 1. e standardization will not change the shape or scale of the original sequence X.
In the above equation: observation value corresponding to variable X i at a certain time x i ; u x stands for the mean value of all observations in the sequence X; σ x stands for the standard deviation of all observations in the sequence X. (2) e PAA method is applied, where the subsequence length w and the length m time series are divided into sequences with the length of n. In addition, the mean value of each layer subsequence is calculated based on equation X � x 1 , x 2 , . . . , x n (13) as follows: (3) As the code display sequence is similar to the Gaussian distribution, it is divided into equal intervals based on probability. e values for the division points of the distinguishing interval series are taken according to Table 2 and are denoted by the sequence∼value∼ the same symbol located in the same interval. Finally, the code demonstration is obtained.

Similarity Measurement Method.
For any two time series Q � q 1 , q 2 , . . . , q m and C � c 1 , c 2 , . . . , c m with the time-series length of m, the SAA method is adopted to set the coding sequence representation of length n as the sum. For the purpose of simulating the annealing of a symbol sequence, firstly, it is necessary to calculate the similarity between various symbol sequences. Based on the SAA method, equation (3) is used to calculate the distance between the sequences and to indicate the similarity between them, which stands for the distance between two symbols.

Case Design and Calculation.
It is assumed that there is a railway line with 13 stations. During a certain period, the passenger flow between stations on this line 0-D is shown in Table 1. e train will stop at the two stations to meet the demand of all passengers. According to the operating parameters of subway trains [12,13], the starting acceleration of the train is 0379 m/s2, the braking deceleration speed is 140 m/s2, the maximum running speed is 85 km/h, the departure interval is h � 2.6 min, h AB � 2.25 min, h (A/B) � 5 min, the stopping time is 0.5 min, and the number of repetitions is 500. e above parameters are introduced into the model, Pentium 4 3.2 Hz, and 1000M RAM computer. e Tabu search algorithm is programmed and executed based on the VC+ platform, and the A and B train stop scheme that saves the most travel time for passengers is obtained. e optimization results of the train A and train B stop scheme are shown in Table 2.
According to the data in Table 2, train A and train B are required to stop at the same time at the second and ninth stations in addition to stopping at the initial departure station. ey should also stop at the other stations according to the optimal scheme. In addition, under the conditions that the parameters and O-D passenger flow are known, the total travel time of passengers can be saved to 253.6 minutes when the train stops at intersections based on the method described above. e results of the calculation indicate that under the given parameter conditions, the span stop scheme is feasible.

Parking Scheme of Other Stations.
e determination of the parking scheme of other stations according to the best scheme also needs opportunities to shorten the travel time of passengers and reduce the operation cost of enterprises.
erefore, the mathematical model constraints of the established stop scheme are shown in the following equation: where T is the number of slow train departures in the optimization period, L is the passenger flow from station i to station k, and Zmin and Zmax are the minimum and maximum passenger capacity of the train, respectively. Under the above constraint model, the reference formulas for establishing the best parking scheme are shown in equations (16) and (17). Formula (16) is the function of the best parking scheme reflecting the interests of passengers, and formula (17) is the function of the best parking scheme reflecting the rail transit operation enterprise.
For the purpose of further verifying the convergence of the Tabu search algorithm, the length of each Tabu table is  6-9, and its effects on the algorithm calculation are compared, as shown in Figure 3. e curve in Figure 4 converges to the neighboring values of the function, which indicates that the Tabu search algorithm has superior robustness. If the Tabu length is 6, the function value obtained by most iterations is relatively small, the fluctuation is significant,  Number of people  on the bus  1 2  3  4  5  6  7  8  9  10 11  12  13  1  0 200 300 350 90 510 50 100 50 100 40  50  30  1870  2  0 0 400 300 80 510 200 300 50 230 50 300 90  2510  3  0 0  0 150 30  50  50 160 270  0  70  90  60  930  4  In this study, only the one-way stop scheme of the train is discussed. Hence, the triangle value in the 0-D table is set to 0.  and the convergence speed is slow. e length of the Tabu is 7 points, the convergence speed is 6 points earlier than the length of the Tabu, and the value of each function is relatively small apparently. ΔT � 254.3 min, when the length of the Tabu is 8, the function value converges to ΔT � 254.7 min, the change in the curve is mild, and the convergence speed is the highest. When the number of repetitions is 110 times, the function value converges. e length of the Tabu is 9, and the function value will converge to ΔT � 254.7 min. e number of iterations converges close to 120, and the speed of convergence is relatively slow. If the stability and convergence rate of the objective function in the iterative process are combined, the Tabu length is designed to be 8 in the given parameters, which is appropriate. e total waiting time of passengers is mainly composed of two parts. e comparison is shown in Figure 4. It can be seen from Figure 4 that the normal parking time that passengers on trains with different speeds can experience is significantly shorter than that of passengers who change trains during the journey.
is result is consistent with people's practical cognition, mainly because passengers need to spend more time in the process of transfer.

Analysis of Parameter Sensitivity.
In the model, the departure interval, stop time, and maximum operating speed of the trains are correlated with the saving in the travel time of all passengers. Different values are taken for each parameter to carry out sensitivity analysis of the objective function value. e results are shown in Figure 5.
From Figure 5, the following conclusions can be drawn: ( should be adjusted as appropriate based on the requirements of the schedule so as to achieve the purpose of optimizing the AT. (2) As indicated in Figure 5(c), if 20 s-60 s is selected for discussion, it has a linear and positive correlation with the stop time, and the change is significant. is suggests that for the purpose of increasing t s and also taking into consideration the safety of passengers who get on and off the train, it is necessary to increase t s as appropriate. However, if a substantial increase in t s is made, the waiting time of passengers at the stations will be extended, and their satisfaction with rail transit services will be reduced. Hence, it is necessary to make adjustments based on the number of passengers at the stations as appropriate. In general, the stop time at a Chinese urban rail transit station not in the peak period is 30 s. (3) From Figure 5(d), it can be observed that the maximum operating speed V max has a linear positive correlation with ΔT. However, the change is not significant, probably because it is subject to the influence of customer traffic. In addition, as V max is subject to restrictions on the performance and operating conditions of the vehicle itself, V max cannot be improved at will. Moreover, it is stipulated in the metro-vehicle design standard that the maximum operating speed should be 80 km/h [14,15]. However, for the purpose of increasing the maximum operating speed under the cross-station plan,  increasing the maximum operating speed to above 80 km/h will not only increase the cost significantly, but the increase in the operating costs is not meaningful for improving the operational efficiency.
To improve the robustness of the algorithm, it is necessary to further optimize the function model, mainly taking the minimum comprehensive station planning cost as the objective function to establish the optimization model of rail transit station location. Based on the basic characteristics of large correlation between station combination scheme and passenger flow, the station model is optimized to establish a positive correlation between passenger flow and target value. In addition, by associating the station model with the comprehensive cost model of individual passengers, a two-tier optimization model is constructed, which greatly improves the robustness and robustness of the algorithm.
To sum up, in the well-known O-D state, the changes in the departure intervals h AB and h A/B have a more significant impact than the other parameters, whereas the stop time t s and the maximum operating speed V max have a less significant impact on the changes in ΔT than the aforesaid two parameters. For the purpose of maximizing the value of the objective function, the operator can adjust the parameters described above under the condition of considering the operating costs and benefits comprehensively and give priority to the adjustment of the departure intervals h AB and h A/B . In addition, as the starting acceleration and braking deceleration are determined based on the features of the vehicle, it is unusual to adjust the parameters so that they can adapt to the operating modes of different trains.

Conclusions
As the feedback on the real-time and accurate data of the stations that the train stops is required for vehicles on the rail when they stop at the station, broadcasting or electronic information can be used at the stop stations to disseminate relevant data information to the driver and passengers so as to ensure that the passengers can get on the train in time. In this study, a reasonable method for the analysis of the urban rail transit station planning is established by evaluating multiple factors such as the random arrival of the passenger flow at the station, the distance between trains, and the passenger capacity comprehensively.

Data Availability
e data used to support the findings of this study are available upon request to the author.  Discrete Dynamics in Nature and Society 7