The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
FBI inspired meta-optimization
Abstract
This study developed a novel optimization algorithm, called Forensic-Based Investigation (FBI), inspired by the suspect investigation–location–pursuit process that is used by police officers. Although numerous unwieldy optimization algorithms hamper their usability by requiring predefined operating parameters, FBI is a user-friendly algorithm that does not require predefined operating parameters. The performance of parameter-free FBI was validated using four experiments: (1) The robustness and efficiency of FBI were compared with those of 12 representations of the top leading metaphors by using 50 renowned multidimensional benchmark problems. The result indicated that FBI remarkably outperformed all other algorithms. (2) FBI was applied to solve a resource-constrained scheduling problem associated with a highway construction project. The experiment demonstrated that FBI yielded the shortest schedule with a success rate of 100%, indicating its stability and robustness. (3) FBI was utilized to solve 30 benchmark functions that were most recently presented at the IEEE Congress on Evolutionary Computation (CEC) competition on bound-constrained problems. Its performance was compared with those of the three winners in CEC to validate its effectiveness. (4) FBI solved high-dimensional problems, by increasing the number of dimensions of benchmark functions to 1000. FBI is efficient because it requires a relatively short computational time for solving problems, it reaches the optimal solution more rapidly than other algorithms, and it efficaciously solves high-dimensional problems. Given that the experiments demonstrated FBI’s robustness, efficiency, stability, and user-friendliness, FBI is promising for solving various complex problems. Finally, this study provided the scientific community with a metaheuristic optimization platform for graphically and logically manipulating optimization 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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Genetic Algorithms and Engineering Optimization
Gen, M., & Cheng, R. (1999) · doi:10.1002/9780470172261 · Cited by 2,548
Cited by
A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean
Chou, J.-S., & Truong, D.-N. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2020.125535 · Cited by 606
Self-citationThirunavukkarasu, M., Sawle, Y., & Lala, H. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113192 · Cited by 543
Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications
Zhao, S., Zhang, T., Ma, S., & Chen, M. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105075 · Cited by 492
Sea-horse optimizer: a novel nature-inspired meta-heuristic for global optimization problems
Zhao, S., Zhang, T., Ma, S., & Wang, M. (2023) · Applied Intelligence · doi:10.1007/s10489-022-03994-3 · Cited by 328
Metadata
- Authors
- Chou, J.-S., & Nguyen, N.-M.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2020-08
- Volume
- 93
- Pages
- 106339
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W3022139725
- Cited by
- 194
- References
- 2
- FWCI
- 9.57
- Type
- journal article
- 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.