• Home
  • Search
  • Domain Decomposition Evolutionary Algorithm for Multi-Modal Function Optimization
  • https://doi.org/10.5772/6131Copy DOI Icon

Domain Decomposition Evolutionary Algorithm for Multi-Modal Function Optimization

  • Nov 1, 2008
  • Guangming Lin +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

The Simple Genetic Algorithm (SGA) is applied more and more extensively since it was proposed by J. H. Holland [1] in 1970’s. SGA is an optimization method based on population by emulating the evolvement disciplinarian of the nature. It has showed the great advantage of quick search for optimal solutions while applied in the optimization of single-modal functions. But as we all know many problems in reality belong to the optimization of multi-modal function, and if SGA is applied to solve this kind of problems, it has the confliction between the search space and convergence speed: the expansion of search space will slow down the convergence speed and the acceleration of convergence speed will reduce the search space, lead to early convergence and as a result stop research at some local optimal solutions. Evolutionary algorithms have been used regularly to solve multi-modal function optimization problems, due to their population-based approach and their inherent parallelism, e.g. a crowding factor model proposed by De Jong[2], a shared-function model proposed by Goldberg and Richardson[3], an artificial immune system method, a split ring parallel evolutionary algorithm, etc., all of which have attempted to maintain the diversity of the population during the process of evolution. In this chapter, we introduce a new ‘Domain Decomposition Evolutionary algorithm (called DDEA) which can solve not only simple nonlinear programming problems effectively and efficiently, but can also find the multiple solutions of multi-modal problems in a single run. The DDEA employs dual strategy approach that searches at two levels of detail (namely global then local). In the first (global) step, a Self-adaptive Mutations with Multi-parent Crossover Evolutionary Algorithm (SMMCEA)[4] is employed to perform a global search to divide the (chromosome) population into several subpopulations or niches in subdomains, which is domain decomposition. In the second (local) step, an evolutionary strategy-like algorithm is employed to perform a local search on each isolated niche independently. Then the best solutions of the multi-modal problem are exploited. The remainder of the chapter is organized as follows. Section 2 introduces a Self-adaptive Mutations with Multi-parent Crossover Evolutionary Algorithm (SMMCEA); Section 3 introduces Domain Decomposition evolutionary algorithm (DDEA); Section 4 presents the successful results of applying DDEA to several challenging numerical multi-modal optimization problems; Section 5 concludes. O pe n A cc es s D at ab as e w w w .ite ch on lin e. co m

Similar Papers
  • Book Chapter
  • Citations2

A review of particle swarm optimization for multimodal problems

  • Sep 28, 2018
  • Jian-Ping Li +4
  • Research Article
  • Citations45

Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers

  • Sep 07, 2012
  • Applied Soft Computing
  • Subhrajit Roy +3
  • Research Article
  • Citations200

MOMMOP: multiobjective optimization for locating multiple optimal solutions of multimodal optimization problems.

  • Aug 01, 2014
  • IEEE Transactions on Cybernetics
  • Yong Wang +3
  • Dissertation
  • Citations3

Evolutionary algorithms for solving multi-modal and multi-objective optimization problems

  • Jan 01, 2011
  • Boyang Qu
  • Research Article
  • Citations99

A memetic particle swarm optimization algorithm for multimodal optimization problems

  • Feb 24, 2012
  • Information Sciences
  • Hongfeng Wang +3
  • Research Article
  • Citations3

Evolutionary Multitask Framework With Bi-Knowledge Transfer for Multimodal Optimization Problems

  • Feb 01, 2026
  • IEEE Transactions on Evolutionary Computation
  • Hong Zhao +3
  • Research Article
  • Citations1

TCDE: Differential Evolution for Topographical Contour-Based Prediction to Solve Multimodal Optimization Problems

  • Jul 05, 2025
  • Applied Sciences
  • Zhen Cheng +5
  • Research Article
  • Citations26

Simulated Evolutionary Optimization and Local Search: Introduction and Application to Tree Search

  • Mar 01, 2001
  • Cladistics
  • Atte Moilanen
  • Conference Article
  • Citations7

Effect of topology on diversity of spatially-structured evolutionary algorithms

  • Jul 12, 2011
  • Matteo De Felice +2
  • Conference Article
  • Citations64

Finding multiple solutions for multimodal optimization problems using a multi-objective evolutionary approach

  • Jul 07, 2010
  • Kalyanmoy Deb +1
  • Book Chapter
  • Citations20

Ensemble of Clearing Differential Evolution for Multi-modal Optimization

  • Jan 01, 2012
  • Boyang Qu +3
  • Research Article
  • Citations138

A Multipopulation Evolutionary Algorithm for Solving Large-Scale Multimodal Multiobjective Optimization Problems

  • Dec 21, 2020
  • IEEE Transactions on Evolutionary Computation
  • Ye Tian +5
  • Book Chapter
  • Citations9

A Comparative Study of Transfer Functions in Binary Evolutionary Algorithms for Single Objective Optimization

  • Jul 05, 2018
  • Ramit Sawhney +2
  • Research Article
  • Citations8

A novel modified gravitational search algorithm for the real world optimization problem

  • Jan 28, 2019
  • International Journal of Machine Learning and Cybernetics
  • Lingling Huang +1
  • Research Article
  • Citations30

Multi-modal forest optimization algorithm

  • Mar 05, 2019
  • Neural Computing and Applications
  • Mohanna Orujpour +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.