The DOI matches its Crossref record.
Metaheuristics: From Design to Implementation
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
Cited by
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
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
An improved grey wolf optimizer for solving engineering problems
Nadimi-Shahraki, M. H., Taghian, S., & Mirjalili, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113917 · Cited by 1,153
Resource Allocation in NFV: A Comprehensive Survey
Gil Herrera, J., & Botero, J. F. (2016) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2016.2598420 · Cited by 904
Sand Cat swarm optimization: a nature-inspired algorithm to solve global optimization problems
Seyyedabbasi, A., & Kiani, F. (2023) · Engineering with Computers · doi:10.1007/s00366-022-01604-x · Cited by 759
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Multiobjective firefly algorithm for continuous optimization
Yang, X.-S. (2013) · Engineering with Computers · doi:10.1007/s00366-012-0254-1 · Cited by 513
Mohamed, A. W., Hadi, A. A., & Mohamed, A. K. (2020) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-019-01053-x · Cited by 501
Artificial ecosystem-based optimization: a novel nature-inspired meta-heuristic algorithm
Zhao, W., Wang, L., & Zhang, Z. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04452-x · Cited by 499
Binary Optimization Using Hybrid Grey Wolf Optimization for Feature Selection
Al-Tashi, Q., Abdul Kadir, S. J., Rais, H. M., Mirjalili, S., & Alhussian, H. (2019) · IEEE Access · doi:10.1109/access.2019.2906757 · Cited by 487
Abdollahzadeh, B., Khodadadi, N., Barshandeh, S., Trojovský, P., Gharehchopogh, F. S., El-kenawy, E.-S. M., Abualigah, L., & Mirjalili, S. (2024) · Cluster Computing · doi:10.1007/s10586-023-04221-5 · Cited by 479
Houssein, E. H., Hammad, A., & Ali, A. A. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07292-4 · Cited by 426
Metaheuristics: review and application
Gogna, A., & Tayal, A. (2013) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813x.2013.782347 · Cited by 355
Rich Vehicle Routing Problem: Survey
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2015) · ACM Computing Surveys · doi:10.1145/2666003 · Cited by 280
Hunter–prey optimization: algorithm and applications
Naruei, I., Keynia, F., & Sabbagh Molahosseini, A. (2022) · Soft Computing · doi:10.1007/s00500-021-06401-0 · Cited by 264
Fast Genetic Algorithm Path Planner for Fixed-Wing Military UAV Using GPU
Roberge, V., Tarbouchi, M., & Labonte, G. (2018) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2018.2807558 · Cited by 260
Simulated Annealing Algorithm for Deep Learning
Rere, L. M. R., Fanany, M. I., & Arymurthy, A. M. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.12.114 · Cited by 192
Mafarja, M., Thaher, T., Al-Betar, M. A., Too, J., Awadallah, M. A., Abu Doush, I., & Turabieh, H. (2023) · Applied Intelligence · doi:10.1007/s10489-022-04427-x · Cited by 91
Optimizing Virtual Machine placement in IaaS data centers: Taxonomy, review and open issues
Talebian, H., Gani, A., Sookhak, M., Abdelatif, A. A., Yousafzai, A., Vasilakos, A. V., & Yu, F. R. (2020) · Cluster Computing · doi:10.1007/s10586-019-02954-w · Cited by 72
Workflow for generating competing hypothesis from models with parameter uncertainty
Gomez-Cabrero, D., Compte, A., & Tegner, J. (2011) · Interface Focus · doi:10.1098/rsfs.2011.0015 · Cited by 33
Optimal Computational Power Allocation in Multi-Access Mobile Edge Computing for Blockchain
Wu, Y., Chen, X., Shi, J., Ni, K., Qian, L., Huang, L., & Zhang, K. (2018) · Sensors · doi:10.3390/s18103472 · Cited by 20
Metadata
- Authors
- Talbi, E.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2009-06
- OpenAlex
- W4246565613
- Cited by
- 2,380
- References
- 0
- FWCI
- 16.69
- Type
- book
- 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.