Skip to main content
Top
Published in: Soft Computing 10/2014

01-10-2014 | Methodologies and Application

An improved memetic algorithm using ring neighborhood topology for constrained optimization

Authors: Zhenzhou Hu, Xinye Cai, Zhun Fan

Published in: Soft Computing | Issue 10/2014

Log in

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

search-config
loading …

Abstract

This paper proposes an improved memetic algorithm relying on ring neighborhood topology for constrained optimization problems based on our previous work in Cai et al. (Soft Comput (in press), 2013). The main motivation of using ring neighborhood topology is to provide a good balance between effective exploration and efficient exploitation, which is a very important design issue for memetic algorithms. More specifically, a novel variant of invasive weed optimization (IWO) as the local refinement procedure is proposed in this paper. The proposed IWO variant adopts a neighborhood-based dispersal operator to achieve more fine-grained local search through the estimation of neighborhood fitness information relying on the ring neighborhood topology. Furthermore, a modified version of differential evolution (DE), known as “DE/current-to-best/1”, is integrated into the improved memetic algorithm with the aim of providing a more effective exploration. Performance of the improved memetic algorithm has been comprehensively tested on 13 well-known benchmark test functions and four engineering constrained optimization problems. The experimental results show that the improved memetic algorithm obtains greater competitiveness when compared with the original memetic approach Cai et al. in (Soft Comput (in press), 2013) and other state-of-the-art algorithms. The effectiveness of the modification of each component in the proposed approach is also discussed in the paper.

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 Aguirre AH, Zavala AM, Diharce EV, Rionda SB (2007) COPSO: constrained optimization via PSO algorithm. Technical report, Center for Research in Mathematics (CIMAT) Aguirre AH, Zavala AM, Diharce EV, Rionda SB (2007) COPSO: constrained optimization via PSO algorithm. Technical report, Center for Research in Mathematics (CIMAT)
go back to reference Boussaid I, Chatterjee A, Siarry P, Ahmed-Nacer M (2012) Biogeography-based optimization for constrained optimization problems. Comput Operat Res 39:3293–3304CrossRefMathSciNet Boussaid I, Chatterjee A, Siarry P, Ahmed-Nacer M (2012) Biogeography-based optimization for constrained optimization problems. Comput Operat Res 39:3293–3304CrossRefMathSciNet
go back to reference Cagnina LC, Esquivel SC, Coello CAC (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(3):319–326MATH Cagnina LC, Esquivel SC, Coello CAC (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(3):319–326MATH
go back to reference Cai X, Hu Z, Fan Z (2013) A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization. Soft Comput 17(10):1893–1910 Cai X, Hu Z, Fan Z (2013) A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization. Soft Comput 17(10):1893–1910
go back to reference Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591–607CrossRef Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591–607CrossRef
go back to reference Coello CAC (2000) Use of a self-adaptivepenaltyapproach for engineering optimization problems. Comput Ind 41(2):113–127CrossRef Coello CAC (2000) Use of a self-adaptivepenaltyapproach for engineering optimization problems. Comput Ind 41(2):113–127CrossRef
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 Meth Appl Mech Eng 191(11–12):1245–1287CrossRefMATH Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Meth Appl Mech Eng 191(11–12):1245–1287CrossRefMATH
go back to reference Coello CAC, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219–236CrossRef Coello CAC, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219–236CrossRef
go back to reference Coello CAC, Mezura-Montes E (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inf 16((3):193–203 Coello CAC, Mezura-Montes E (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inf 16((3):193–203
go back to reference Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evol Comput 13(3):526–553CrossRef Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evol Comput 13(3):526–553CrossRef
go back to reference Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31CrossRef Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31CrossRef
go back to reference Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist nondominated sorting genetic algorithm for multiobjective optimization: NSGAII. IEEE Trans Evol Comput 6:182–197CrossRef Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist nondominated sorting genetic algorithm for multiobjective optimization: NSGAII. IEEE Trans Evol Comput 6:182–197CrossRef
go back to reference Gong W, Cai Z, Ling CX (2011) DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15:645–665 Gong W, Cai Z, Ling CX (2011) DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15:645–665
go back to reference Handoko SD, Kwoh CK, Ong YS (2010) Feasibility structure modeling: a effective chaperone for constrained memetic algorithms. IEEE Trans Evol Comput 14(5):740–758CrossRef Handoko SD, Kwoh CK, Ong YS (2010) Feasibility structure modeling: a effective chaperone for constrained memetic algorithms. IEEE Trans Evol Comput 14(5):740–758CrossRef
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–1422CrossRefMATHMathSciNet He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422CrossRefMATHMathSciNet
go back to reference Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204–223CrossRef Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204–223CrossRef
go back to reference Karaboga D, Akay B (2011) A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11:3021–3031CrossRef Karaboga D, Akay B (2011) A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11:3021–3031CrossRef
go back to reference Kelner V, Capitanescu F, Lonard O, Wehenkel L (2008) hybrid optimization technique coupling an evolutionary and a local search algorithm. J Comput Appl Math 215:448–456CrossRefMATHMathSciNet Kelner V, Capitanescu F, Lonard O, Wehenkel L (2008) hybrid optimization technique coupling an evolutionary and a local search algorithm. J Comput Appl Math 215:448–456CrossRefMATHMathSciNet
go back to reference Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of the Conference on Evolutionary Computation, pp 1931–1938 Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of the Conference on Evolutionary Computation, pp 1931–1938
go back to reference Kennedy J, Mendes R (2002) Topological structure and particle swarm performance. In: Proceedings of the 4th Congress Evolutionary Computation, pp 1671–1676 Kennedy J, Mendes R (2002) Topological structure and particle swarm performance. In: Proceedings of the 4th Congress Evolutionary Computation, pp 1671–1676
go back to reference Kundu D, Suresh K, Ghosh S, Das S, Panigrahi BK, Das S (2011) Multi-objective optimization with artificial weed colonies. Inf Sci 181(12):2441–2454CrossRefMathSciNet Kundu D, Suresh K, Ghosh S, Das S, Panigrahi BK, Das S (2011) Multi-objective optimization with artificial weed colonies. Inf Sci 181(12):2441–2454CrossRefMathSciNet
go back to reference Li X (2010) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169CrossRef Li X (2010) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169CrossRef
go back to reference Liang JJ, Runarsson TP, Mezura-Montes E, Clerc M, Suganthan PN, Coello CAC, Deb K (2006) Problem definitions and evaluation criteria for the cec 2006. Nanyang Technol. Univ., Singapore, Technical Report Liang JJ, Runarsson TP, Mezura-Montes E, Clerc M, Suganthan PN, Coello CAC, Deb K (2006) Problem definitions and evaluation criteria for the cec 2006. Nanyang Technol. Univ., Singapore, Technical Report
go back to reference Lin C (2013) A rough penalty genetic algorithm for constrained optimization. Inf Sci 241:119–137CrossRef Lin C (2013) A rough penalty genetic algorithm for constrained optimization. Inf Sci 241:119–137CrossRef
go back to reference Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1:355–366CrossRef Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1:355–366CrossRef
go back to reference Mezura-Montes E, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1(4):173–194CrossRef Mezura-Montes E, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1(4):173–194CrossRef
go back to reference Mezura-Montes E, Coello CAC, Velzquez-Reyes J (2006) Increasing successful offspring and diversity in differential evolution for engineering design. In: Proceedings of the seventh international conference on adaptive computing in design and manufacture, pp 131–139 Mezura-Montes E, Coello CAC, Velzquez-Reyes J (2006) Increasing successful offspring and diversity in differential evolution for engineering design. In: Proceedings of the seventh international conference on adaptive computing in design and manufacture, pp 131–139
go back to reference Mezura-Montes E, Miranda-Varela ME, Gmez-Ramn R (2010) Differential evolution in constrained numerical optimization: an empirical study. Inf Sci 180(22):4223–4262CrossRefMATH Mezura-Montes E, Miranda-Varela ME, Gmez-Ramn R (2010) Differential evolution in constrained numerical optimization: an empirical study. Inf Sci 180(22):4223–4262CrossRefMATH
go back to reference Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P, Report 826 Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P, Report 826
go back to reference Nema S, Goulermas JY, Sparrow G, Helman P (2011) A hybrid cooperative search algorithm for constrained optimization. Struct Multidisc Optim 43:107–119CrossRefMATHMathSciNet Nema S, Goulermas JY, Sparrow G, Helman P (2011) A hybrid cooperative search algorithm for constrained optimization. Struct Multidisc Optim 43:107–119CrossRefMATHMathSciNet
go back to reference Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1–14 Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1–14
go back to reference Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. IEEE Congress on Evolutionary Computation, pp 2390–2397 Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. IEEE Congress on Evolutionary Computation, pp 2390–2397
go back to reference Omran MGH, Engelbrecht AP, Salman A (2006) Using the ring neighborhood topology with self-adaptive differential evolution. Lect Notes Comput Sci 4221:976–979CrossRef Omran MGH, Engelbrecht AP, Salman A (2006) Using the ring neighborhood topology with self-adaptive differential evolution. Lect Notes Comput Sci 4221:976–979CrossRef
go back to reference Ong YS, Lim MH, Chen X (2010) Memetic computationpast, present & future. IEEE Comput Intell Mag 5(2):24–31CrossRef Ong YS, Lim MH, Chen X (2010) Memetic computationpast, present & future. IEEE Comput Intell Mag 5(2):24–31CrossRef
go back to reference Price K, Storn R, Lampinen J (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin Price K, Storn R, Lampinen J (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin
go back to reference Ray T, Liew K (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evol Comput 7(4):386–396CrossRef Ray T, Liew K (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evol Comput 7(4):386–396CrossRef
go back to reference Roy S, Islam SM, Das S, Ghosh S (2013) Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers. Appl Soft Comput 13:27–46CrossRef Roy S, Islam SM, Das S, Ghosh S (2013) Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers. Appl Soft Comput 13:27–46CrossRef
go back to reference Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294CrossRef Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294CrossRef
go back to reference Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. International Computer Science Institute, Berkeley, Technical, Report TR-95-012 Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. International Computer Science Institute, Berkeley, Technical, Report TR-95-012
go back to reference Sun J, Garibaldi JM, Krasnogor N, Zhang Q (2013) An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol Comput 21(1):107–147CrossRef Sun J, Garibaldi JM, Krasnogor N, Zhang Q (2013) An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol Comput 21(1):107–147CrossRef
go back to reference Takahama T, Sakai S (2006) Constrained optimization by the epsilon constrained differential evolution with gradient-based mutation and feasible elites. IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp 308–315 Takahama T, Sakai S (2006) Constrained optimization by the epsilon constrained differential evolution with gradient-based mutation and feasible elites. IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp 308–315
go back to reference Tang J, Lim MH, Ong YS (2007) Diversity-ada ptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11:873–888 Tang J, Lim MH, Ong YS (2007) Diversity-ada ptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11:873–888
go back to reference Tasgetiren MF, Suganthan PN (2006) A multi-populated differential evolution algorithm for solving constrained optimization problem. IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp 33–40 Tasgetiren MF, Suganthan PN (2006) A multi-populated differential evolution algorithm for solving constrained optimization problem. IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp 33–40
go back to reference Ullah ASSMB, Sarker R, Cornforth D, Lokan C (2009) AMA: a new approach for solving constrained real-valued optimization problems. Soft Comput 13:741–762 Ullah ASSMB, Sarker R, Cornforth D, Lokan C (2009) AMA: a new approach for solving constrained real-valued optimization problems. Soft Comput 13:741–762
go back to reference Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435CrossRef Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435CrossRef
go back to reference Wang H, Moon I, Yang S, Wang D (2012) A memetic particle swarm optimization algorithm for multimodal optimization problems. Inf Sci 197:38–52CrossRef Wang H, Moon I, Yang S, Wang D (2012) A memetic particle swarm optimization algorithm for multimodal optimization problems. Inf Sci 197:38–52CrossRef
go back to reference Wang L, Li L (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidisc Optim 41:947–963 Wang L, Li L (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidisc Optim 41:947–963
go back to reference Wang Y, Cai Z, Guo G, Zhou Y (2007) Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 37(3):560–575 Wang Y, Cai Z, Guo G, Zhou Y (2007) Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 37(3):560–575
go back to reference Wang Y, Cai Z, Zhou Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans Evol Comput 12(1):80–92CrossRef Wang Y, Cai Z, Zhou Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans Evol Comput 12(1):80–92CrossRef
go back to reference Wang Y, Cai Z, Zhou Y, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidisc Optim 37:395–413CrossRef Wang Y, Cai Z, Zhou Y, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidisc Optim 37:395–413CrossRef
go back to reference Wang Y, Cai Z (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evol Comput 16(1):117–134CrossRef Wang Y, Cai Z (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evol Comput 16(1):117–134CrossRef
go back to reference Wang Y, Cai Z (2012) A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans Syst Man Cybern Part B Cybern 42(1):203–217CrossRef Wang Y, Cai Z (2012) A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans Syst Man Cybern Part B Cybern 42(1):203–217CrossRef
go back to reference Woldesenbet YG, Yen GG, Tessema BG (2009) Constraint handling in multiobjective evolutionary optimization. IEEE Trans Evol Comput 13(3):514–525CrossRef Woldesenbet YG, Yen GG, Tessema BG (2009) Constraint handling in multiobjective evolutionary optimization. IEEE Trans Evol Comput 13(3):514–525CrossRef
go back to reference Zhang C, Li X, Gao L, Wu Q (2013) An improved electromagnetism-like mechanism algorithm for constrained optimization. Expert Syst Appl 40:5621–5634CrossRef Zhang C, Li X, Gao L, Wu Q (2013) An improved electromagnetism-like mechanism algorithm for constrained optimization. Expert Syst Appl 40:5621–5634CrossRef
Metadata
Title
An improved memetic algorithm using ring neighborhood topology for constrained optimization
Authors
Zhenzhou Hu
Xinye Cai
Zhun Fan
Publication date
01-10-2014
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 10/2014
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-013-1183-7

Other articles of this Issue 10/2014

Soft Computing 10/2014 Go to the issue

Premium Partner