The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A novel search algorithm based on fish school behavior
Abstract
Search problems are sometimes hard to compute. This is mainly due to the high dimensionality of some search spaces. Unless suitable approaches are used, search processes can be time-consuming and ineffective. Nature has evolved many complex systems able to deal with such difficulties. Fish schools, for instance, benefit greatly from the large number of constituent individuals in order to increase mutual survivability. In this paper we introduce a novel approach for searching in high-dimensional spaces taking into account behaviors drawn from fish schools. The derived algorithm - Fish-School Search (FSS) - is mainly composed of three operators: feeding, swimming and breeding. Together these operators afford the evoked computation: (i) wide-ranging search abilities, (ii) automatic capability to switch between exploration and exploitation, and (iii) self-adaptable global guidance for the search process. This paper includes a detailed description of the novel algorithm. Finally, we present simulations where the FSS algorithm is compared with, and in some cases outperforms, well-known intelligent algorithms such as Particle Swarm Optimization in high-dimensional searches.
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 13×
“All the PSO simulations included 30 trials, each of which performed 300,000 evaluations, and simulations that considered 30 dimensions and used 30 particles.”
BackgroundInfluentialAnt colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Cited by
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Lion Optimization Algorithm (LOA): A nature-inspired metaheuristic algorithm
Yazdani, M., & Jolai, F. (2016) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2015.06.003 · Cited by 626
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
A Brief Review of Nature-Inspired Algorithms for Optimization
Fister, I., Yang, X., Fister, I., Brest, J., & Fister, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4186 · Cited by 388
Swarm Intelligence Algorithms for Feature Selection: A Review
Brezočnik, L., Fister, I., & Podgorelec, V. (2018) · Applied Sciences · doi:10.3390/app8091521 · Cited by 374
Metadata
- Authors
- Bastos Filho, C. J. A., de Lima Neto, F. B., Lins, A. J. C. C., Nascimento, A. I. S., & Lima, M. P.
- Venue
- 2008 IEEE International Conference on Systems, Man and Cybernetics
- Publisher
- IEEE
- Published
- 2008-10
- Pages
- 2646-2651
- ISSN
- 1062-922X (ISSN-L)
- OpenAlex
- W2147370611
- Cited by
- 222
- References
- 2
- FWCI
- 2.48
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A novel search algorithm based on fish school behavior. https://app.cochat.ai/papers/10.1109/icsmc.2008.4811695
- The paper
- Bastos Filho, C. J. A., de Lima Neto, F. B., Lins, A. J. C. C., Nascimento, A. I. S., & Lima, M. P. (2008). A novel search algorithm based on fish school behavior. 2008 IEEE International Conference on Systems, Man and Cybernetics. https://doi.org/10.1109/icsmc.2008.4811695
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.