The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Fitness Dependent Optimizer: Inspired by the Bee Swarming Reproductive Process
Open accessAbstract
In this paper, a novel swarm intelligent algorithm is proposed, known as the fitness dependent optimizer (FDO). The bee swarming the reproductive process and their collective decision-making have inspired this algorithm; it has no algorithmic connection with the honey bee algorithm or the artificial bee colony algorithm. It is worth mentioning that the FDO is considered a particle swarm optimization (PSO)-based algorithm that updates the search agent position by adding velocity (pace). However, the FDO calculates velocity differently; it uses the problem fitness function value to produce weights, and these weights guide the search agents during both the exploration and exploitation phases. Throughout this paper, the FDO algorithm is presented, and the motivation behind the idea is explained. Moreover, the FDO is tested on a group of 19 classical benchmark test functions, and the results are compared with three well-known algorithms: PSO, the genetic algorithm (GA), and the dragonfly algorithm (DA); in addition, the FDO is tested on the IEEE Congress of Evolutionary Computation Benchmark Test Functions (CEC-C06, 2019 Competition) [1]. The results are compared with three modern algorithms: (DA), the whale optimization algorithm (WOA), and the salp swarm algorithm (SSA). The FDO results show better performance in most cases and comparative results in other cases. Furthermore, the results are statistically tested with the Wilcoxon rank-sum test to show the significance of the results. Likewise, the FDO stability in both the exploration and exploitation phases is verified and performance-proofed using different standard measurements. Finally, the FDO is applied to real-world applications as evidence of its feasibility.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
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
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Mirjalili, S. (2016) · Neural Computing and Applications · doi:10.1007/s00521-015-1920-1 · Cited by 2,765
A study of particle swarm optimization particle trajectories
VANDENBERGH, F., & ENGELBRECHT, A. (2006) · Information Sciences · doi:10.1016/j.ins.2005.02.003 · Cited by 1,397
An introduction to genetic algorithms
Deb, K. (1999) · Sadhana · doi:10.1007/bf02823145 · Cited by 1,176
Firefly algorithm: recent advances and applications
Yang, X. S., & He, X. (2013) · International Journal of Swarm Intelligence · doi:10.1504/ijsi.2013.055801 · Cited by 858
Jin, N., & Rahmat-Samii, Y. (2007) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2007.891552 · Cited by 805
A survey on metaheuristics for stochastic combinatorial optimization
Bianchi, L., Dorigo, M., Gambardella, L. M., & Gutjahr, W. J. (2009) · Natural Computing · doi:10.1007/s11047-008-9098-4 · Cited by 737
Firefly Algorithm: Recent Advances and ApplicationsPreprint
Yang, X.-S., & He, X. (2013) · Cited by 708
A Brief Review of Nature-Inspired Algorithms for Optimization
Fister, I., Yang, X., Fister, I., Brest, J., & Fister, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4186 · Cited by 388
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
Nakrani, S., & Tovey, C. A. (2004) · Adaptive Behavior · doi:10.1177/105971230401200308 · Cited by 295
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50059-3 · Cited by 210
Cui, L., Li, G., Zhu, Z., Lin, Q., Wen, Z., Lu, N., Wong, K., & Chen, J. (2017) · Information Sciences · doi:10.1016/j.ins.2017.05.044 · Cited by 102
The mechanism of flight guidance in honeybee swarms: subtle guides or streaker bees?
Schultz, K., Passino, K. M., & Seeley, T. D. (2008) · Journal of Experimental Biology · doi:10.1242/jeb.018994 · Cited by 87
An enhanced artificial bee colony algorithm with dual-population framework
Cui, L., Li, G., Luo, Y., Chen, F., Ming, Z., Lu, N., & Lu, J. J. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.05.002 · Cited by 54
Swarming Honey Bees Guided by Pheromones1
Avitabile, A., Morse, R. A., & Boch, R. (1975) · Annals of the Entomological Society of America · doi:10.1093/aesa/68.6.1079 · Cited by 50
Metaheuristics in Stochastic Combinatorial Optimization: a Survey
Bianchi, L., Dorigo, M., & Gambardella, L. M. (2006) · SUPSI ARIS · doi:10.71910/supsi.6876 · Cited by 32
Cited by
Snake Optimizer: A novel meta-heuristic optimization algorithm
Hashim, F. A., & Hussien, A. G. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108320 · Cited by 1,106
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Wild horse optimizer: a new meta-heuristic algorithm for solving engineering optimization problems
Naruei, I., & Keynia, F. (2022) · Engineering with Computers · doi:10.1007/s00366-021-01438-z · Cited by 464
A new optimization method based on COOT bird natural life model
Naruei, I., & Keynia, F. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115352 · Cited by 427
A stochastic configuration network based on chaotic sparrow search algorithm
Zhang, C., & Ding, S. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106924 · Cited by 342
Metadata
- Authors
- Abdullah, J. M., & Ahmed, T.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 43473-43486
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2933860896
- Cited by
- 301
- References
- 27
- FWCI
- 17.15
- Type
- journal article
- Language
- en
- Open access
- gold
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.