[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Solving continuous optimization problems using the ımproved Jaya algorithm (IJaya)

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Jaya algorithm is one of the heuristic algorithms developed in recent years. The most important difference from other heuristic algorithms is that it updates its position according to its best and worst position. In addition to its simplicity, there is no algorithm-specific parameter. Because of these advantages, it has been preferred by researchers for problem-solving in the literature. In this study, the random walk phase of the original Jaya algorithm is developed and the Improved Jaya Algorithm (IJaya) is proposed. IJaya has been tested for success in eighteen classic benchmark test functions. Although the performance of the original Jaya algorithm has been tested at low dimensions in the literature, its success in large sizes has not been tested. In this study, IJaya's success in 10, 20, 30, 100, 500, and 1000 dimensions was examined. Also, the success of IJaya was tested in different population sizes. It has been proven that IJaya's performance has increased with the tests performed. Test results show that IJaya displays good performance and can be used as an alternative method for constrained optimization. In addition, three different engineering design problems were tested in different population sizes to demonstrate the achievements of Jaya and IJaya. According to the results, IJaya can be used as an optimization algorithm in the literature for continuous optimization and large-scale optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Aslan M, Gunduz M, Kiran MS (2019) JayaX: Jaya algorithm with xor operator for binary optimization. Appl Soft Comput Journal 82:105576

    Article  Google Scholar 

  • Babalik A, Cinar AC, Kiran MS (2018) A modification of tree-seed algorithm using Deb’s rules for constrained optimization. Appl Soft Comput 63:289–305

    Article  Google Scholar 

  • Baş E, Ülker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185

    Article  Google Scholar 

  • Baş E, Ülker E (2020) A binary social spider algorithm for uncapacitated facility location problem. Expert Syst Appl 161:113618

    Article  Google Scholar 

  • Baş E, Ülker E (2020a) A binary social spider algorithm for continuous optimization task. Soft Comput. https://doi.org/10.1007/s00500-020-04718-w

    Article  Google Scholar 

  • Baş E, Ülker E (2020c) Discrete social spider algorithm for the traveling salesman problem. Artif Intell Rev. https://doi.org/10.1007/s10462-020-09869-8

    Article  Google Scholar 

  • Baş E, Ülker E (2020e) Improved social spider algorithm for large scale constrained optimization. Artif Intell Rev. https://doi.org/10.1007/s10462-020-09931-5

    Article  Google Scholar 

  • Beşkirli M (2021) Solving continuous optimization problems using the tree seed algorithm developed with the roulette wheel strategy. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2021.114579

    Article  Google Scholar 

  • Caldeira RH, Gnanavelbabu A (2021) A Pareto based discrete Jaya algorithm for multi-objective flexible job-shop scheduling problem. Expert Syst Appl 170:114567

    Article  Google Scholar 

  • Chaudhuri A, Sahu TP (2021) A hybrid feature selection method based on binary Jaya algorithm for microarray data classification. Comput Electr Eng 90:106963

    Article  Google Scholar 

  • Das H, Naik B, Behera HS, A Jaya algorithm based wrapper method for optimal feature selection in supervised classification. J King Saud Univ: Comput Inf Sci xxx (xxxx) xxx.

  • Deb K (1991) Optimal design of a welded beam via genetic algorithms. AIAA J 29(11):2013–2015

    Article  Google Scholar 

  • Deng H, Peng L, Zhang H, Yang B, Chen Z (2019) Ranking-based biased learning swarm optimizer for large-scale optimization. Inf Sci 493(2019):120–137

    Article  MathSciNet  Google Scholar 

  • Deng W, Shang S, Cai X, Zhao H, Zhou Y, Chen H, Deng W (2021) Quantum differential evolution with cooperative coevolution framework and hybrid mutation strategy for large scale optimization. Knowl-Based Syst 224:107080

    Article  Google Scholar 

  • Elattar E, ElSayed SK (2019) Modified JAYA algorithm for optimal power flow incorporating renewable energy sources considering the cost, emission, power loss, and voltage profile improvement. Energy 178:598e609

    Article  Google Scholar 

  • Gao Y, Zhang H, Zhang Y (2019) Overlapping community detection based on conductance optimization in large-scale networks. Phys A 522(2019):69–79. https://doi.org/10.1016/j.physa.2019.01.142

    Article  MathSciNet  Google Scholar 

  • Iacca G, Santos Junior VC, Melo VV (2021) An improved Jaya optimization algorithm with Lévy flight. Expert Syst Appl 165:113902

    Article  Google Scholar 

  • Kaveh A, Hosseini SM, Zaerreza A (2021) Improved Shuffled Jaya algorithm for sizing optimization of skeletal structures with discrete variables. Structures 29(2021):107–128

    Article  Google Scholar 

  • Lee KS, Geem ZW (2005) (2005), A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36):3902–3933

    Article  Google Scholar 

  • Li Y, Zhao Y, Liu J (2021) Dynamic sine cosine algorithm for large-scale global optimization problems. Expert Syst Appl 177:114950

    Article  Google Scholar 

  • Li D, Guo W, Lerch A, Li Y, Wang L, Wu Q (2021) An adaptive particle swarm optimizer with decoupled exploration and exploitation for large scale optimization. Swarm Evol Comput 60:100789

    Article  Google Scholar 

  • Min W, Liu J, Zhang S (2018) Network-regularized sparse logistic regression models for clinical risk prediction and biomarker discovery. IEEE/ACM Trans Comput Biol Bioinform 15(2018):944–953. https://doi.org/10.1109/TCBB.2016.2640303

    Article  Google Scholar 

  • Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89(2015):228–249

    Article  Google Scholar 

  • Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95(2016):51–67

    Article  Google Scholar 

  • Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69(2014):46–61

    Article  Google Scholar 

  • Murty KG (2003) Optimization models for decision making, vol. 1, Chapter 1. pp. 1–18

  • Nayak DR, Zhang Y, Das DS, Panda S (2019) MJaya-ELM: A Jaya algorithm with mutation and extreme learning machine-based approach for sensorineural hearing loss detection. Appl Soft Comput J 83:105626

    Article  Google Scholar 

  • Rao RV, Keesari HS (2018) Multi-team perturbation guiding Jaya algorithm for optimization of wind farm layout. Appl Soft Comput 71(2018):800–815

    Article  Google Scholar 

  • Rao R (2016) Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34

    Google Scholar 

  • Rather SA, Bala PK (2020) Swarm-based chaotic gravitational search algorithm for solving mechanical engineering design problems. World J Eng 17(1):97–114

    Article  Google Scholar 

  • Ren Z, Liang Y, Wang M, Yang Y, Chen A (2021) An eigenspace divide-and-conquer approach for large-scale optimization. Appl Soft Comput J 99:106911

    Article  Google Scholar 

  • Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization. KanGAL Report 2005005:2005

    Google Scholar 

  • Sun L, Lin L, Li H, Gen M (2019) Large scale flexible scheduling optimization by a distributed evolutionary algorithm. Comput Ind Eng 128(2019):894–904. https://doi.org/10.1016/j.cie.2018.09.025

    Article  Google Scholar 

  • Surjanovic S, Bingham D (2019) Virtual Library of simulation experiments: test functions and datasets, http://www.sfu.ca/ssurjano

  • Teng H, Chen Y, Zeng W, Shi Y, Hu Q (2010) A dual-system variable-grain cooperative coevolutionary algorithm: satellite-module layout design. IEEE Trans Evol Comput 14:438–455. https://doi.org/10.1109/TEVC.2009.2033585

    Article  Google Scholar 

  • Warid W (2020) Optimal power flow using the AMTPG-Jaya algorithm. Appl Soft Comput J 91:106252

    Article  Google Scholar 

  • Xinchao Z (2010) A perturbed particle swarm algorithm for numerical optimization. Appl Soft Comput 10(2010):119–124

    Article  Google Scholar 

  • Yang X-S (2011) Bat algorithm for multi-objective optimization. Int J Bio-Inspir Comput. https://doi.org/10.1504/IJBIC.2011.042259

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kulu Vocational School, Selçuk University, 42075, Konya, Turkey

    Emine Baş

Authors
  1. Emine Baş
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

EB: Conceptualization, ınvestigation, methodology, software, writing—review, original draft and editing.

Corresponding author

Correspondence to Emine Baş.

Ethics declarations

Conflict of interest

The author declares that she has no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baş, E. Solving continuous optimization problems using the ımproved Jaya algorithm (IJaya). Artif Intell Rev 55, 2575–2639 (2022). https://doi.org/10.1007/s10462-021-10077-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-021-10077-1

Keywords

Search

Navigation