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

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

Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems

Mirjalili, Seyedali, Jangir, Pradeep, Saremi, Shahrzad·2017·Applied Intelligence
DOI 10.1007/s10489-016-0825-8
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.1007/s10489-016-0825-8

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

Show all 4 references

Research works printed but not linked: 44

  1. Kelley CT (1999) Detection and remediation of stagnation in the Nelder–Mead algorithm using a sufficient decrease condition. SIAM J Optim 10:43–55 · DOI
  2. Vogl TP, Mangis J, Rigler A, Zink W, Alkon D (1988) Accelerating the convergence of the back-propagation method. Biol Cybern 59:257–263 · DOI
  3. Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369–395 · DOI · Paper page
  4. Coello CAC (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–1287 · DOI · Paper page
  5. Beyer H.-G., Sendhoff B (2007) Robust optimization–a comprehensive survey. Comput Methods Appl Mech Eng 196:3190–3218 · DOI · Paper page
  6. Knowles JD, Watson RA, Corne DW (2001) Reducing local optima in single-objective problems by multi-objectivization. In: Evolutionary multi-criterion optimization, pp 269–283 · DOI
  7. Deb K, Goldberg DE (1993) Analyzing deception in trap functions. Found Genet Algoritm 2:93–108 · DOI · Paper page
  8. Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley
  9. Coello CAC, Lamont GB, Van Veldhuisen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer
  10. Branke J, Deb K, Dierolf H, Osswald M (2004) Finding knees in multi-objective optimization. In: Parallel problem solving from nature-PPSN VIII, pp 722–731 · DOI · Paper page
  11. Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8:631–657 · DOI · Paper page
  12. Kim IY, De Weck O (2005) Adaptive weighted-sum method for bi-objective optimization: Pareto front generation. Struct Multidiscip Optim 29:149–158 · DOI · Paper page
  13. Messac A, Mattson CA (2002) Generating well-distributed sets of Pareto points for engineering design using physical programming. Optim Eng 3:431–450 · DOI
  14. Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Parallel problem solving from nature PPSN VI, pp 849–858 · DOI
  15. Deb K, Goel T (2001) Controlled elitist non-dominated sorting genetic algorithms for better convergence. In: Evolutionary multi-criterion optimization, pp 67–81 · DOI · Paper page
  16. Coello CAC, Lechuga MS (2002) MOPSO: a proposal for multiple objective particle swarm optimization. In: Proceedings of the 2002 congress on evolutionary computation, 2002. CEC’02, pp 1051–1056 · DOI
  17. Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8:256–279 · DOI · Paper page
  18. Akbari R, Hedayatzadeh R, Ziarati K, Hassanizadeh B (2012) A multi-objective artificial bee colony algorithm. Swarm Evol Comput 2:39–52 · DOI · Paper page
  19. Yang X-S (2011) Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 3:267–274 · DOI
  20. Mirjalili S, Saremi S, Mirjalili SM, Coelho L. d. S. (2016) Multi-objective grey wolf optimizer: a novel algorithm for multi-criterion optimization. Expert Syst Appl 47:106–119 · DOI
  21. Ngatchou P, Zarei A, El-Sharkawi M (2005) Pareto multi objective optimization. In: Proceedings of the 13th international conference on intelligent systems application to power systems, 2005, pp 84–91 · DOI · Paper page
  22. Pareto V (1964) Cours d’economie politique: Librairie Droz · DOI · Paper page
  23. Edgeworth FY (1881) Mathematical physics. P. Keagan, London
  24. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3:257–271 · DOI · Paper page
  25. Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2:221–248 · DOI · Paper page
  26. Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8:149–172 · DOI · Paper page
  27. Abbass HA, Sarker R, Newton C (2001) PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems. In: Proceedings of the 2001 congress on evolutionary computation, 2001, pp 971–978 · DOI
  28. Branke J, Kaußler T, Schmeck H (2001) Guidance in evolutionary multi-objective optimization. Adv Eng Softw 32:499– 507 · DOI
  29. Kennedy J (2011) Particle swarm optimization. In: Encyclopedia of machine learning. Springer, pp 760–766 · DOI
  30. Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multiobjective optimization. In: Proceedings of the 1st IEEE conference on evolutionary computation, 1994. IEEE world congress on computational intelligence, pp 82–87 · DOI
  31. Mahfoud SW (1995) Niching methods for genetic algorithms. Urbana 51:62–94
  32. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98 · DOI · Paper page
  33. Van Veldhuizen DA, Lamont GB (1998) Multiobjective evolutionary algorithm research: a history and analysis. Citeseer · DOI · Paper page
  34. Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary computation 8(2):173–195 · DOI
  35. Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput & Applic 27:1053–1073 · DOI · Paper page
  36. Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113– 127 · DOI · Paper page
  37. Sadollah A, Eskandar H, Kim JH (2015) Water cycle algorithm for solving constrained multi-objective optimization problems. Appl Soft Comput 27:279–298 · DOI
  38. Srinivasan N, Deb K (1994) Multi-objective function optimisation using non-dominated sorting genetic algorithm. Evol Comput 2:221–248 · DOI · Paper page
  39. Binh TT, Korn U (1997) MOBES: A multiobjective evolution strategy for constrained optimization problems. In: The 3rd international conference on genetic algorithms (Mendel 97), p 7
  40. Osyczka A, Kundu S (1995) A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm. Struct Optim 10:94–99 · DOI
  41. Coello CC, Pulido GT (2005) Multiobjective structural optimization using a microgenetic algorithm. Struct Multidiscip Optim 30:388–403 · DOI
  42. Kurpati A, Azarm S, Wu J (2002) Constraint handling improvements for multiobjective genetic algorithms. Struct Multidiscip Optim 23:204–213 · DOI
  43. Ray T, Liew KM (2002) A swarm metaphor for multiobjective design optimization. Eng Optim 34:141–153 · DOI · Paper page
  44. Moussouni F, Brisset S, Brochet P (2007) Some results on the design of brushless DC wheel motor using SQP and GA. Int J Appl Electromagn Mech 26:233–241 · DOI

Cited by

Metadata

Authors
Mirjalili, S., Jangir, P., & Saremi, S.
Venue
Applied Intelligence
Publisher
Springer Science and Business Media LLC
Published
2016-07-25
Volume
46
Issue
1
Pages
79-95
ISSN
  • 0924-669X (ISSN-L)
  • 1573-7497
DOI
10.1007/s10489-016-0825-8
OpenAlex
W2481453975
Cited by
746
References
4
FWCI
33.34
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (unspecified)

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.