The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems
Open accessAbstract
This paper presents a novel metaheuristic algorithm called queuing search (QS), which is inspired from human activities in queuing. Some common phenomena are considered in QS: (1) customers actively follow the queue that provides fast service; (2) each customer service is mainly affected by the staff or customer itself; and (3) a customer can be influenced by others during the service when the queue order is not strictly maintained. The performance of QS is tested on 30 bound-constrained benchmark functions scalable with 30 and 100 dimensions from CEC 2014, 5 standard and 4 challenging constrained engineering optimization problems. Meanwhile, comparisons are performed among the results of QS and some state-of-the-art or well-known metaheuristic algorithms.
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
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
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
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
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2010.12.015 · Cited by 5,150
Biogeography-Based Optimization
Simon, D. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.919004 · Cited by 4,305
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Self-citationEngineering Optimization Theory and Practice
Rao, S. S. (2019) · Wiley eBooks · doi:10.1002/9781119454816 · Cited by 3,578
Cited by
The Arithmetic Optimization Algorithm
Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., & Gandomi, A. H. (2021) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113609 · Cited by 2,928
Abdollahzadeh, B., Gharehchopogh, F. S., & Mirjalili, S. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107408 · Cited by 1,438
Henry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Golden eagle optimizer: A nature-inspired metaheuristic algorithm
Mohammadi-Balani, A., Dehghan Nayeri, M., Azar, A., & Taghizadeh-Yazdi, M. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.107050 · Cited by 480
Energy valley optimizer: a novel metaheuristic algorithm for global and engineering optimization
Azizi, M., Aickelin, U., A. Khorshidi, H., & Baghalzadeh Shishehgarkhaneh, M. (2023) · Scientific Reports · doi:10.1038/s41598-022-27344-y · Cited by 306
Metaheuristics: a comprehensive overview and classification along with bibliometric analysis
Ezugwu, A. E., Shukla, A. K., Nath, R., Akinyelu, A. A., Agushaka, J. O., Chiroma, H., & Muhuri, P. K. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09952-0 · Cited by 305
A Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
Sharma, M., & Kaur, P. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09412-6 · Cited by 303
Fick’s Law Algorithm: A physical law-based algorithm for numerical optimization
Hashim, F. A., Mostafa, R. R., Hussien, A. G., Mirjalili, S., & Sallam, K. M. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.110146 · Cited by 295
Zhang, Y., & Jin, Z. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113246 · Cited by 262
Metadata
- Authors
- Zhang, J., Xiao, M., Gao, L., & Pan, Q.
- Venue
- Applied Mathematical Modelling
- Publisher
- Elsevier BV
- Published
- 2018-11
- Volume
- 63
- Pages
- 464-490
- ISSN
- 0307-904X (ISSN-L)
- OpenAlex
- W2830592823
- Cited by
- 253
- References
- 40
- FWCI
- 9.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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.