The DOI matches its Crossref record.
Comparison of multi-modal optimization algorithms based on evolutionary algorithms
Abstract
Many engineering optimization tasks involve finding more than one optimum solution. The present study provides a comprehensive review of the existing work done in the field of multi-modal function optimization and provides a critical analysis of the existing methods. Existing niching methods are analyzed and an improved niching method is proposed. To achieve this purpose, we first give an introduction to niching and diversity preservation, followed by discussion of a number of algorithms. Thereafter, a comparison of clearing, clustering, deterministic crowding, probabilistic crowding, restricted tournament selection, sharing, species conserving genetic algorithms is made. A modified niching-based technique -- modified clearing approach -- is introduced and also compared with existing methods. For comparison, a versatile hump test function is also proposed and used together with two other functions. The ability of the algorithms in finding, locating, and maintaining multiple optima is judged using two performance measures: (i) number of peaks maintained, and (ii) computational time. Based on the results, we conclude that the restricted tournament selection and the proposed modified clearing approaches are better in terms of finding and maintaining the multiple optima.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Li, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2026270 · Cited by 466
Krishnanand, K. N., & Ghose, D. (2009) · Swarm Intelligence · doi:10.1007/s11721-008-0021-5 · Cited by 447
Differential Evolution With Neighborhood Mutation for Multimodal Optimization
Qu, B. Y., Suganthan, P. N., & Liang, J. J. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161873 · Cited by 442
Seeking Multiple Solutions: An Updated Survey on Niching Methods and Their Applications
Li, X., Epitropakis, M. G., Deb, K., & Engelbrecht, A. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2638437 · Cited by 339
Self-citation
Metadata
- Authors
- Singh, G., & Deb, K.
- Venue
- Proceedings of the 8th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2006-07-08
- Pages
- 1305-1312
- OpenAlex
- W2102559904
- Cited by
- 175
- References
- 0
- FWCI
- 7.20
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. https://app.cochat.ai/papers/10.1145/1143997.1144200
- The paper
- Singh, G., & Deb, K. (2006). Comparison of multi-modal optimization algorithms based on evolutionary algorithms. Proceedings of the 8th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/1143997.1144200
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.