Skip to main content
Log in

Particle state change algorithm

Soft Computing Aims and scope Submit manuscript


The matter state change, which is a common phenomenon in nature, shows the process that the matter how to reach the optimal state in the environment. This paper presents a novel particle state change model (PSCM) inspired by mimicking the process of the matter state change. Based on PSCM, a novel particle state change (PSC) algorithm is proposed for solving continuous optimization problems. As a new algorithm, PSC has many differences from other similar nature-inspired algorithms in terms of the basic principle models, mathematical formalization and properties. This paper considers three states of the matter, namely gas state, liquid state and solid state. In a certain circumstance, the matter always converts from an unstable state into a stable state. It is similar to find the optimal solution of an optimization problem. The proposed algorithm also has the advantages in the respects of higher intelligence, effectiveness and lower computation complexity. And the convergence property of PSC is discussed in detail. In order to illustrate the ability of solving optimization problems in continuous domain, the new proposed algorithm is tested on basic function optimization, CEC2016 single-objective real-parameter numerical optimization and CEC2016 learning-base real-parameter single-objective optimization, and compared with eleven existing algorithms. The numerous simulations have shown the effectiveness and suitability of the proposed approach.

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.

Institutional subscriptions

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


  1. In PSC, popsize is constant (popsize=20).

    In this paper, \({\lambda _ - }=10^{-4},\ {\gamma _ - }=10^{-4}\) and we use \(\lambda ,\ \gamma \) instead of \(\lambda _+,\ \gamma _+\).


  • AlRashidi MR, El-Hawary ME (2009) A survey of particle swarm optimization applications in electric power systems. IEEE Trans Evol Comput 13(4):913–918

    Article  Google Scholar 

  • Awad NH, Ali MZ, Reynolds RG (2015) A differential evolution algorithm with success-based parameter adaptation for CEC2015 learning-based optimization. In: 2015 IEEE congress on evolutionary computation (CEC), pp 1098–1105

  • Awad NH, Ali MZ, Suganthan PN, Reynolds RG (2016) An ensemble sinusoidal parameter adaptation incorporated with L-shade for solving CEC2014 benchmark problems. In: 2016 IEEE congress on evolutionary computation (CEC), pp 2958–2965

  • Bansal JC, Sharma H, Arya KV, Nagar A (2013) Memetic search in artificial bee colony algorithm. Soft Comput 17(10):1911–1928

    Article  Google Scholar 

  • Chen G, Low CP, Yang Z (2009) Preserving and exploiting genetic diversity in evolutionary programming algorithms. IEEE Trans Evol Comput 13(3):661–673

    Article  Google Scholar 

  • Chu W, Gao X, Sorooshian S (2011) Handling boundary constraints for particle swarm optimization in high-dimensional search space. Inf Sci 181(20):4569–4581

    Article  Google Scholar 

  • Cuevas E, Cienfuegos M, ZaldíVar D, PéRez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374–6384

    Article  Google Scholar 

  • Cuevas E, Echavarría A, Ramírez-Ortegón MA (2014) An optimization algorithm inspired by the states of matter that improves the balance between exploration and exploitation. Appl Intell 40(2):256–272

    Article  Google Scholar 

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18

    Article  Google Scholar 

  • Elsayed S, Hamza N, Sarker R (2016) Testing united multi-operator evolutionary algorithms-ii on single objective optimization problems. In: 2016 IEEE congress on evolutionary computation (CEC), pp 2966–2973

  • Fogel LJ (1966) Artificial intelligence through simulated evolution. Wiley, New York

    MATH  Google Scholar 

  • Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845

    Article  MathSciNet  MATH  Google Scholar 

  • Guo S-M, JSH Tsai, Yang C-C, Hsu P-H (2015) A self-optimization approach for l-shade incorporated with eigenvector-based crossover and successful-parent-selecting framework on CEC2015 benchmark set. In: 2015 IEEE congress on evolutionary computation (CEC)

  • Kari L, Rozenberg G (2008) The many facets of natural computing. Commun ACM 51(10):72–83

    Article  Google Scholar 

  • Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289

    Article  MATH  Google Scholar 

  • Krishnamoorthy K (2016) Handbook of statistical distributions with applications. CRC Press, Boca Raton

    MATH  Google Scholar 

  • Kundu R, Das S, Mukherjee R, Debchoudhury S (2014) An improved particle swarm optimizer with difference mean based perturbation. Neurocomputing 129:315–333

    Article  Google Scholar 

  • Lam AYS, Li VOK (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3–17

    Article  Google Scholar 

  • Lam AYS, Li VOK, James JQ (2012) Real-coded chemical reaction optimization. IEEE Trans Evol Comput 16(3):339–353

    Article  Google Scholar 

  • Li X, Yin M (2016) A particle swarm inspired cuckoo search algorithm for real parameter optimization. Soft Comput 20(4):1389–1413

    Article  Google Scholar 

  • Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore

  • Liang JJ, Qu BY, Suganthan PN, Chen Q (2014) Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical Report201411A, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore

  • Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst 22(3):52–67

    Article  Google Scholar 

  • Qin Q, Cheng S, Zhang Q, Li L, Shi Y (2015) Biomimicry of parasitic behavior in a coevolutionary particle swarm optimization algorithm for global optimization. Appl Soft Comput 32:224–240

    Article  Google Scholar 

  • Rajabioun R (2011) Cuckoo optimization algorithm. Appl Soft Comput 11(8):5508–5518

    Article  Google Scholar 

  • Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    Article  MATH  Google Scholar 

  • Rogers H (1967) Theory of recursive functions and effective computability, vol 126. McGraw-Hill, New York

    MATH  Google Scholar 

  • Ronkkonen J, Kukkonen S, Price KV (2005) Real-parameter optimization with differential evolution. Proc IEEE CEC 1:506–513

    Google Scholar 

  • Josíe LR, Istvían E (2016) Solving the CEC2016 real-parameter single objective optimization problems through MVMO-PHM. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore

  • Shadbolt N (2004) Nature-inspired computing. IEEE Intell Syst 19(1):2–3

    Article  Google Scholar 

  • Shin S-Y, Lee I-H, Kim D, Zhang B-T (2005) Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans Evol Comput 9(2):143–158

    Article  Google Scholar 

  • Tanabe R, Fukunaga AS (2014) Improving the search performance of shade using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC), pp 1658–1665

  • Tian H, Yuan X, Huang Y, Wu X (2015) An improved gravitational search algorithm for solving short-term economic/environmental hydrothermal scheduling. Soft Comput 19(10):2783–2797

    Article  Google Scholar 

  • Xu X, Chen H-L (2014) Adaptive computational chemotaxis based on field in bacterial foraging optimization. Soft Comput 18(4):797–807

    Article  Google Scholar 

  • Yang X-S (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, New York

    Book  Google Scholar 

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

    Article  Google Scholar 

  • Yazdani S, Nezamabadi-pour H, Kamyab S (2014) A gravitational search algorithm for multimodal optimization. Swarm Evol Comput 14:1–14

    Article  Google Scholar 

  • Yu L, Chen H, Wang S, Lai KK (2009) Evolving least squares support vector machines for stock market trend mining. IEEE Trans Evol Comput 13(1):87–102

    Article  Google Scholar 

Download references


This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61472139 and 61462073, the Information Development Special Funds of Shanghai Economic and Information Commission under Grant No. 201602008, the Open Funds of Shanghai Smart City Collaborative Innovation Center.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Xiang Feng.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Feng, X., Xu, H., Yu, H. et al. Particle state change algorithm. Soft Comput 22, 2641–2666 (2018).

Download citation

  • Published:

  • Issue Date:

  • DOI: