Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior?
Anežka Kazíková, Michal Pluháček, Roman Šenkeřík
IEEE Access (2021) Vol. 9, pp. 44032-44048
Open Access | Times Cited: 25

Showing 25 citing articles:

Maximum number of generations as a stopping criterion considered harmful
Miha Ravber, Shih-Hsi Liu, Marjan Mernik, et al.
Applied Soft Computing (2022) Vol. 128, pp. 109478-109478
Open Access | Times Cited: 32
NSGA-III integrating eliminating strategy and dynamic constraint relaxation mechanism to solve many-objective optimal power flow problem
Jingrui Zhang, Junfeng Cai, Hongcai Zhang, et al.
Applied Soft Computing (2023) Vol. 146, pp. 110612-110612
Closed Access | Times Cited: 15
A Pose-Based Feature Fusion and Classification Framework for the Early Prediction of Cerebral Palsy in Infants
Kevin D. McCay, Pengpeng Hu, Hubert P. H. Shum, et al.
IEEE Transactions on Neural Systems and Rehabilitation Engineering (2021) Vol. 30, pp. 8-19
Open Access | Times Cited: 30
On the assessment of meta-heuristic algorithms for automatic voltage regulator system controller design: a standardization process
Bora Çavdar, Erdinç Şahin, Erhan Sesli
Electrical Engineering (2024) Vol. 106, Iss. 5, pp. 5801-5839
Closed Access | Times Cited: 3
Choice of benchmark optimization problems does matter
A. Piotrowski, Jarosław J. Napiórkowski, Agnieszka E. Piotrowska
Swarm and Evolutionary Computation (2023) Vol. 83, pp. 101378-101378
Closed Access | Times Cited: 8
Philippine Eagle Optimization Algorithm
Erika Antonette T. Enriquez, Renier Mendoza, Arrianne Crystal Velasco
IEEE Access (2022) Vol. 10, pp. 29089-29120
Open Access | Times Cited: 11
A Performance Indicator for Interactive Evolutionary Multiobjective Optimization Methods
Pouya Aghaei Pour, Sunith Bandaru, Bekir Afşar, et al.
IEEE Transactions on Evolutionary Computation (2023) Vol. 28, Iss. 3, pp. 778-787
Open Access | Times Cited: 6
An Error Bound Particle Swarm Optimization for Analog Circuit Sizing
K. G. Shreeharsha, R. K. Siddharth, M. H. Vasantha, et al.
IEEE Access (2024) Vol. 12, pp. 50126-50136
Open Access | Times Cited: 1
Counterfactual Explanations With Multiple Properties in Credit Scoring
Xolani Dastile, Turgay Çelik
IEEE Access (2024) Vol. 12, pp. 110713-110728
Open Access | Times Cited: 1
Impact of Boundary Control Methods on Bound-Constrained Optimization Benchmarking
Tomáš Kadavý, Adam Viktorin, Anežka Kazíková, et al.
IEEE Transactions on Evolutionary Computation (2022) Vol. 26, Iss. 6, pp. 1271-1280
Open Access | Times Cited: 6
Calibration of conceptual rainfall-runoff models by selected differential evolution and particle swarm optimization variants
Jarosław J. Napiórkowski, A. Piotrowski, Emilia Karamuz, et al.
Acta Geophysica (2022) Vol. 71, Iss. 5, pp. 2325-2338
Open Access | Times Cited: 6
How Much Do Swarm Intelligence and Evolutionary Algorithms Improve Over a Classical Heuristic From 1960?
A. Piotrowski, Jarosław J. Napiórkowski, Agnieszka E. Piotrowska
IEEE Access (2023) Vol. 11, pp. 19775-19793
Open Access | Times Cited: 2
To what extent evolutionary algorithms can benefit from a longer search?
A. Piotrowski, Jarosław J. Napiórkowski, Agnieszka E. Piotrowska
Information Sciences (2023) Vol. 654, pp. 119766-119766
Closed Access | Times Cited: 2
More is not Always Better: Insights from a Massive Comparison of Meta-heuristic Algorithms over Real-Parameter Optimization Problems
Javier Del Ser, Eneko Osaba, Aritz D. Martinez, et al.
2021 IEEE Symposium Series on Computational Intelligence (SSCI) (2021), pp. 1-7
Closed Access | Times Cited: 5
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems
Pouya Aghaei Pour, Jussi Hakanen, Kaisa Miettinen
Journal of Global Optimization (2024) Vol. 90, Iss. 2, pp. 459-485
Open Access
Soccer Match Algorithm for Global Optimization: A Contender Metaheuristic
R. Ammar, Anis Gharbi, M. Zied Babaï
IEEE Access (2024) Vol. 12, pp. 93924-93945
Open Access
Empowered chaotic local search-based differential evolution algorithm with entropy-based hybrid objective function for brain tumor segmentation
Salih Berkan Aydemı̇r, Funda Kutlu Onay, Emre Yalcin
Biomedical Signal Processing and Control (2024) Vol. 96, pp. 106631-106631
Closed Access
Confidence Bands Based on Rating Demonstrated on the CEC 2021 Competition Results
Miha Ravber, Marjan Mernik, Shih-Hsi Liu, et al.
2022 IEEE Congress on Evolutionary Computation (CEC) (2024), pp. 1-8
Closed Access
Metaheuristics should be tested on large benchmark set with various numbers of function evaluations
A. Piotrowski, Jarosław J. Napiórkowski, Agnieszka E. Piotrowska
Swarm and Evolutionary Computation (2024) Vol. 92, pp. 101807-101807
Closed Access
Symbiotic Operation Forest (SOF): A novel approach to supervised machine learning
Min‐Yuan Cheng, Akhmad F.K. Khitam
Swarm and Evolutionary Computation (2024) Vol. 86, pp. 101532-101532
Closed Access
Solving the Electricity Technician Dispatch Problem
Mehdi Sadeghilalimi, Malek Mouhoub, Haifa Zaidi, et al.
(2023), pp. 23-30
Closed Access | Times Cited: 1
Economic dispatch using modified bat algorithm
Wenqiang Yang, Ran Li, Ying Yuan, et al.
Frontiers in Energy Research (2022) Vol. 10
Open Access | Times Cited: 2
Improved Drosophila Food-Search Algorithm for Structural and Mechanical Optimization Problems
Ali Mortazavi
(2023), pp. 53-65
Closed Access
Proceedings of the 9th Student Computing Research Symposium

(2023)
Open Access
How to Set the Maximum Number of Function Evaluations for the L-SHADE Algorithm with the 𝐴𝑆3𝐷 Approach?
Jana Herzog, Janez Brest, Borko Bošković
(2023)
Open Access
Page 1

Scroll to top