Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 687

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Colliding bodies optimization: A novel meta-heuristic method

Kaveh, A., Mahdavi, V.R.·2014·Computers & Structures

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.compstruc.2014.04.005

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 24

  1. Dorigo, 1996, The ant system: optimization by a colony of cooperating agents, IEEE Trans Syst Man Cybern B, 26, 29, 10.1109/3477.484436 · DOI · Paper page
  2. Erol, 2006, New optimization method: big bang-big crunch, Adv Eng Softw, 37, 106, 10.1016/j.advengsoft.2005.04.005 · DOI · Paper page
  3. Kaveh, 2010, A novel heuristic optimization method: charged system search, Acta Mech, 213, 267, 10.1007/s00707-009-0270-4 · DOI · Paper page
  4. Kaveh, 2012, A novel meta-heuristic method: ray optimization, Comput Struct, 112–113, 283, 10.1016/j.compstruc.2012.09.003 · DOI
  5. Kaveh, 2014, Democratic PSO for truss layout and size optimization with frequency constraints, Comput Struct, 130, 10, 10.1016/j.compstruc.2013.09.002 · DOI
  6. Kaveh, 2013, A new optimization method: dolphin echolocation, Adv Eng Softw, 59, 53, 10.1016/j.advengsoft.2013.03.004 · DOI · Paper page
  7. Sadollah, 2012, Mine blast algorithm for optimization of truss structures with discrete variable, Comput Struct, 102, 49, 10.1016/j.compstruc.2012.03.013 · DOI
  8. Kaveh, 2013, Optimal design of structures with multiple natural frequency constraints using a hybridized BB-BC/Quasi-Newton algorithm, Period Polytech – Civil Eng, 57, 1, 10.3311/PPci.2139 · DOI
  9. Tsoulos, 2008, Modifications of real code genetic algorithm for global optimization, Appl Math Comput, 203, 598, 10.1016/j.amc.2008.05.005 · DOI
  10. Ragsdell, 1976, Optimal design of a class of welded structures using geometric programming, ASME J Eng Ind Ser B, 98, 1021, 10.1115/1.3438995 · DOI
  11. Deb, 1991, Optimal design of a welded beam via genetic algorithms, AIAA J, 29, 2013, 10.2514/3.10834 · DOI
  12. Coello, 2000, Use of a self-adaptive penalty approach for engineering optimization problems, Comput Ind, 41, 113, 10.1016/S0166-3615(99)00046-9 · DOI · Paper page
  13. Coello, 1992, Constraint-handling in genetic algorithms through the use of dominance-based tournament, IEEE Trans Reliability, 41, 576
  14. He, 2007, An effective co-evolutionary particle swarm optimization for constrained engineering design problem, Eng Appl Artif Intell, 20, 89, 10.1016/j.engappai.2006.03.003 · DOI · Paper page
  15. Montes, 2008, An empirical study about the usefulness of evolution strategies to solve constrained optimization problems, Int J Gen Syst, 37, 443, 10.1080/03081070701303470 · DOI
  16. Sandgren E. Nonlinear integer and discrete programming in mechanical design. In: Proceedings of the ASME design technology conference, Kissimine, FL; 1988. p. 95–105. · DOI
  17. Kannan, 1994, An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, Trans ASME J Mech Des, 116, 318, 10.1115/1.2919393 · DOI
  18. Belegundu AD. A study of mathematical programming methods for structural optimization. Ph.D. thesis, Department of Civil and Environmental Engineering, University of Iowa, Iowa, USA; 1982.
  19. Soh, 1996, Fuzzy controlled genetic algorithm search for shape optimization, J Comput Civil Eng, ASCE, 10, 143, 10.1061/(ASCE)0887-3801(1996)10:2(143) · doi:10.1061/(asce)0887-3801(1996)10:2(143
  20. Lee, 2004, A new structural optimization method based on the harmony search algorithm, Comput Struct, 82, 781, 10.1016/j.compstruc.2004.01.002 · DOI
  21. Kaveh, 2009, Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures, Comput Struct, 87, 267, 10.1016/j.compstruc.2009.01.003 · DOI
  22. Kaveh, 2013, An improved ray optimization algorithm for design of truss structures, Period Polytech – Civil Eng, 57, 97, 10.3311/PPci.7166 · DOI
  23. Saka, 1990, Optimum design of pin-jointed steel structures with practical applications, J Struct Eng, ASCE, 116, 2599, 10.1061/(ASCE)0733-9445(1990)116:10(2599) · doi:10.1061/(asce)0733-9445(1990)116:10(2599
  24. Degertekin, 2013, Sizing truss structures using teaching-learning-based optimization, Comput Struct, 119, 177, 10.1016/j.compstruc.2012.12.011 · DOI

Cited by

See all 687

Metadata

Authors
Kaveh, A., & Mahdavi, V. R.
Venue
Computers & Structures
Publisher
Elsevier BV
Published
2014-07
Volume
139
Pages
18-27
ISSN
0045-7949 (ISSN-L)
OpenAlex
W1984130668
Cited by
687
References
1
FWCI
53.81
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

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.