Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 3,233

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

The Ant Lion Optimizer

Mirjalili, Seyedali·2015·Advances in Engineering Software
DOI 10.1016/j.advengsoft.2015.01.010
Open this paper in CoChat — free account

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.advengsoft.2015.01.010

Cites

4 of 4 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: 70

  1. Blum, 2011, Hybrid metaheuristics in combinatorial optimization: a survey, Appl Soft Comput, 11, 4135, 10.1016/j.asoc.2011.02.032 · DOI
  2. Boussaïd, 2013, A survey on optimization metaheuristics, Inform Sci, 237, 82, 10.1016/j.ins.2013.02.041 · DOI
  3. Gogna, 2013, Metaheuristics: review and application, J Exp Theor Artif Intell, 25, 503, 10.1080/0952813X.2013.782347 · DOI
  4. Bianchi, 2009, A survey on metaheuristics for stochastic combinatorial optimization, Nat Comput: Int J, 8, 239, 10.1007/s11047-008-9098-4 · DOI
  5. Cornuéjols, 2008, Valid inequalities for mixed integer linear programs, Math Program, 112, 3, 10.1007/s10107-006-0086-0 · DOI
  6. Land AH, Doig AG. An automatic method for solving discrete programming problems. In: 50Years of integer programming 1958–2008. Springer; 2010. p. 105–32. · DOI
  7. Simpson, 1994, Genetic algorithms compared to other techniques for pipe optimization, J Water Resour Plann Manage, 120, 423, 10.1061/(ASCE)0733-9496(1994)120:4(423) · doi:10.1061/(asce)0733-9496(1994)120:4(423
  8. Spall, 2005, vol. 65
  9. Kirkpatrick, 1984, Optimization by simulated annealing: quantitative studies, J Stat Phys, 34, 975, 10.1007/BF01009452 · DOI
  10. Talbi, 2009, vol. 74
  11. Holland, 1977, Cognitive systems based on adaptive algorithms, ACM SIGART Bull, 10.1145/1045343.1045373 · DOI · Paper page
  12. Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life; 1991. p. 134–42.
  13. Yao, 1999, Evolutionary programming made faster, IEEE Trans Evol Comput, 3, 82, 10.1109/4235.771163 · DOI
  14. Mirjalili, 2014, Grey wolf optimizer, Adv Eng Software, 69, 46, 10.1016/j.advengsoft.2013.12.007 · DOI · Paper page
  15. Karaboga, 2007, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J Global Optim, 39, 459, 10.1007/s10898-007-9149-x · DOI
  16. Yang, 2010, Firefly algorithm, stochastic test functions and design optimisation, Int J Bio-Inspired Comput, 2, 78, 10.1504/IJBIC.2010.032124 · DOI · Paper page
  17. Yang X-S, Deb S. Cuckoo search via Lévy flights. In: World congress on nature & biologically inspired computing, 2009. NaBIC 2009; 2009. p. 210–4. · DOI
  18. Yang, 2010, Engineering optimisation by cuckoo search, Int J Math Model Numer Optim, 1, 330
  19. Rajabioun, 2011, Cuckoo optimization algorithm, Appl Soft Comput, 11, 5508, 10.1016/j.asoc.2011.05.008 · DOI · Paper page
  20. Rashedi, 2009, GSA: a gravitational search algorithm, Inform Sci, 179, 2232, 10.1016/j.ins.2009.03.004 · DOI
  21. Kaveh, 2010, A novel heuristic optimization method: charged system search, Acta Mech, 213, 267, 10.1007/s00707-009-0270-4 · DOI · Paper page
  22. Kaveh, 2010, Optimal design of skeletal structures via the charged system search algorithm, Struct Multidiscip Optim, 41, 893, 10.1007/s00158-009-0462-5 · DOI
  23. Kaveh, 2012, Charged system search for optimal design of frame structures, Appl Soft Comput, 12, 382, 10.1016/j.asoc.2011.08.034 · DOI
  24. Kaveh, 2011, Geometry and topology optimization of geodesic domes using charged system search, Struct Multidiscip Optim, 43, 215, 10.1007/s00158-010-0566-y · DOI
  25. Kaveh, 2013, Magnetic charged system search: a new meta-heuristic algorithm for optimization, Acta Mech, 224, 85, 10.1007/s00707-012-0745-6 · DOI
  26. Kaveh, 2013, An improved ray optimization algorithm for design of truss structures, Civ Eng, 57, 97
  27. Kaveh, 2012, A new meta-heuristic method: ray optimization, Comput Struct, 112, 283, 10.1016/j.compstruc.2012.09.003 · DOI
  28. Kaveh, 2013, Ray optimization for size and shape optimization of truss structures, Comput Struct, 117, 82, 10.1016/j.compstruc.2012.12.010 · DOI
  29. Kaveh, 2014, Enhanced colliding bodies optimization for design problems with continuous and discrete variables, Adv Eng Softw, 77, 66, 10.1016/j.advengsoft.2014.08.003 · DOI
  30. Kaveh, 2014, Enhanced colliding bodies algorithm for truss optimization with frequency constraints, J Comput Civ Eng
  31. Kaveh, 2014, Colliding bodies optimization method for optimum discrete design of truss structures, Comput Struct, 139, 43, 10.1016/j.compstruc.2014.04.006 · DOI
  32. Kaveh, 2014, Colliding bodies optimization method for optimum design of truss structures with continuous variables, Adv Eng Softw, 70, 1, 10.1016/j.advengsoft.2014.01.002 · DOI
  33. Kaveh, 2014, Colliding-bodies optimization for truss optimization with multiple frequency constraints, J Comput Civ Eng
  34. Kaveh, 2014, Colliding bodies optimization: a novel meta-heuristic method, Comput Struct, 139, 18, 10.1016/j.compstruc.2014.04.005 · DOI · Paper page
  35. Kaveh, 2014, An efficient hybrid particle swarm and swallow swarm optimization algorithm, Comput Struct, 143, 40, 10.1016/j.compstruc.2014.07.012 · DOI
  36. Kaveh, 2014, Optimum cost design of reinforced concrete one-way ribbed slabs using CBO, PSO and democratic PSO algorithms, Asian J Civ Eng (BHRC), 15, 788
  37. 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
  38. Kaveh, 2013, A new optimization method: Dolphin echolocation, Adv Eng Softw, 59, 53, 10.1016/j.advengsoft.2013.03.004 · DOI · Paper page
  39. Kaveh, 2014, Chaotic swarming of particles: a new method for size optimization of truss structures, Adv Eng Softw, 67, 136, 10.1016/j.advengsoft.2013.09.006 · DOI
  40. Scharf, 2008, Foraging behaviour and habitat selection in pit-building antlion larvae in constant light or dark conditions, Anim Behav, 76, 2049, 10.1016/j.anbehav.2008.08.023 · DOI
  41. Griffiths, 1986, Pit construction by ant-lion larvae: a cost-benefit analysis, J Anim Ecol, 39, 10.2307/4691 · DOI
  42. Scharf, 2006, Factors influencing site abandonment and site selection in a sit-and-wait predator: a review of pit-building antlion larvae, J Insect Behav, 19, 197, 10.1007/s10905-006-9017-4 · DOI
  43. Digalakis, 2001, On benchmarking functions for genetic algorithms, Int J Comput Math, 77, 481, 10.1080/00207160108805080 · DOI
  44. Yang X-S. Test problems in optimization. arXiv preprint arXiv:1008.0549; 2010. · arXiv
  45. Liang J, Suganthan P, Deb K. Novel composition test functions for numerical global optimization. In: Proceedings 2005 IEEE swarm intelligence symposium, 2005. SIS 2005; 2005. p. 68–75. · DOI · Paper page
  46. Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y, Auger A, et al. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report, vol. 2005005; 2005.
  47. Kennedy J, Eberhart R. Particle swarm optimization. In: Proceedings IEEE international conference on neural networks, 1995; 1995. p. 1942–8. · DOI · Paper page
  48. Cuevas, 2014, An optimization algorithm inspired by the States of Matter that improves the balance between exploration and exploitation, Appl Intell, 40, 256, 10.1007/s10489-013-0458-0 · DOI
  49. Cuevas, 2013, A novel evolutionary algorithm inspired by the states of matter for template matching, Expert Syst Appl, 40, 6359, 10.1016/j.eswa.2013.05.055 · DOI
  50. Derrac, 2011, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm Evolut Comput, 1, 3, 10.1016/j.swevo.2011.02.002 · DOI
  51. Mirjalili, 2013, S-shaped versus V-shaped transfer functions for binary particle swarm optimization, Swarm Evolut Comput, 9, 1, 10.1016/j.swevo.2012.09.002 · DOI
  52. van den Bergh, 2006, A study of particle swarm optimization particle trajectories, Inform Sci, 176, 937, 10.1016/j.ins.2005.02.003 · DOI
  53. Coello Coello, 2002, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art, Comput Methods Appl Mech Eng, 191, 1245, 10.1016/S0045-7825(01)00323-1 · DOI · Paper page
  54. Chickermane, 1996, Structural optimization using a new local approximation method, Int J Numer Meth Eng, 39, 829, 10.1002/(SICI)1097-0207(19960315)39:5<829::AID-NME884>3.0.CO;2-U · DOI
  55. Gandomi, 2013, Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems, Eng Comput, 29, 17, 10.1007/s00366-011-0241-y · DOI
  56. Cheng, 2014, Symbiotic organisms search: a new metaheuristic optimization algorithm, Comput Struct, 139, 98, 10.1016/j.compstruc.2014.03.007 · DOI
  57. Sadollah, 2013, Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems, Appl Soft Comput, 13, 2592, 10.1016/j.asoc.2012.11.026 · DOI
  58. Zhang, 2008, Differential evolution with dynamic stochastic selection for constrained optimization, Inform Sci, 178, 3043, 10.1016/j.ins.2008.02.014 · DOI · Paper page
  59. Liu, 2010, Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization, Appl Soft Comput, 10, 629, 10.1016/j.asoc.2009.08.031 · DOI
  60. Tsai, 2005, Global optimization of nonlinear fractional programming problems in engineering design, Eng Optim, 37, 399, 10.1080/03052150500066737 · DOI
  61. Ray, 2001, Engineering design optimization using a swarm with an intelligent information sharing among individuals, Eng Optim, 33, 735, 10.1080/03052150108940941 · DOI
  62. Gandomi, 2014, Interior search algorithm (ISA): a novel approach for global optimization, ISA Trans, 10.1016/j.isatra.2014.03.018 · DOI
  63. Sandgren, 1990, Nonlinear integer and discrete programming in mechanical design optimization, J Mech Des, 112, 223, 10.1115/1.2912596 · DOI · Paper page
  64. Wu, 1995, Genetic algorithms for nonlinear mixed discrete-integer optimization problems via meta-genetic parameter optimization, Eng Optim+ A35, 24, 137, 10.1080/03052159508941187 · DOI
  65. Sharma TK, Pant M, Singh V. Improved local search in artificial bee colony using golden section search. arXiv preprint arXiv:1210.6128; 2012. · arXiv
  66. Deb, 1996, A combined genetic adaptive search (GeneAS) for engineering design, Comput Sci Inform, 26, 30
  67. Kannan, 1994, An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, J Mech Des, 116, 405, 10.1115/1.2919393 · DOI
  68. Xie, 2011, Optimal preliminary propeller design based on multi-objective optimization approach, Proc Eng, 16, 278, 10.1016/j.proeng.2011.08.1084 · DOI
  69. Kim, 2009, Design of propeller geometry using streamline-adapted blade sections, J Mar Sci Technol, 14, 161, 10.1007/s00773-008-0032-3 · DOI
  70. Epps B, Chalfant J, Kimball R, Techet A, Flood K, Chryssostomidis C. OpenProp: an open-source parametric design and analysis tool for propellers. In: Proceedings of the 2009 grand challenges in modeling & simulation conference; 2009. p. 104–11.

Cited by

See all 3,233

Metadata

Authors
Mirjalili, S.
Venue
Advances in Engineering Software
Publisher
Elsevier BV
Published
2015-05
Volume
83
Pages
80-98
ISSN
0965-9978 (ISSN-L)
DOI
10.1016/j.advengsoft.2015.01.010
OpenAlex
W2001979953
Cited by
3,233
References
4
FWCI
134.82
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.