Fitness-distance balance (FDB): A new selection method for meta-heuristic search algorithms
The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
Abstract Selection methods have an important role in the meta-heuristic search (MHS) process. However, apart from a few successful methods developed in the past, new and effective studies have not been found in recent years. It is known that solution candidates selecting from the population during the search process directly affects the direction and success of the search. In this study, a new selection method based on fitness-distance balance (FDB) is developed in order to solve the premature convergence problem in the MHS process. Thanks to the developed method, solution candidates with the highest potential to improve the search process can be determined effectively and consistently from the population. Experimental studies have been conducted to test and verify the developed FDB selection method. For this purpose, 90 benchmark functions with different types and complexity levels have been used. In order to test the developed FDB method, numerous variants have been formed. These variants have been compared to each other to determine the most effective FDB variant. In the validation study, the FDB-SOS (FDB-based symbiotic organism search) algorithm is compared with thirteen well-known and up-to-date MHS techniques. The search performance of the algorithms has been analyzed by the Wilcoxon Rank Sum Test. The results show that the developed selection method makes a significant contribution to the meta-heuristic search process.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
SCA: A Sine Cosine Algorithm for solving optimization problems
Mirjalili, S. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.022 · Cited by 5,696
Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems
Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., & Mirjalili, S. M. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.07.002 · Cited by 5,082
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Mirjalili, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.07.006 · Cited by 4,626
Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
Butterfly optimization algorithm: a novel approach for global optimization
Arora, S., & Singh, S. (2019) · Soft Computing · doi:10.1007/s00500-018-3102-4 · Cited by 1,719
Symbiotic Organisms Search: A new metaheuristic optimization algorithm
Cheng, M.-Y., & Prayogo, D. (2014) · Computers & Structures · doi:10.1016/j.compstruc.2014.03.007 · Cited by 1,575
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
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
Backtracking Search Optimization Algorithm for numerical optimization problems
Civicioglu, P. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.02.017 · Cited by 1,018
A novel nature-inspired algorithm for optimization: Squirrel search algorithm
Jain, M., Singh, V., & Rani, A. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.02.013 · Cited by 961
Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
Wang, G.-G. (2018) · Memetic Computing · doi:10.1007/s12293-016-0212-3 · Cited by 780
Emperor penguin optimizer: A bio-inspired algorithm for engineering problems
Dhiman, G., & Kumar, V. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.06.001 · Cited by 720
Colliding bodies optimization: A novel meta-heuristic method
Kaveh, A., & Mahdavi, V. R. (2014) · Computers & Structures · doi:10.1016/j.compstruc.2014.04.005 · Cited by 687
A novel meta-heuristic optimization algorithm: Thermal exchange optimization
Kaveh, A., & Dadras, A. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.03.014 · Cited by 664
Shareef, H., Ibrahim, A. A., & Mutlag, A. H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.07.028 · Cited by 422
A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning
Gao, W.-F., Liu, S.-Y., & Huang, L.-L. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2222373 · Cited by 397
MPSO: Modified particle swarm optimization and its applications
Tian, D., & Shi, Z. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.01.011 · Cited by 363
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Rardin, R. L., & Uzsoy, R. (2001) · Journal of Heuristics · doi:10.1023/a:1011319115230 · Cited by 332
Nenavath, H., & Jatoth, R. K. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.09.039 · Cited by 310
Chaotic gravitational constants for the gravitational search algorithm
Mirjalili, S., & Gandomi, A. H. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.01.008 · Cited by 294
An exploration-enhanced grey wolf optimizer to solve high-dimensional numerical optimization
Long, W., Jiao, J., Liang, X., & Tang, M. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.10.024 · Cited by 290
Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization
Mohamed, A. W., Hadi, A. A., & Jambi, K. M. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.10.006 · Cited by 266
Tree Growth Algorithm (TGA): A novel approach for solving optimization problems
Cheraghalipour, A., Hajiaghaei-Keshteli, M., & Paydar, M. M. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.04.021 · Cited by 239
Improved sine cosine algorithm with crossover scheme for global optimization
Gupta, S., & Deep, K. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.12.008 · Cited by 180
Salcedo-Sanz, S. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.08.001 · Cited by 175
Improved bat algorithm with optimal forage strategy and random disturbance strategy
Cai, X., Gao, X. Z., & Xue, Y. (2016) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2016.078666 · Cited by 165
Particle Swarm Optimization With Interswarm Interactive Learning Strategy
Qin, Q., Cheng, S., Zhang, Q., Li, L., & Shi, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2474153 · Cited by 139
Review on meta-heuristics approaches for airside operation research
Ng, K. K. H., Lee, C. K. M., Chan, F. T. S., & Lv, Y. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.02.013 · Cited by 120
Particle swarm optimization using dynamic tournament topology
Wang, L., Yang, B., & Orchard, J. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.07.041 · Cited by 119
Adaptive multiple-elites-guided composite differential evolution algorithm with a shift mechanism
Cui, L., Li, G., Zhu, Z., Lin, Q., Wong, K., Chen, J., Lu, N., & Lu, J. J. (2017) · Information Sciences · doi:10.1016/j.ins.2017.09.002 · Cited by 115
A Dynamic Neighborhood Learning-Based Gravitational Search Algorithm
Zhang, A., Sun, G., Ren, J., Li, X., Wang, Z., & Jia, X. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2641986 · Cited by 89
How novel is the “novel” black hole optimization approach?
Piotrowski, A., Napiorkowski, J. J., & Rowiński, P. M. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.026 · Cited by 88
Tian, M., & Gao, X. (2018) · Information Sciences · doi:10.1016/j.ins.2018.11.021 · Cited by 85
Step-by-step improvement of JADE and SHADE-based algorithms: Success or failure?
Piotrowski, A., & Napiorkowski, J. J. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.03.007 · Cited by 83
Lopez‐Rincon, A., Tonda, A. P., Elati, M., Schwander, O., Piwowarski, B., & Gallinari, P. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.12.036 · Cited by 65
Jana, B., Mitra, S., & Acharyya, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.09.027 · Cited by 60
Comparison of nature-inspired population-based algorithms on continuous optimisation problems
Bujok, P., Tvrdík, J., & Poláková, R. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.01.006 · Cited by 49
A novel orthogonal PSO algorithm based on orthogonal diagonalization
Al-Bahrani, L. T., & Patra, J. C. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.12.004 · Cited by 46
Sequence-Based Deterministic Initialization for Evolutionary Algorithms
Elsayed, S. M., Sarker, R. A., & Coello, C. A. C. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2630722 · Cited by 39
Cesare, N. D., & Domaszewski, M. (2018) · Computers & Structures · doi:10.1016/j.compstruc.2018.11.006 · Cited by 35
Caraveo, C., Valdez, F., & Castillo, O. (2018) · Soft Computing · doi:10.1007/s00500-018-3188-8 · Cited by 32
Cited by
Zhong, C., Li, G., Meng, Z., Li, H., Yildiz, A. R., & Mirjalili, S. (2025) · Neural Computing and Applications · doi:10.1007/s00521-024-10694-1 · Cited by 332
Metadata
- Authors
- Kahraman, H. T., Aras, S., & Gedikli, E.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2020-02
- Volume
- 190
- Pages
- 105169
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2984153401
- Cited by
- 300
- References
- 49
- FWCI
- 5.87
- Type
- journal article
- 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
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.