Soft Computing

, Volume 21, Issue 23, pp 6933–6962 | Cite as

Spider monkey optimization algorithm for constrained optimization problems



In this paper, a modified version of spider monkey optimization (SMO) algorithm for solving constrained optimization problems has been proposed. To the best of author’s knowledge, this is the first attempt to develop a version of SMO which can solve constrained continuous optimization problems by using the Deb’s technique for handling constraints. The proposed algorithm is named constrained spider monkey optimization (CSMO) algorithm. The performance of CSMO is investigated on the well-defined constrained optimization problems of CEC2006 and CEC2010 benchmark sets. The results of the proposed algorithm are compared with constrained versions of particle swarm optimization, artificial bee colony and differential evolution. Outcome of the experiment and the discussion of results demonstrate that CSMO handles the global optimization task very well for constrained optimization problems and shows better performance in comparison with compared algorithms. Such an outcome will be an encouragement for the research community to further explore the potential of SMO in solving benchmarks as well as real-world problems, which are often constrained in nature.


Spider monkey optimization Constrained optimization CEC2006 CEC2010 Deb’s technique 



The first author would like to thank Ministry of Human Resource Development, Govt. of India, for funding this research under the Grant No. MHR-02-23-200-44.

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.


  1. Ali M, Ahn CW, Pant M (2014) Multi-level image thresholding by synergetic differential evolution. Appl Soft Comput 17:1–11CrossRefGoogle Scholar
  2. Asafuddoula M, Ray T, Sarker R (2015) A differential evolution algorithm with constraint sequencing: an efficient approach for problems with inequality constraints. Appl Soft Comput 36:101–113CrossRefMATHGoogle Scholar
  3. Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31–47CrossRefGoogle Scholar
  4. 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–12):1245–1287CrossRefMATHMathSciNetGoogle Scholar
  5. Deb K (2000) An efficient constraint handling method for genetic algorithm. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefMATHGoogle Scholar
  6. Doğan B, Olmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRefGoogle Scholar
  7. Dorigo M (1992) Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, ItalyGoogle Scholar
  8. Elsayed SM, Sarker RA, Essam DL (2011) GA with a new multi-parent crossover for constrained optimization. In: IEEE Congress on Evolutionary Computation, CEC’2011. IEEE Press, New Orleans, USA 2011, pp 857–864Google Scholar
  9. Esmaeili R, Dashtbayazi MR (2014) Modelling and optimization for microstructural properties of A1/SiC nanocomposite by artificial neural network and genetic algorithm. Expert Syst Appl 41:5817–5831CrossRefGoogle Scholar
  10. Farmer JD, Packard N, Perelson A (1986) The immune system, adaptation and machine learning. Phys. D 22(1–3):187–204CrossRefMathSciNetGoogle Scholar
  11. Gao WF, Liu SY, Huang LL (2014) Enhancing artificial bee colony algorithm using more information-based search equations. Inf Sci 270:112–133CrossRefMATHMathSciNetGoogle Scholar
  12. Gupta K, Deep K (2016) Investigation of suitable perturbation rate scheme for spider monkey optimization algorithm. In: Proceedings of fifth international conference on soft computing for problem solving, vol. 437, Springer, Singapore, pp 839–850Google Scholar
  13. Gupta K, Deep K (2016) Tournament Selection Based Probability Scheme in Spider Monkey Optimization Algorithm: In Harmony Search Algorithm, vol. 382, Springer, Berlin, pp 239–250Google Scholar
  14. Gupta K, Deep K, Bansal JC (2016) Improving the local search ability of spider monkey optimization algorithm using quadratic approximation for unconstrained optimization. Comput Intell. doi: 10.1111/coin.12081
  15. Han M, Liu C, Xing J (2014) An evolutionary membrane algorithm for global numerical optimization problems. Inf Sci 276:219–241CrossRefMathSciNetGoogle Scholar
  16. He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MATHMathSciNetGoogle Scholar
  17. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, AnnArborGoogle Scholar
  18. Imran M, Kowsalya M (2014) Optimal size and siting of multiple distributed generators in distributions system using bacterial foraging optimization. Swarm Evolut Comput 15:58–65CrossRefGoogle Scholar
  19. Jia G et al (2013) An improved \((\mu +\lambda )\) constrained differential evolution for constrained optimization. Inf Sci 222:302–322CrossRefMATHMathSciNetGoogle Scholar
  20. Karaboga D (2005) An idea based on honeybee swarm for numerical optimization. Technical Report, TR06, Erciyes University, Engineering Faculty, Computer Engineering DepartmentGoogle Scholar
  21. Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031CrossRefGoogle Scholar
  22. Kashan AH (2015) A new metaheuristic for optimization: optics inspired optimization (OIO). Comput Oper Res 55:99–125CrossRefMATHMathSciNetGoogle Scholar
  23. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings, IEEE International Conference, vol. 4, pp. 1942–1948Google Scholar
  24. Khajehzadeh M et al (2012) A modified gravitational search algorithm for slope stability analysis. Eng Appl Artif Intell 25(8):1589–1597CrossRefGoogle Scholar
  25. Kumar V, Chhabra JK, Kumar D (2014) Automatic cluster evolution using gravitational search algorithm and its application on image segmentation. Eng Appl Artif Intell 29:93–103CrossRefGoogle Scholar
  26. Kuo RJ, Hung SY, Cheng WC (2014) Application of an optimization artificial immune network and particle swarm optimization-based fuzzy neural network to an RFID-based positioning system. Inf Sci 262:78–98CrossRefGoogle Scholar
  27. Liang JJ et al (2006) Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. In: Technical Report. Nanyang Technological University, SingaporeGoogle Scholar
  28. Mallipeddi R, Suganthan PN (2010) Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization. Nanyang Technological University, SingaporeGoogle Scholar
  29. Mezura-Montes E, Coello CAC, Tun-Morales EI (2004) Simple feasibility rules and differential evolution for constrained optimization. In: IMICAI’2004, LNAI 2972, pp. 707–716Google Scholar
  30. Mezura-Montes E, Hernández-Ocaña B (2009) Modified bacterial foraging optimization for engineering design. In: Dagli CH et al (eds) Proceedings of the artificial neural networks in engineering conference, ANNIE’2009, in: Intelligent Engineering Systems Through Artificial Neural Networks, vol 19., ASME PressSt. Louis, MO, USA, pp 357–364Google Scholar
  31. Mezura-Montes E, Velázquez-Reyes J, Coello CAC (2005) Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization. In: Proceedings of the genetic and evolutionary computation conference, GECCO’2005, vol 1, Washington, DC, USA, ACM Press, New York, ISBN: 1-59593-010-8, pp 225–232Google Scholar
  32. Mezura-Montes E, Velázquez-Reyes J, Coello CAC (2006) Modified differential evolution for constrained optimization. In: IEEE Congress on Evolutionary Computation, CEC’2006. IEEE, Vancouver, BC, Canada 2006, pp 332–339Google Scholar
  33. Muñoz-Zavala AE, Aguirre AH, Diharce ERV (2005) Constrained optimization via particle evolutionary swarm optimization algorithm (PESO). In: Proceedings of the genetic and evolutionary computation conference, GECCO’2005, vol 1, Washington DC, USA, ACM Press, New York, ISBN:1-59593-010-8, pp 209–216Google Scholar
  34. Muñoz-Zavala AE, et al (2006) PESO+ for constrained optimization. In: IEEE international congress on evolutionary computation, pp 231-238Google Scholar
  35. Parouha RP, Das KN (2015) An efficient hybrid technique for numerical optimization. Comput Ind Eng 83:193–216CrossRefGoogle Scholar
  36. Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22(3):52–67CrossRefGoogle Scholar
  37. Rao RV, Savsani VJ, Vakharia DP (2012) Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15CrossRefMathSciNetGoogle Scholar
  38. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATHGoogle Scholar
  39. Sharma A et al (2016) Ageist spider monkey optimization algorithm. Swarm Evolut Comput 28:58–77CrossRefGoogle Scholar
  40. Simon D (2008) Biogeography-based optimization. IEEE Trans Evolut Comput 12:702–713CrossRefGoogle Scholar
  41. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNetGoogle Scholar
  42. Sun C-L, Zeng J-C, Pan JS (2009) A particle swarm optimization with feasibility based rules for mixed-variable optimization problems. In: Ninth international conference on hybrid intelligent systems, 2009, HIS’09, IEEE Computer Society Press, Shenyang, China, pp 543–547Google Scholar
  43. Sun C-L, Zeng J-C, Pan J-S (2009) An improved particle swarm optimization with Feasibility-based rules for mixed-variable optimization problems. In: Fourth international conference on innovative computing, information and control, IEEE Computer Society Press, 2009, pp 897–903Google Scholar
  44. Symington MMF (1990) Fission-fusion social organization in ateles and pan. Int J Primatol 11(1):47–61CrossRefGoogle Scholar
  45. Toscano-Pulido G, Coello CAC (2004) A constraint-handling mechanism for particle swarm optimization. In: Proceedings of the congress on evolutionary computation 2004, CEC’ 2004, vol 2, Portland, Oregon, USA, IEEE Service Center, Piscataway, New Jersey, pp 1396–1403Google Scholar
  46. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67–82CrossRefGoogle Scholar
  47. Zheng Y-J (2015) Water wave optimization: a new nature-inspired metaheuristic. Comput Oper Res 55:1–11CrossRefMATHMathSciNetGoogle Scholar
  48. Zielinski K, Laur R (2006) Constrained single-objective optimization using particle swarm optimization. In: IEEE congress on evolutionary computation, CEC’2006. IEEE, Vancouver, BC, Canada 2006, pp 443–450Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Department of MathematicsIndian Institute of Technology RoorkeeRoorkeeIndia
  2. 2.Department of Applied MathematicsSouth Asian UniversityChankyapuriIndia

Personalised recommendations