Skip to main content
Top
Published in: Soft Computing 23/2017

02-11-2016 | Foundations

Spider monkey optimization algorithm for constrained optimization problems

Authors: Kavita Gupta, Kusum Deep, Jagdish Chand Bansal

Published in: Soft Computing | Issue 23/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Ali M, Ahn CW, Pant M (2014) Multi-level image thresholding by synergetic differential evolution. Appl Soft Comput 17:1–11CrossRef Ali M, Ahn CW, Pant M (2014) Multi-level image thresholding by synergetic differential evolution. Appl Soft Comput 17:1–11CrossRef
go back to reference 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–113CrossRefMATH 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–113CrossRefMATH
go back to reference Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31–47CrossRef Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31–47CrossRef
go back to reference 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–1287CrossRefMATHMathSciNet 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–1287CrossRefMATHMathSciNet
go back to reference Deb K (2000) An efficient constraint handling method for genetic algorithm. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefMATH Deb K (2000) An efficient constraint handling method for genetic algorithm. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefMATH
go back to reference Doğan B, Olmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef Doğan B, Olmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef
go back to reference Dorigo M (1992) Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy Dorigo M (1992) Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy
go back to reference 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–864 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–864
go back to reference 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–5831CrossRef 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–5831CrossRef
go back to reference Farmer JD, Packard N, Perelson A (1986) The immune system, adaptation and machine learning. Phys. D 22(1–3):187–204CrossRefMathSciNet Farmer JD, Packard N, Perelson A (1986) The immune system, adaptation and machine learning. Phys. D 22(1–3):187–204CrossRefMathSciNet
go back to reference Gao WF, Liu SY, Huang LL (2014) Enhancing artificial bee colony algorithm using more information-based search equations. Inf Sci 270:112–133CrossRefMATHMathSciNet Gao WF, Liu SY, Huang LL (2014) Enhancing artificial bee colony algorithm using more information-based search equations. Inf Sci 270:112–133CrossRefMATHMathSciNet
go back to reference 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–850 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–850
go back to reference 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–250 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–250
go back to reference 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 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
go back to reference Han M, Liu C, Xing J (2014) An evolutionary membrane algorithm for global numerical optimization problems. Inf Sci 276:219–241CrossRefMathSciNet Han M, Liu C, Xing J (2014) An evolutionary membrane algorithm for global numerical optimization problems. Inf Sci 276:219–241CrossRefMathSciNet
go back to reference He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MATHMathSciNet He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MATHMathSciNet
go back to reference Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, AnnArbor Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, AnnArbor
go back to reference 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–65CrossRef 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–65CrossRef
go back to reference Jia G et al (2013) An improved \((\mu +\lambda )\) constrained differential evolution for constrained optimization. Inf Sci 222:302–322CrossRefMATHMathSciNet Jia G et al (2013) An improved \((\mu +\lambda )\) constrained differential evolution for constrained optimization. Inf Sci 222:302–322CrossRefMATHMathSciNet
go back to reference Karaboga D (2005) An idea based on honeybee swarm for numerical optimization. Technical Report, TR06, Erciyes University, Engineering Faculty, Computer Engineering Department Karaboga D (2005) An idea based on honeybee swarm for numerical optimization. Technical Report, TR06, Erciyes University, Engineering Faculty, Computer Engineering Department
go back to reference Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031CrossRef Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031CrossRef
go back to reference Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings, IEEE International Conference, vol. 4, pp. 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings, IEEE International Conference, vol. 4, pp. 1942–1948
go back to reference Khajehzadeh M et al (2012) A modified gravitational search algorithm for slope stability analysis. Eng Appl Artif Intell 25(8):1589–1597CrossRef Khajehzadeh M et al (2012) A modified gravitational search algorithm for slope stability analysis. Eng Appl Artif Intell 25(8):1589–1597CrossRef
go back to reference 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–103CrossRef 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–103CrossRef
go back to reference 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–98CrossRef 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–98CrossRef
go back to reference 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, Singapore 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, Singapore
go back to reference Mallipeddi R, Suganthan PN (2010) Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization. Nanyang Technological University, Singapore Mallipeddi R, Suganthan PN (2010) Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization. Nanyang Technological University, Singapore
go back to reference 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–716 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–716
go back to reference 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–364 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–364
go back to reference 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–232 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–232
go back to reference 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–339 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–339
go back to reference 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–216 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–216
go back to reference Muñoz-Zavala AE, et al (2006) PESO+ for constrained optimization. In: IEEE international congress on evolutionary computation, pp 231-238 Muñoz-Zavala AE, et al (2006) PESO+ for constrained optimization. In: IEEE international congress on evolutionary computation, pp 231-238
go back to reference Parouha RP, Das KN (2015) An efficient hybrid technique for numerical optimization. Comput Ind Eng 83:193–216CrossRef Parouha RP, Das KN (2015) An efficient hybrid technique for numerical optimization. Comput Ind Eng 83:193–216CrossRef
go back to reference Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22(3):52–67CrossRef Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22(3):52–67CrossRef
go back to reference 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–15CrossRefMathSciNet 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–15CrossRefMathSciNet
go back to reference Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH
go back to reference Sharma A et al (2016) Ageist spider monkey optimization algorithm. Swarm Evolut Comput 28:58–77CrossRef Sharma A et al (2016) Ageist spider monkey optimization algorithm. Swarm Evolut Comput 28:58–77CrossRef
go back to reference Simon D (2008) Biogeography-based optimization. IEEE Trans Evolut Comput 12:702–713CrossRef Simon D (2008) Biogeography-based optimization. IEEE Trans Evolut Comput 12:702–713CrossRef
go back to reference Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNet Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNet
go back to reference 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–547 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–547
go back to reference 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–903 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–903
go back to reference Symington MMF (1990) Fission-fusion social organization in ateles and pan. Int J Primatol 11(1):47–61CrossRef Symington MMF (1990) Fission-fusion social organization in ateles and pan. Int J Primatol 11(1):47–61CrossRef
go back to reference 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–1403 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–1403
go back to reference Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67–82CrossRef
go back to reference 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–450 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–450
Metadata
Title
Spider monkey optimization algorithm for constrained optimization problems
Authors
Kavita Gupta
Kusum Deep
Jagdish Chand Bansal
Publication date
02-11-2016
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 23/2017
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-016-2419-0

Other articles of this Issue 23/2017

Soft Computing 23/2017 Go to the issue

Premium Partner