Skip to main content
Springer Nature Link
Log in

Probabilistic evolutionary bound constraint handling for particle swarm optimization

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Keeping the search space between the valid domains is one of the most important necessities for most of the optimization problems. Among the optimization algorithms, particle swarm optimization (PSO) is highly likely to violate boundary limitations easily because of its oscillating behavior. Therefore, PSO is led to be sensitive to bound constraint handling (BCH) method. This matter has not been taken to account very much until now. This study attempt to apply and explore the efficiency of one of the most recent BCH schemes called evolutionary boundary constraint handling (EBCH) on PSO. In addition, probabilistic evolutionary boundary constraint handling (PEBCH) is also introduced in this study as an update on EBCH approach. As a complementary step of previous efforts, in the current document, PSO with both EBCH and PEBCH are utilized to solve several benchmark functions and the results are compared to other approaches in the literature. The results reveal that, in most cases, the EBCH and PEBCH can considerably improve the performance of the PSO algorithm in comparison with other BCH methods.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  • Agrawal S, Silakari S (2015) A review on application of particle swarm optimization in bioinformatics. Curr Bioinform 10(4):401–413

    Article  Google Scholar 

  • Alvarez-Benitez JE, Everson RM, Fieldsend JE (2005) A MOPSO algorithm based exclusively on Pareto dominance concepts. International conference on evolutionary multi-criterion optimization. Springer, Berlin, pp 459–473

    Chapter  Google Scholar 

  • Antonio LM, Coello CAC (2015) Particle swarm optimization based on linear assignment problem transformations. In: Proceedings of the 2015 on genetic and evolutionary computation conference, ACM, pp 57–64

  • Bochenek B, Foryś P (2006) Structural optimization for post-buckling behavior using particle swarms. Struct Multidiscip Optim 32(6):521–531

    Article  Google Scholar 

  • Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization. In: Swarm intelligence symposium, 2007. SIS 2007. IEEE, pp 120–127

  • Clerc M (2006) Confinements and biases in particle swarm optimization [Online]. http://clerc.maurice.free.fr/pso

  • 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

    Article  Google Scholar 

  • Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11):1245–1287

    Article  Google Scholar 

  • Fister I, Gandomi AH, Fister IJ, Mousavi M, Farhadi A (2014) Soft computing in earthquake engineering: a short overview. Int J Earthq Eng Hazard Mitig 2(2):42–48

    Google Scholar 

  • Gandomi AH, Kashani AR (2016) Evolutionary bound constraint handling for particle swarm optimization. In: 2016 4th international symposium on computational and business intelligence (ISCBI). IEEE, pp 148–152

  • Gandomi AH, Yang XS (2012) Evolutionary boundary constraint handling scheme. Neural Comput Appl 21(6):1449–1462

    Article  Google Scholar 

  • Gandomi AH, Yang XS, Talatahari S, Alavi AH (2013a) Metaheuristic algorithms. In: Gandomi AH et al (eds) Metaheuristic applications in structures and infrastructures. Elsevier, Waltham, pp 1–24

    Google Scholar 

  • Gandomi AH, Yun GJ, Yang XS, Talatahari S (2013b) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327–340

    Article  Google Scholar 

  • Gandomi AH, Kashani AR, Mousavi M, Jalalvandi M (2015a) Slope stability analyzing using recent swarm intelligence techniques. Int J Numer Anal Methods Geomech 39(3):295–309

    Article  Google Scholar 

  • Gandomi AH, Kashani AR, Roke DA, Mousavi M (2015b) Optimization of retaining wall design using recent swarm intelligence techniques. Eng Struct 103:72–84

    Article  Google Scholar 

  • Gandomi AH, Kashani AR, Mousavi M (2015c) Boundary constraint handling affection on slope stability analysis. In: Lagaros ND, Papadrakakis M (eds) Engineering and applied sciences optimization. Springer, New York, pp 341–358

    Chapter  Google Scholar 

  • Gandomi AH, Kashani AR, Roke DA, Mousavi M (2017a) Optimization of retaining wall design using evolutionary algorithms. Struct Multidiscip Optim 55(3):809–825

    Article  Google Scholar 

  • Gandomi AH, Kashani AR, Mousavi M, Jalalvandi M (2017b) Slope stability analysis using evolutionary optimization techniques. Int J Numer Anal Methods Geomech 41(2):251–264

    Article  Google Scholar 

  • Gandomi AH, Kashani AR, Zeighami F (2017c) Retaining wall optimization using interior search algorithm with different bound constraint handling. Int J Numer Anal Methods Geomech 41(11):1304–1331

    Article  Google Scholar 

  • Gandomi AH, Kashani AR (2018) Construction cost minimization of shallow foundation using recent swarm intelligence techniques. IEEE Trans Ind Inform 14(3):1099–1106

    Article  Google Scholar 

  • García-Gonzalo E, Fernández-Martínez JL (2012) A brief historical review of particle swarm optimization (PSO). J Bioinform Intell Control 1(1):3–16

    Article  Google Scholar 

  • Helwig S, Branke J, Mostaghim S (2013) Experimental analysis of bound handling techniques in particle swarm optimization. IEEE Trans Evol Comput 17(2):259–271

    Article  Google Scholar 

  • Huang T, Mohan AS (2005) A hybrid boundary condition for robust particle swarm optimization. IEEE Antennas Wirel Propag Lett 4:112–117

    Article  Google Scholar 

  • Jordehi AR (2015) A review on constraint handling strategies in particle swarm optimisation. Neural Comput Appl 26(6):1265–1275

    Article  Google Scholar 

  • Kashani AR, Gandomi AH, Mousavi M (2016) Imperialistic competitive algorithm: a metaheuristic algorithm for locating the critical slip surface in 2-dimensional soil slopes. Geosci Front 7(1):83–89

    Article  Google Scholar 

  • Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann, San Francisco

    Google Scholar 

  • Michalewicz Z (1995) A survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of 4th annual conference on evolution programming, pp 135–155

  • Mirjalili S, Wang GG, Coelho LDS (2014) Binary optimization using hybrid particle swarm optimization and gravitational search algorithm. Neural Comput Appl 25(6):1423–1435

    Article  Google Scholar 

  • Mostaghim S, Halter W, Wille A (2006) Linear multi-objective particle swarm optimization. Stigmergy Optim Comput Sci 31:209–237

    Google Scholar 

  • Mousavi M, Azarbakht A, Rahpeyma S, Farhadi A (2015) On the application of genetic programming for new generation of ground motion prediction equations. In: Handbook of Genetic Programming Applications. Springer, Cham, pp 289–307

    Chapter  Google Scholar 

  • Padhye N, Mittal P, Deb K (2015) Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization. Comput Optim Appl 62(3):851–890

    Article  Google Scholar 

  • Pulido GT, Coello CAC (2004) A constraint-handling mechanism for particle swarm optimization. In: Congress on evolutionary computation, 2004. CEC2004. IEEE, vol 2, pp 1396–1403

  • Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Rep 2005005:2005

    Google Scholar 

  • Zhang WJ, Xie XF, Bi DC (2004) Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space. In: Congress on evolutionary computation, 2004. CEC2004. IEEE, vol 2, pp 2307–2311

Download references

Author information

Authors and Affiliations

  1. School of Business, Stevens Institute of Technology, Hoboken, NJ, USA

    Amir H. Gandomi

  2. Department of Civil Engineering, Arak University, Arak, Iran

    Ali R. Kashani

Authors
  1. Amir H. Gandomi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ali R. Kashani
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Amir H. Gandomi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gandomi, A.H., Kashani, A.R. Probabilistic evolutionary bound constraint handling for particle swarm optimization. Oper Res Int J 18, 801–823 (2018). https://doi.org/10.1007/s12351-018-0401-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-018-0401-6

Keywords