Research Article  Open Access
Tao Wu, Xi Chen, Yusong Yan, "Study of OnRamp PI Controller Based on Dural Group QPSO with Different Well Centers Algorithm", Mathematical Problems in Engineering, vol. 2015, Article ID 814871, 10 pages, 2015. https://doi.org/10.1155/2015/814871
Study of OnRamp PI Controller Based on Dural Group QPSO with Different Well Centers Algorithm
Abstract
A novel quantumbehaved particle swarm optimization (QPSO) algorithm, dualgroup QPSO with different well centers (DWCQPSO) algorithm, is proposed by constructing the masterslave subswarms. The new algorithm was applied in the parameter optimization of onramp traffic PI controller combining with nonlinear feedback theory. With the critical information contained in the searching space and results of the basic QPSO algorithm, this algorithm avoids the rapid disappearance of swarm diversity and enhances the global searching ability through collaboration between subswarms. Experiment results on an onramp traffic control simulation show that DWCQPSO can be well applied in the study of onramp traffic PI controller and the comparison results illustrate that DWCQPSO outperforms other evolutionary algorithms with enhancement in both adaptability and stability.
1. Introduction
Interference caused by intersection and convergence between different traffic flows at the traffic bottlenecks such as onramp not only seriously reduces the efficiency of freeway but also leads to a reduction of the entire traffic network efficiency. Onramp control is the most effective way to improve traffic condition of freeway. Therefore, it is necessary to study the traffic flow and develop effective traffic management and control measures on the basis of existing facilities at the onramp. With the development of computer technology, computational intelligence provides an effective method which can select the optimal control parameters for ramp traffic control strategy according to different conditions to solve the onramp traffic flow control problem. Now, the ant colony optimization (ACO) [1], particle swarm optimization (PSO) [2], artificial neural network (ANN) [3], cellular automata (CA) [4], and genetic algorithms (GA) [5, 6] have been used in onramp control.
Although the computational intelligence methods above have made some achievements on onramp traffic control, they still have the following limitations: firstly, the convergence rate of PSO, ACO, and GA is so slow as to result in premature convergence and low precision. Secondly, due to the fact that traffic flows have realtime and nonlinear characteristics, the existing models are not fast enough to respond to realtime information, thus having limited applications. To solve these problems, a novel quantumbehaved particle swarm optimization (QPSO) algorithm, the dualgroup QPSO with different well centers (DWCQPSO) algorithm, is proposed in this paper based on quantumbehaved particle swarm optimization (QPSO) algorithm. With the critical information contained in the searching space, DWCQPSO avoids the rapid disappearance of swarm diversity and enhances the global searching ability through collaboration between subswarms. Then the onramp traffic PI controller is designed based on DWCQPSO algorithm by optimizing the values of parameters and . Experiment results show that DWCQPSO algorithm can be applicable in the ramp traffic PI controller and the comparison results illustrate that DWCQPSO outperforms other evolutionary algorithms with enhancement in both adaptability and stability.
This paper is organized as follows. Section 1 gave an introduction of onramp control problem; Section 2 introduced the PSO algorithm and QPSO algorithm. Then, a new algorithm, DWCQPSO algorithm, is proposed in Section 3, and the convergence performance of the novel method is analysed by test functions experiment results; Section 4 explained the onramp traffic model and illustrated the computation process of DWCQPSO algorithm optimizing the parameters of the onramp PI controller. In the end, Section 5 focuses on the simulation results analysis and Section 6 is the conclusion of this work.
2. PSO Algorithm and QPSO Algorithm
2.1. PSO Algorithm
Particle swarm optimization (PSO) algorithm is an evolutionary computation method proposed by Kennedy and Eberhart in 1995 [7–9]. It is one pattern of the latest swarm intelligence (SI) optimization algorithms. The basic idea of PSO algorithm derived from the study of bird behavior, through simulating birds’ prey behavior to achieve the purpose of problem optimization.
In the PSO algorithm, each potential solution of the problem is abstracted as a particle with no weight and no volume. These particles fly at a certain speed in the dimensional search space [10]. Assuming the particle swarm population size is , the particle ’s position and velocity at time step are, respectively, expressed as follows.
The position of particle at time step :
The velocity of particle at time step :
is used to describe the particle ’s personal best solution and is used to describe the best position found by the neighborhood of particle , at time step :
In the standard PSO model, the updated formula of particles’ velocity and position on each dimension is as follows:for and , where(i) is the total number of particles in the swarm,(ii) is the dimension of the problem, that is, the number of parameters of the function being optimized,(iii) is the inertia weight,(iv) and are acceleration coefficients,(v).
As PSO has simple concept, a small number of parameters, and desirable performance, PSO has become a very promising optimization tool and attracted extensive attention and has been successfully applied in many areas, such as function optimization, power systems, data mining, and wireless sensor network. However, some problems of this novel algorithm remain to be solved. One of these problems is that particle swarm cannot converge on the global optimal solution with one hundred percent probability, which has been proven by Bergh [11].
2.2. QuantumBehaved Particle Swarm Optimization Algorithm
In order to solve this problem, Sun [12] proposed the quantumbehaved particle swarm optimization algorithm in the quantum space. According to the results Clerc and Kennedy [13] analyzed the particles’ orbit in the PSO algorithm, and QPSO algorithm establishes a potential well to impact particles’ convergence at the local attraction points . The position of is calculated by the following equations:where and denote the dimensional components of particle ’s past best solution () and global best solution (), respectively; and are random factors which are independently distributed random variables; is the individual cognitive acceleration factor, and is the group cognitive acceleration factor:where , is the length of the potential well, which is evaluated by formula (6).
is defined as the population gravity center which is the average of all the best individual locations. It is calculated as follows:where is contractionexpansion coefficient. It is the only additional control parameter in QPSO besides the population size and the number of iterations. can be set by fixed values or decreases linearly.
3. DWCQPSO Algorithm
3.1. DWCQPSO Algorithm
QPSO ensures global convergence; however, this algorithm still has the local optimum problem. The main reason for that is that QPSO algorithm establishes a single potential well at the point , and the population of particles gradually approaches to under the gravity function. While this information exchange method is fast, the transmission is unidirectional, leading to the population of particles quickly gather in an increasingly smaller search area and resulting in low population diversity. In order to improve the performance of QPSO algorithm, this paper proposes the DWCQPSO algorithm, which enhances the QPSO’s convergence properties by increasing wait effects between particles to avoid population excessive accumulation.
The specific idea of DWCQPSO algorithm is as follows: dividing the particle swarm into two separate subgroups after randomizing the individual’s position in the solution space. One subgroup establishes a potential well at the position of in accordance with the rules of standards QPSO algorithm. The particles of the second subgroup are iteratively searching in the solution space under the influence of the other potential well which is established with as the center. Given the entire population , the first subgroup is called master subgroup, represented by , and the second subgroup is called secondary subgroup, represented by ; thus, . The position of is calculated as in formula (8).
Evolutionary formula of particles’ positions in DWCQPSO algorithm is as follows:
These two subgroups exchange information by means of the best individual during the searching period in DWCQPSO algorithm that is comparing the best fitness value of and at the end of each iteration. Given that is ’s global best solution and is ’s global best solution, we compare the fitness values corresponding to and , respectively. If the latter one is superior than the former one, is assigned to ; otherwise remains unchanged. The essence of the above operation is an update of the whole swarm’s global best solution to help subgroups escape from local optima. By analyzing the displacement formula, the result shows that and are symmetry in point of the center of and . In the convergence process, all particles’ will gradually move closer to the . Due to the gravity of potential well, of master subgroup and of secondary subgroup will overlap at the same place in the solution space eventually. Therefore, the convergence of the DWCQPSO algorithm can be achieved.
3.2. Experiment and Simulation
In order to verify the novel algorithm, the optimization results of DWCQPSO algorithm are compared with the performance of standard PSO algorithm and QPSO algorithm using 6 standard test functions. Since many practical projects, including singlepeak and multipeak problems, choose two single peak functions (Sphere function and Rosenbrock function) and five multipeak functions (Rastrigin function, Griewank function, Ackley function, Schaffer function, and Schwefel function) as the experimental test functions, we will give some information about these test functions, including expressions, the ranges of variables, dimensions, the optimal solutions, and optimal values of test functions as follows:(1)Sphere function:(2)Rosenbrock function:(3)Rastrigin function:(4)Griewank function:(5)Ackley function: (6)Schwefel function:
In the experiment simulation, the parameter linearly decreases from 1 to 0.5. The maximum number of iterations iterMax is set to 1000. The population sizes are set to 30 and 50, respectively. The size of the master cluster is and the size of the secondary cluster is , using the average distribution strategy, which is . Each test case runs 30 times independently, then calculate the average results of the test function. Experimental environment is MATLAB 7.9.0, Intel Core (TM) 2, 1.80 GHz, 2.50 GB RAM.
Mean fitness value and CPU time per round of PSO, QPSO, and DWCQPSO algorithm to optimize the various functions are as shown in Tables 1 and 2.


Tables 1 and 2 illustrate that the DWCQPSO has the best performance compared with the PSO algorithm and the QPSO algorithm. This is because the DWCQPSO algorithm has two subgroups, which are master subgroup and secondary subgroup , respectively. and complement each other and coevolve by exchanging the optimal location information constantly.
This pattern of two subgroups searching in solving space at the same time and learning from each other increases the probability of finding the optimal solution and improves the convergence performance of the new algorithm.
Figures 1(a) and 1(b) show the convergence curves of the PSO, QPSO, and DWCQPSO algorithm solving 20 dimensions of unimodal functions with 30 particles, respectively. Sphere function is relatively simple, which can be used to test the accuracy of optimization algorithms to study the implementation of the algorithm performance. It is learned from Figure 1(a) that DWCQPSO has the similar performance. Rastrigin’s function is difficult to optimize as it has a large number of local optimums. The novel one gets the best results of these three algorithms for solving this function.
(a)
(b)
(c)
(d)
(e)
(f)
Figures 1(c)~1(e) illustrate the convergence curves of the PSO, QPSO, and DWCQPSO algorithm solving 20 dimensions of multimodal functions with 30 particles, respectively. Rastrigin function is easy to fall into local minima. The pattern of dural subgroups interaction allows DWCQPSO algorithm to have a better ability to escape from local optima to get the better optimization. From Figures 1(d) to 1(f) are the curves of Griewank function, Ackley function, and Schwefel function. There are correlations between the variables of these three functions. The experiment results show that the DWCQPSO algorithm has better performance in this type of problem.
In summary, the DWCQPSO algorithm proposed by this study obtained outstanding global search capability in limited iterative steps because it could get more useful information.
4. The OnRamp PI Controller Based on DWCQPSO Algorithm
4.1. OnRamp Traffic Model
Consider that the onramp has one lane, and the main lane of freeway is divided into sections with length . The traffic model is shown in Figure 2, where .
The traffic flow model in the th section of freeway is discrete in both space and time domains. It includes the following variables: : the traffic flow density of th section during the th period; : the average vehicle speed in th section during the th period; : the increased traffic flow of th section from th segment during the th period; : the onramp metering rate of th section during the th period; : the total number of vehicles in th section during the th period; : the number of main lanes of freeway; : the length of the th section; : the discrete time steps.
According to the law of vehicles conservation, the total number of vehicles in th section during the th period is as follows:
The traffic density of th section can be calculated through (9) in line with the definition of the traffic density:Then,
The parabolic flowdensity model can be deduced:
After the combination of (16) and (17), the complete traffic flow of the onramp of freeway is shown as formula (18):where is the freeflow speed and is the jamming density of the freeway. In fact, the flowdensity model also creates a critical density corresponding to the maximum flow rate . increases with the increase of value in interval, while decreases with the increase of value in interval. When is equal to , the is 0; therefore, the traffic jam occurs.
4.2. The OnRamp PI Controller Based on DWCQPSO
As a feedback control system, PI controller becomes one of the main methods of engineering controls because of its simple structure, good stability, reliability, and easy adjustment. Performance of PI controller depends on the reasonable values of parameters and . At present, PI controller parameters rely mainly on manual adjustment. However, this traditional approach is not only time consuming but also unable to guarantee the best performance. In this paper, DWCQPSO algorithm is used to optimize the value of and , which is shown in Figure 3.
PI controller system in Figure 3 includes the following variables: error value: ; error variation: ; the output of the PI controller: ; mediation rate of the onramp: ; expected traffic density: , is an appropriate small positive number.
This system’s objective is to control the mediation rate of the onramp and avoid the traffic congestion through maintaining the traffic density of main lane at a negative neighborhood of critical density . Therefore, the square sum of the differences between actual traffic flow density and expected traffic density can be used as the system objective function:
Each particle of the swarm corresponds to a pair of values of parameters and when using the DWCQPSO algorithm optimizing the PI controller. Due to the fact that the square sum of the differences between actual traffic flow density and expected traffic density is larger, the corresponding adjustment of onramp rate value should be smaller and the DWCQPSO adaptation algorithm corresponding value should also be smaller; the reciprocal of the sum of squared deviations can be selected as the fitness function of the DWCQPSO algorithm:
Figure 4 illustrates the process of using DWCQPSO algorithm optimizing the PI controller parameters.
The specific process is as follows.
Step 1 (setting parameters). This includes the acceleration factors and , the contractionexpansion factor , the swarm population , the maximum allowed times of iterations iterMax or error accuracy, and the population of subgroups, where and are the population of master subgroup and secondary subgroup , respectively.
Step 2 (population initialization). For , randomly generate the particles’ initial positions in the solution space, and let , where , ; for , do the same operation with , generate the particles’ random initial positions , and let , where , .
Step 3. Calculate the fitness value of all particles in and according to (22). The particle location of the smallest fitness value is assigned to the global best solution; that is, , .
Step 4. Calculate the mean best position of the particle swarm based on (7), using it to evaluate , where is the length of potential well.
Step 5. According to (9), update the location of particle ().
Step 6. Recalculate the fitness value of the particle ’s new position in the solution space according to the objective function.
Step 7. Update the locations of all particles’ . The specific operation is comparing the fitness value of and ; if , do ; otherwise do .
Step 8. Compare all particles’ fitness value with ’s fitness value. If and , save ’s position as the global best position of subgroup , denoted by ; otherwise do the operation of . If and , save ’s position as the global best position of subgroup ; otherwise do the operation of .
Step 9. Compare the fitness value of with the fitness value of . If , would be the global best position of the entire population ; that is, ; otherwise, do the operation of .
Step 10. Determine the termination conditions of the algorithm. If the end conditions are not reached (usually the end condition is the expected fitness value or the maximum number of iterations), do and return to Step 3.
Step 11. Output the optimal solution.
5. OnRamp PI Controller Simulation and Results Analysis
In order to demonstrate the effectiveness of the new algorithm, an experiment for onramp PI controller based on DWCQPSO algorithm is conducted. In the simulation, the acceleration coefficients of DWCQPSO and are set to be 2, and the contractionexpansion factor decreases linearly from 1 to 0.5. The maximum number of iteration steps itemMax is 150 and the entire population size is 30. All particles are evenly distributed to two subgroups, which means that the population size of master subgroup is equal to the population size of secondary subgroup . The system prototype is implemented in MATLAB 7.9.0. Typical parameters of onramp traffic flow model are shown in Table 3.

Assume the curve of the traffic is shown in Figure 5(a). And Figure 5(b) illustrates that the expected traffic density of th section linearly increases from the initial 24.06 vel/km·lane^{−1} to 34.16 vel/km·lane^{−1}, and since then it has been maintained at 34.16 vel/km·lane^{−1}. The values of parameters of the onramp traffic PI controller optimized by DWCPSO algorithm are and , which corresponds to the minimum fitness value . After using onramp traffic PI controller under the above parameter settings, the curves of actual traffic flow density of lane’s th section and the onramp mediation rate are shown in Figures 5(c) and 5(d), respectively.
(a)
(b)
(c)
(d)
It is learned from Figure 5(c) that the error between and is very small, which means that the expected traffic density can be well tracked by the actual traffic density in the system using DWCQPSO algorithm optimization. As can be seen from Figure 5(d), the onramp mediation rate increases with time at the beginning, and there is a surge during this period. Since the traffic of th section of lane remains unchanged in the initial stage, while the expected traffic density is linearly growing from 24.06 vel/km·lane^{−1} to 34.16 vel/km·lane^{−1}, then traffic increment is mainly coming from the onramp. In the following stage, the expected traffic density remains at vel/km·lane^{−1}, while the onramp mediation rate changes with the traffic variation of th section. The onramp mediation rate would be decreasing and the vehicles entering to the main lane from onramp would be reducing when the traffic of section is increasing; however, when the traffic of section is reducing, the onramp mediation rate would be increasing and the vehicles entering to the main lane from onramp would be increasing as well. The onramp control strategies above could avoid traffic congestion, keeping the traffic smooth and maximizing the utilization of the main lane.
In order to verify the effectiveness of the algorithm, the optimization performances of ant colony optimization (ACO) algorithm and particle swarm optimization (PSO) algorithm are compared with the performance of DWCQPSO. The PI controller parameters and the optimal value of objective function corresponding to these three algorithms are shown in Table 4, and the curve of the fitness value is shown in Figure 6.
The simulation illustrates that the minimum fitness value of onramp PI controller system can be obtained by DWCQPSO in these three algorithms. The results reveal that the actual traffic flow density is closest to the expected traffic density and the system has the highest stabilities under this condition. As a realtime traffic control system, if the reaction is too slow, the input information would be useless for the system and the outputs would lose effectiveness for inducing actual traffic. Therefore, the timeliness is an important evaluation standard for optimization algorithms in realtime applications. It can be learned that the DWCQPSO algorithm has the fastest convergence speed comparing with the ant colony algorithm and the standard particle swarm optimization from Figure 6. Because the novel algorithm has highspeed response capabilities in avoiding cumbersome and complex human intervention, it is able to quickly find the optimal value of parameters and . In summary, because the system is capable of adjusting the onramp traffic dynamically in realtime according to the traffic condition of upper section, the DWCQPSO algorithm is quite applicable in onramp traffic PI controller and outperforms other evolutionary algorithms with enhancement in both adaptability and stability.
6. Conclusion
Onramp control is a significant way to control the traffic density of freeway. Furthermore, it is also an important foundation for the traffic guidance systems and other decisionmaking systems in ITS. In this paper, the onramp traffic PI controller based on the DWCQPSO algorithm is proposed, which is designed on the assumption that all sections of lanes have the abilities of measuring the average vehicle speed and the traffic density. The DWCQPSO algorithm is applied in optimizing the PI controller parameters and in order to achieve the traffic density control at the onramp. Experimental results show that the onramp traffic PI controller based on DWCQPSO algorithm has better adaptability and stability compared to the other evolutionary algorithms.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This paper is supported by the National Nature Science Foundation of China (no. 61104175) and Fundamental Research Funds for the Central Universities (no. 2014NZYQN24). Tao Wu, Yusong Yan, and Xi Chen would like to thank everyone who contributed towards the completion of this paper.
References
 Q. X. Lv and X. R. Liang, “Freeway onramp control based on ant colony algorithm,” in Measurement & Control Technology, vol. 10, pp. 61–69, 2011. View at: Google Scholar
 Y. K. Fan and X. R. Liang, “Particle swarm optimization based PI controller for freeway ramp metering,” in Proceedings of the 27th Chinese Control Conference, pp. 503–506, Kunming, China, July 2008. View at: Publisher Site  Google Scholar
 J. X. Xu, S. H. Yu, and L. J. Xu, “Adaptive coordinated control based on FNN for freeway entering ramp,” Journal of Southeast University (Natural Science Edition), vol. S1, pp. 266–271, 2009. View at: Google Scholar
 L. Lei, L.Y. Dong, and H.X. Ge, “Study of gearalternating control regulation in the interfluent location of onramps with cellular automaton model,” Acta Physica Sinica, vol. 56, no. 12, pp. 6874–6880, 2007. View at: Google Scholar
 B. L. Li and S. R. Qu, “Adaptive control of onramp metering for highway based on geneticfuzzy approach,” Measurement & Control Technology, vol. 5, pp. 73–80, 2011. View at: Google Scholar
 W.S. Su, Y. Li, J.G. Sun, and W. Zhou, “Optimization methodology of PI controller parameters for aeroengines based on genetic algorithm,” Journal of Aerospace Power, vol. 20, no. 6, pp. 1078–1082, 2005. View at: Google Scholar
 J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Australia, December 1995. View at: Google Scholar
 R. Eberhart and J. Kennedy, “New optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43, IEEE Press, Nagoya, Japan, October 1995. View at: Google Scholar
 Q.J. Ni, Z.Z. Zhang, Z.Z. Wang, and H.C. Xing, “Dynamic probabilistic particle swarm optimization based on varying multicluster structure,” Journal of Software, vol. 20, no. 2, pp. 339–349, 2009. View at: Publisher Site  Google Scholar
 W. Jiao and G.B. Liu, “Two subpopulation swarm PSO algorithm in dynamic environment,” Control and Decision, vol. 24, no. 7, pp. 1083–1091, 2009. View at: Google Scholar
 F. V. D. Bergh, An analysis of particle swarm optimizers [Ph.D. thesis], University of Pretoria, 2002.
 J. Sun, Particle Swarm Optimization with Particles Having Quantum Behavior, Jiangnan University.
 M. Clerc and J. Kennedy, “The particle swarmexplosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2015 Tao Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.