The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Distance based parameter adaptation for Success-History based Differential Evolution
Abstract
This paper proposes a simple, yet effective, modification to scaling factor and crossover rate adaptation in Success-History based Adaptive Differential Evolution (SHADE), which can be used as a framework to all SHADE-based algorithms. The performance impact of the proposed method is shown on the real-parameter single objective optimization (CEC2015 and CEC2017) benchmark sets in 10, 30, 50, and 100 dimensions for all SHADE, L-SHADE (SHADE with linear decrease of population size), and jSO algorithms. The proposed distance based parameter adaptation is designed to address the premature convergence of SHADE–based algorithms in higher dimensional search spaces to maintain a longer exploration phase. This design effectiveness is supported by presenting a population clustering analysis, along with a population diversity measure. Also, the new distance based algorithm versions (Db_SHADE, DbL_SHADE, and DISH) have obtained significantly better optimization results than their canonical counterparts (SHADE, L_SHADE, and jSO) in 30, 50, and 100 dimensional functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362
Ensemble of differential evolution variants
Wu, G., Shen, X., Li, H., Chen, H., Lin, A., & Suganthan, P. N. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.053 · Cited by 386
Research works printed but not linked: 27
- Das, 2016, Recent advances in differential evolution – an updated survey, Swarm Evol. Comput., 27, 1, 10.1016/j.swevo.2016.01.004 · DOI · Paper page
- Brest, 2006, Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems, IEEE Trans. Evol. Comput., 10, 646, 10.1109/TEVC.2006.872133 · DOI · Paper page
- Qin, 2009, Differential evolution algorithm with strategy adaptation for global numerical optimization, IEEE Trans. Evol. Comput., 13, 398, 10.1109/TEVC.2008.927706 · DOI · Paper page
- Das, 2009, Differential evolution using a neighborhood-based mutation operator, IEEE Trans. Evol. Comput., 13, 526, 10.1109/TEVC.2008.2009457 · DOI · Paper page
- Mininno, 2011, Compact differential evolution, IEEE Trans. Evol. Comput., 15, 32, 10.1109/TEVC.2010.2058120 · DOI · Paper page
- Qu, 2012, Differential evolution with neighborhood mutation for multimodal optimization, IEEE Trans. Evol. Comput., 16, 601, 10.1109/TEVC.2011.2161873 · DOI · Paper page
- Brest, 2013, Differential evolution and differential ant-stigmergy on dynamic optimisation problems, Int. J. Syst. Sci., 44, 663, 10.1080/00207721.2011.617899 · DOI
- R. D. Al-Dabbagh, F. Neri, N. Idris, M. S. Baba, Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy, Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2018.03.008. · DOI · Paper page
- Zhang, 2009, JADE: adaptive differential evolution with optional external archive, IEEE Trans. Evol. Comput., 13, 945, 10.1109/TEVC.2009.2014613 · DOI · Paper page
- A. P. Piotrowski, J. J. Napiorkowski, Step-by-step improvement of JADE and SHADE-based algorithms: Success or failure?, Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2018.03.007. · DOI
- Piotrowski, 2018, Al-shade optimization algorithms with population-wide inertia, Inf. Sci., 468, 117, 10.1016/j.ins.2018.08.030 · DOI
- Suganthan, 1999, Particle swarm optimiser with neighbourhood operator, vol. 3, 1958
- Neri, 2010, Recent advances in differential evolution: a survey and experimental analysis, Artif. Intell. Rev., 33, 61, 10.1007/s10462-009-9137-2 · DOI · Paper page
- Das, 2011, Real-parameter evolutionary multimodal optimization – a survey of the state-of-the-art, Swarm Evol. Comput., 1, 71, 10.1016/j.swevo.2011.05.005 · DOI · Paper page
- Mezura-Montes, 2011, Constraint-handling in nature-inspired numerical optimization: past, present and future, Swarm Evol. Comput., 1, 173, 10.1016/j.swevo.2011.10.001 · DOI · Paper page
- Zhou, 2011, Multiobjective evolutionary algorithms: a survey of the state of the art, Swarm Evol. Comput., 1, 32, 10.1016/j.swevo.2011.03.001 · DOI · Paper page
- Neri, 2012, Memetic algorithms and memetic computing optimization: a literature review, Swarm Evol. Comput., 2, 1, 10.1016/j.swevo.2011.11.003 · DOI · Paper page
- Zamuda, 2015, Self-adaptive control parameters' randomization frequency and propagations in differential evolution, Swarm Evol. Comput., 25, 72, 10.1016/j.swevo.2015.10.007 · DOI
- Piotrowski, 2017, Review of differential evolution population size, Swarm Evol. Comput., 32, 1, 10.1016/j.swevo.2016.05.003 · DOI · Paper page
- Zaharie, 2009, Influence of crossover on the behavior of differential evolution algorithms, Appl. Soft Comput., 9, 1126, 10.1016/j.asoc.2009.02.012 · DOI · Paper page
- Weber, 2013, A study on scale factor/crossover interaction in distributed differential evolution, Artif. Intell. Rev., 39, 195, 10.1007/s10462-011-9267-1 · doi:10.1007/s10462-011-9267-1
- Poikolainen, 2015, Cluster-Based Population Initialization for differential evolution frameworks, Inf. Sci., 297, 216, 10.1016/j.ins.2014.11.026 · DOI
- K. R. Opara, J. Arabas, Differential Evolution: A survey of theoretical analyses, Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2018.06.010. · DOI · Paper page
- Karafotias, 2015, Parameter control in evolutionary algorithms: trends and challenges, evolutionary computation, IEEE Trans., 19, 167
- Piotrowski, 2018, Some metaheuristics should be simplified, Inf. Sci., 427, 32, 10.1016/j.ins.2017.10.039 · DOI
- Ester, 1996, A density-based algorithm for discovering clusters in large spatial databases with noise, vol. 96, 226
- Demšar, 2006, Statistical comparisons of classifiers over multiple data sets, J. Mach. Learn. Res., 7, 1
Cited by
Ghosh, A., Das, S., Das, A. K., Senkerik, R., Viktorin, A., Zelinka, I., & Masegosa, A. D. (2022) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2022.101057 · Cited by 56
Self-citationEnhancing differential evolution algorithm with a fitness-distance-based selection strategy
Huang, Y., Qian, X., & Song, W. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06298-0 · Cited by 5
Metadata
- Authors
- Viktorin, A., Senkerik, R., Pluhacek, M., Kadavy, T., & Zamuda, A.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2019-11
- Volume
- 50
- Pages
- 100462
- ISSN
- 2210-6502
- Cited by
- 148
- References
- 2
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- doi.org/10.15223/policy-017 (stm-asf)
- doi.org/10.15223/policy-037 (stm-asf)
- doi.org/10.15223/policy-012 (stm-asf)
- doi.org/10.15223/policy-029 (stm-asf)
- doi.org/10.15223/policy-004 (stm-asf)
- Funders
- Ministry of Education, Youth and Sports of the Czech Republic (MSMT-7778/2014)
- European Regional Development Fund (CZ.1.05/2.1.00/03.0089)
- Tomas Bata University (IGA/CebiaTech/2018/003)
- Slovenian Research Agency (P2-0041)
- COST (CA15140, IC1406)
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: Distance based parameter adaptation for Success-History based Differential Evolution. https://app.cochat.ai/papers/10.1016/j.swevo.2018.10.013
- The paper
- Viktorin, A., Senkerik, R., Pluhacek, M., Kadavy, T., & Zamuda, A. (2019). Distance based parameter adaptation for Success-History based Differential Evolution. Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2018.10.013
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.