The DOI matches its Crossref record.
Engineering Optimization: An Introduction with Metaheuristic Applications
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
Firefly Algorithms for Multimodal Optimization
Yang, X.-S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04944-6_14 · Cited by 4,075
Self-citationFlower Pollination Algorithm for Global Optimization
Yang, X.-S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32894-7_27 · Cited by 1,630
Self-citationAn effective co-evolutionary particle swarm optimization for constrained engineering design problems
He, Q., & Wang, L. (2007) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2006.03.003 · Cited by 1,105
Cuckoo search: recent advances and applications
Yang, X.-S., & Deb, S. (2014) · Neural Computing and Applications · doi:10.1007/s00521-013-1367-1 · Cited by 1,066
Self-citationFirefly Algorithm, Lévy Flights and Global Optimization
Yang, X.-S. (2010) · Research and Development in Intelligent Systems XXVI · doi:10.1007/978-1-84882-983-1_15 · Cited by 962
Self-citationConstraint-handling in genetic algorithms through the use of dominance-based tournament selection
Coello Coello, C. A., & Mezura Montes, E. (2002) · Advanced Engineering Informatics · doi:10.1016/s1474-0346(02)00011-3 · Cited by 868
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Flower pollination algorithm: A novel approach for multiobjective optimization
Yang, X.-S., Karamanoglu, M., & He, X. (2014) · Engineering Optimization · doi:10.1080/0305215x.2013.832237 · Cited by 629
Self-citationMultiobjective firefly algorithm for continuous optimization
Yang, X.-S. (2013) · Engineering with Computers · doi:10.1007/s00366-012-0254-1 · Cited by 513
Self-citationPark, G.-J., Lee, T.-H., Lee, K. H., & Hwang, K.-H. (2006) · AIAA Journal · doi:10.2514/1.13639 · Cited by 493
Chaos-enhanced accelerated particle swarm optimization
Gandomi, A. H., Yun, G. J., Yang, X.-S., & Talatahari, S. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.07.017 · Cited by 396
Self-citationGomes, G. F., da Cunha, S. S., & Ancelotti, A. C. (2019) · Engineering with Computers · doi:10.1007/s00366-018-0620-8 · Cited by 363
Hybrid approaches to optimization and machine learning methods: a systematic literature review
Azevedo, B. F., Rocha, A. M. A. C., & Pereira, A. I. (2024) · Machine Learning · doi:10.1007/s10994-023-06467-x · Cited by 291
Multi-Sequence LSTM-RNN Deep Learning and Metaheuristics for Electric Load Forecasting
Bouktif, S., Fiaz, A., Ouni, A., & Serhani, M. A. (2020) · Energies · doi:10.3390/en13020391 · Cited by 256
“In our case, metaheuristics will select from an infinite number of configurations the appropriate lags as well as the best parameter setting for an accurate time series analysis using deep learning [13].”
BackgroundSimulated 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
Deb, S., Fong, S., Tian, Z., Wong, R. K., Mohammed, S., & Fiaidhi, J. (2016) · The Journal of Supercomputing · doi:10.1007/s11227-016-1739-2 · Cited by 25
“Metaheuristic search algorithms have been adopted widely for finding an optimal solution within a reasonable time-frame in many applications for different domains, including engineering design, financial optimization, scheduling or computer network routing [4].”
Method
Metadata
- Authors
- Yang, X.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2010-06-21
- OpenAlex
- W4253572765
- Cited by
- 1,248
- References
- 0
- FWCI
- 9.97
- 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.