The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A hybrid simplex search and particle swarm optimization for unconstrained optimization
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
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
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
A Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,527
Cited by
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2012) · Information Sciences · doi:10.1016/j.ins.2011.08.006 · Cited by 1,792
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
A hybrid genetic algorithm and particle swarm optimization for multimodal functions
Kao, Y.-T., & Zahara, E. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.07.002 · Cited by 555
Self-citationRao, R. V., & Patel, V. (2012) · Scientia Iranica · doi:10.1016/j.scient.2012.12.005 · Cited by 384
Frankenstein's PSO: A Composite Particle Swarm Optimization Algorithm
Montes de Oca, M. A., Stutzle, T., Birattari, M., & Dorigo, M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2021465 · Cited by 366
Zahara, E., & Kao, Y.-T. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.02.039 · Cited by 339
Self-citationA note on teaching–learning-based optimization algorithm
Črepinšek, M., Liu, S.-H., & Mernik, L. (2012) · Information Sciences · doi:10.1016/j.ins.2012.05.009 · Cited by 296
Chen, H., Jiao, S., Heidari, A. A., Wang, M., Chen, X., & Zhao, X. (2019) · Energy Conversion and Management · doi:10.1016/j.enconman.2019.05.057 · Cited by 287
Particle swarm optimization: Hybridization perspectives and experimental illustrations
Thangaraj, R., Pant, M., Abraham, A., & Bouvry, P. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.12.053 · Cited by 264
Metadata
- Authors
- Fan, S.-K. S., & Zahara, E.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2007-09
- Volume
- 181
- Issue
- 2
- Pages
- 527-548
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1978740922
- Cited by
- 350
- References
- 27
- FWCI
- 16.46
- 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.