Skip to main content
Log in

A novel PSO algorithm based on an incremental-PID-controlled search strategy

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Many variants of Particle Swarm Optimization (PSO) algorithm have been proposed in literature in the past two decades. The two research major topics, namely particle movement trajectory analysis and parameter selection, have also been intensively explored. Focused on the two issues, this paper transforms the velocity updating strategy in PSO algorithm to an incremental PID controller and thus develops a new incremental PID controlled search strategy. To endow this new PID-controlled deterministic search strategy with a stochastic nature, a mutation operation is applied on the particles and their exemplars. Based on such learning concepts, a novel incremental PID-controlled PSO, called IPID-PSO in short, algorithm is proposed. The proposed IPID-PSO algorithm is applied to eight benchmark problems of function optimization widely considered in literature. Compare with other two PSO variants, the IPID-PSO algorithm outperforms them on most of the eight functions. This superiority shows the usefulness of the proposed search strategy. Finally, the IPID-PSO is employed to estimate the parameters of the Jiles–Atherton (J–A) model, which is usually adopted to describe the hysteresis loop of magnetic materials. The results demonstrate that the proposed IPID-PSO is also effective for the J–A model parameter estimation. Therefore it can be concluded that the IPID-PSO algorithm provides a promising and satisfactory solution to real-world applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Afshar MH (2012) Large scale reservoir operation by constrained Particle Swarm Optimization algorithms. J Hydro-environ Res 6:75–87

    Article  Google Scholar 

  • Araujo TF, Uturbey W (2013) Performance assessment of PSO, DE and hybrid PSO-DE algorithms when applied to the dispatch of generation and demand. Electr Power Energy Syst 47:205–217

  • Benabou A, Clenet S, Piriou F (2003) Comparison of Preisach and Jiles–Atherton models to take into account hysteresis phenomenon for finite element analysis. J Magn Magn Mater 261:139–160

    Article  Google Scholar 

  • van den Bergh F, Engelbrecht AP (2006) A study of particle swarm optimization particle trajectories. Inf Sci 176:937–971

    Article  MATH  Google Scholar 

  • Campana E (2006) Dynamic system analysis and initial particles position in Particle Swarm Optimization. In: Proceedings of IEEE Swarm Intelligence Symposium, pp 202–209

  • Clerc M, Kennedy J (2002) The particle swarm—explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73

  • Coelho L, Grebogi R (2010) Chaotic synchronization using PID control combined with population based incremental learning algorithm. Expert Syst Appl 37:5347–5352

    Article  Google Scholar 

  • DeJesus E (1987) Routh–Hurwitz criterion in the examination of eigenvalues of a system of nonlineary ordinary differential equations. Phys Rev A 35:5288–5290

    Article  MathSciNet  Google Scholar 

  • Dong N et al (2012) An opposition-based chaotic GA/PSO hybrid algorithm and its application in circle detection. Comput Math Appl 64:1886–1902

    Article  MathSciNet  MATH  Google Scholar 

  • Gao L, Zhou YM, Liu JL et al (2010) Effect of water quenching process on the microstructure and magnetic property of cold rolled dual phase steel. J Magn Magn Mater 322:929–933

    Article  Google Scholar 

  • Hashemi A, Meybodi M (2011) A note on the learning automata based algorithms for adaptive parameter selection in PSO. Appl Soft Comput 11:689–705

    Article  Google Scholar 

  • Janson S, Middendorf M (2007) On trajectories of particles in PSO. In: Proceedings of 2007 IEEE Swarm Intelligence Symposium (SIS 2007)

  • Jiang M, Luo Y, Yang S (2007) Swarm intelligence: focus on ant and Particle Swarm Optimization. Itech Education and Publishing, Vienna

    Google Scholar 

  • Jiles DC, Thoelke JB (1989) Theory of ferromagnetic hysteresis: determination of model parameters from experimental hysteresis loops. IEEE Trans Magn 25(5):3928–3930

  • Jiles DC, Thoelke JB, Devine MK (1992) Numerical determination of hysteresis parameters for the modeling of magnetic properties using the theory of ferromagnetic hysteresis. IEEE Trans Magn 28(1):27–35

    Article  Google Scholar 

  • Lee C-Y, Yao X (2004) Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans Evol Comput 8(1):1–13

  • Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning Particle Swarm Optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295

    Article  Google Scholar 

  • Liao L, Wang J et al (2012) PSO/ACO algorithm-based risk assessment of human neural tube defects in Heshun County, China. Biomed Environ Sci 25:569–576

    Google Scholar 

  • Lu H et al (2010) Experimental study of a new hybrid PSO with mutation for economic dispatch with non-smooth cost function. Electr Power Energy Syst 32:921–935

    Article  Google Scholar 

  • Marion R, Scorretti R, Siauve N et al (2008) Identification of Jiles–Atherton model parameters using Particle Swarm Optimization. IEEE Trans Magn 44(6):894–897

    Article  Google Scholar 

  • Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization. Swarm Evol Comput 9:1–14

    Article  Google Scholar 

  • Montalvo I et al (2010) Improved performance of PSO with self-adaptive parameters for computing the optimal design of water supply systems. Eng Appl Artif Intell 23:727–735

    Article  Google Scholar 

  • Moore P, Venayagamoorthy G (2006) Evolving digital circuit using hybrid particle swarm optimization and differential evolution. Int J Neural Syst 16(3):163–177

  • Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO. ACO and k-means for cluster analysis. Appl Soft Comput 10:183–197

    Article  Google Scholar 

  • Ramesh L et al (2012) Intelligent DE algorithm for measurement location and PSO for bus voltage estimation in power distribution system. Electr Power Energy Syst 39:1–8

    Article  Google Scholar 

  • Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical Particle Swarm Optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255

    Article  Google Scholar 

  • Salomon R (1996) Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions: a survey of some theoretical and practical aspects of genetic algorithms. BioSystems 39:263–278

    Article  Google Scholar 

  • Shen L et al (2009) Frame-level bit allocation based on incremental PID algorithm and frame complexity estimation. J Vis Commun Image Represent 20:28–34

    Article  Google Scholar 

  • Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In: Proceedings of 7th annual conference on evolution computation, pp 591–601

  • Shi Y, Eberhart R (1999) Empirical study of particle swarm optimization. In: Proceeding of the (1999) Congress on evolutionary computation (CEC’99). Washington DC, pp 1945–1950

  • Trelea I (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf Process Lett 85:317–325

    Article  MathSciNet  MATH  Google Scholar 

  • Xin B, Chen J, Zhang J, Fang H, Peng Z-H (2012) Hybridizing differential evolution and Particle Swarm Optimization to design powerful optimizers: a review and taxonomy. IEEE Trans Syst Man Cybern Part C Appl Rev 42(5):744–767

    Article  Google Scholar 

  • Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

  • Yu X-M et al (2004) A PSO-based approach to optimal capacitor placement with harmonic distortion consideration. Electr Power Syst Res 71:27–33

  • Yu S et al (2012) Energy demand projection of China using a path-coefficient analysis and PSO-GA approach. Energy Convers Manag 53:142–153

    Article  Google Scholar 

  • Zhang W (2009) Guidelines for parameter selection in Particle Swarm Optimization according to control theory. In: 5th international conference on natural computation, pp 520–524

  • Zhang Y et al (2010) Find multi-objective paths in stochastic networks via chaotic immune PSO. Expert Syst Appl 37:1911–1919

  • Zhao X et al (2012) An improved discrete immune optimization algorithm based on PSO for QoS-driven web service composition. Appl Soft Comput 12:2208–2216

    Article  Google Scholar 

  • Zheng Y et al (2003) On the convergence analysis and parameter selection in particle swarm optimization. In: Proceedings of the 2nd international conference on machine learning and cybernetics, pp 1802–1807

Download references

Acknowledgments

The work reported in this paper was supported in part by the National Natural Science Foundation of China under Grant No. 61075070 and Key Grant No. 11232005.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianhua Zhang.

Additional information

Communicated by V. Loia.

Appendix 1: The eight benchmark functions examined

Appendix 1: The eight benchmark functions examined

The following eight benchmark functions (Salomon 1996; Yao et al. 1999; Lee and Yao 2004), among which \(f_1\) and \(f_2\) are two uni-modal functions and \(f_3\) to \(f_8\) are six multi-modal functions of the independent \(D\)-dimensional variable x, are minimized by using the IPID-PSO algorithm in Sect. 4:

(1) Sphere function

$$\begin{aligned} f_1 (\mathbf {x})=\sum \limits _{i=1}^D {x_i ^2} \end{aligned}$$
(14)

(2) Rosenbrock’s function

$$\begin{aligned} f_2 (\mathbf {x})=\sum \limits _{i=1}^{D-1} {\left( 100(x_i ^2-x_{i+1} )^2+(x_i -1)^2\right) } \end{aligned}$$
(15)

(3) Ackley’s function

$$\begin{aligned} f_3 (\mathbf {x})&= -20\exp \left( -0.2\sqrt{\frac{1}{D}\sum \limits _{i=1}^D {x_i ^2} } \right) \nonumber \\&-\exp \left( \frac{1}{D}\sum \limits _{i=1}^D {\cos (2\pi x_i )} \right) +20+e \end{aligned}$$
(16)

(4) Griewanks’s function

$$\begin{aligned} f_4 (\mathbf {x})=\sum \limits _{i=1}^D {\frac{x_i ^2}{4,000}} -\prod \limits _{i=1}^D {\cos \left( \frac{x_i }{\sqrt{i} }\right) } +1 \end{aligned}$$
(17)

(5) Weierstrass function

$$\begin{aligned} \begin{array}{l} f_5 (\mathbf {x})=\sum \limits _{i=1}^D \left( \sum \limits _{k=0}^{k\max } {\left[ a^k\cos (2\pi b^k(x_i +0.5))\right] } \right) \\ \qquad \qquad -D\sum \limits _{k=0}^{k\max } {\left[ a^k\cos (2\pi b^k\cdot 0.5)\right] } \\ a=0.5,b=3,k\max =20 \\ \end{array} \end{aligned}$$
(18)

(6) Rastrigin’s function

$$\begin{aligned} f_6 (\mathbf {x})=\sum \limits _{i=1}^D {(x_i ^2-10\cos (2\pi x_i )+10)} \end{aligned}$$
(19)

(7) (Non-continuous) Rastrigin’s function

$$\begin{aligned} \begin{array}{l} f_7 (\mathbf {x})=\sum \limits _{i=1}^D {(y_i ^2-10\cos (2\pi y_i )+10)} \\ y_i =\left\{ {{\begin{array}{ll} {x_i } &{} {\left| {x_i } \right| <1/2} \\ {\frac{\mathrm{round}(2x_i )}{2}} &{} {\left| {x_i } \right| >=1/2} \\ \end{array} }} \right. \\ \end{array} \end{aligned}$$
(20)

(8) Schwefel’s function

$$\begin{aligned} f_8 ( \mathbf {x})=418.9829\times D-\sum \limits _{i=1}^D {x_i \cdot \sin (\left| {x_i } \right| ^{\frac{1}{2}})} \end{aligned}$$
(21)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, J., Yang, S. A novel PSO algorithm based on an incremental-PID-controlled search strategy. Soft Comput 20, 991–1005 (2016). https://doi.org/10.1007/s00500-014-1560-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1560-x

Keywords

Navigation