Skip to main content
SpringerLink
Log in

An improved memetic algorithm using ring neighborhood topology for constrained optimization

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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
Fig. 15

Similar content being viewed by others

References

  • Aguirre AH, Zavala AM, Diharce EV, Rionda SB (2007) COPSO: constrained optimization via PSO algorithm. Technical report, Center for Research in Mathematics (CIMAT)

  • Boussaid I, Chatterjee A, Siarry P, Ahmed-Nacer M (2012) Biogeography-based optimization for constrained optimization problems. Comput Operat Res 39:3293–3304

    Article  MathSciNet  Google Scholar 

  • Cagnina LC, Esquivel SC, Coello CAC (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(3):319–326

    MATH  Google Scholar 

  • 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

    Google Scholar 

  • Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591–607

    Article  Google Scholar 

  • Coello CAC (2000) Use of a self-adaptivepenaltyapproach for engineering optimization problems. Comput Ind 41(2):113–127

    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 Meth Appl Mech Eng 191(11–12):1245–1287

    Article  MATH  Google Scholar 

  • Coello CAC, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219–236

    Article  Google Scholar 

  • 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

    Google Scholar 

  • Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evol Comput 13(3):526–553

    Article  Google Scholar 

  • Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31

    Article  Google Scholar 

  • 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–197

    Article  Google Scholar 

  • 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

    Google Scholar 

  • Handoko SD, Kwoh CK, Ong YS (2010) Feasibility structure modeling: a effective chaperone for constrained memetic algorithms. IEEE Trans Evol Comput 14(5):740–758

    Article  Google Scholar 

  • He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422

    Article  MATH  MathSciNet  Google Scholar 

  • 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–223

    Article  Google Scholar 

  • Karaboga D, Akay B (2011) A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11:3021–3031

    Article  Google Scholar 

  • 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–456

    Article  MATH  MathSciNet  Google Scholar 

  • 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, Mendes R (2002) Topological structure and particle swarm performance. In: Proceedings of the 4th Congress Evolutionary Computation, pp 1671–1676

  • Krasnogor N, Gustafson S (2004) A study on the use of “self-generation” in memetic algorithms. Nat Comput 3:53–76

    Article  MATH  MathSciNet  Google Scholar 

  • 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–2454

    Article  MathSciNet  Google Scholar 

  • Li X (2010) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169

    Article  Google Scholar 

  • 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

  • Lin C (2013) A rough penalty genetic algorithm for constrained optimization. Inf Sci 241:119–137

    Article  Google Scholar 

  • Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1:355–366

    Article  Google Scholar 

  • Mezura-Montes E, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1(4):173–194

    Article  Google Scholar 

  • 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, Miranda-Varela ME, Gmez-Ramn R (2010) Differential evolution in constrained numerical optimization: an empirical study. Inf Sci 180(22):4223–4262

    Article  MATH  Google Scholar 

  • Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P, Report 826

  • Nema S, Goulermas JY, Sparrow G, Helman P (2011) A hybrid cooperative search algorithm for constrained optimization. Struct Multidisc Optim 43:107–119

    Article  MATH  MathSciNet  Google Scholar 

  • Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1–14

    Google Scholar 

  • Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. IEEE Congress on Evolutionary Computation, pp 2390–2397

  • Omran MGH, Engelbrecht AP, Salman A (2006) Using the ring neighborhood topology with self-adaptive differential evolution. Lect Notes Comput Sci 4221:976–979

    Article  Google Scholar 

  • Ong YS, Lim MH, Chen X (2010) Memetic computationpast, present & future. IEEE Comput Intell Mag 5(2):24–31

    Article  Google Scholar 

  • Price K, Storn R, Lampinen J (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin

  • 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–396

    Article  Google Scholar 

  • 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–46

    Article  Google Scholar 

  • Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294

    Article  Google Scholar 

  • 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

  • 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–147

    Article  Google Scholar 

  • 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

  • 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

    Google Scholar 

  • 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

  • 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

    Google Scholar 

  • Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435

    Article  Google Scholar 

  • Wang H, Moon I, Yang S, Wang D (2012) A memetic particle swarm optimization algorithm for multimodal optimization problems. Inf Sci 197:38–52

    Article  Google Scholar 

  • Wang L, Li L (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidisc Optim 41:947–963

    Google Scholar 

  • 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

    Google Scholar 

  • Wang Y, Cai Z, Zhou Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans Evol Comput 12(1):80–92

    Article  Google Scholar 

  • 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–413

    Article  Google Scholar 

  • Wang Y, Cai Z (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evol Comput 16(1):117–134

    Article  Google Scholar 

  • Wang Y, Cai Z (2012) A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans Syst Man Cybern Part B Cybern 42(1):203–217

    Article  Google Scholar 

  • Woldesenbet YG, Yen GG, Tessema BG (2009) Constraint handling in multiobjective evolutionary optimization. IEEE Trans Evol Comput 13(3):514–525

    Article  Google Scholar 

  • Zhang C, Li X, Gao L, Wu Q (2013) An improved electromagnetism-like mechanism algorithm for constrained optimization. Expert Syst Appl 40:5621–5634

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the related associate editor and the anonymous reviewers for their time and valuable suggestions. This work was supported in part by the National Natural Science Foundation of China (NSFC) under grant 61300159, 61175073 and 51375287, by the Natural Science Foundation of Jiangsu Province under grant BK20130808, by the Research Fund for the Doctoral Program of Higher Education of China under grant 20123218120041 and by the Fundamental Research Funds for the Central Universities of China under grant NZ2013306.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Jiangsu, China

    Zhenzhou Hu & Xinye Cai

  2. Department of Electronic and Information Engineering, School of Engineering, Shantou University, Guangdong, China

    Zhun Fan

Authors
  1. Zhenzhou Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinye Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhun Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinye Cai.

Additional information

Communicated by Z. Zhu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, Z., Cai, X. & Fan, Z. An improved memetic algorithm using ring neighborhood topology for constrained optimization. Soft Comput 18, 2023–2041 (2014). https://doi.org/10.1007/s00500-013-1183-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-013-1183-7

Keywords

Search

Navigation