Abstract
Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Not applicable.
References
Abdelmalek S, Dali A, Bettayeb M, Bakdi A (2020) A new effective robust nonlinear controller based on PSO for interleaved DC–DC boost converters for fuel cell voltage regulation. Soft Comput 24:17051–17064. https://doi.org/10.1007/s00500-020-04996-4
Alaei M, Khorsand R, Ramezanpour M (2020) An adaptive fault detector strategy for scientific workflow scheduling based on improved differential evolution algorithm in cloud. Appl Soft Comput. https://doi.org/10.1016/j.asoc.2020.106895
Alotaibi SS (2020) Optimization insisted watermarking model: hybrid firefly and Jaya algorithm for video copyright protection. Soft Comput 24:14809–14823. https://doi.org/10.1007/s00500-020-04833-8
Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23:715–734. https://doi.org/10.1007/s00500-018-3102-4
Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Comput Struct 169:1–12. https://doi.org/10.1016/j.compstruc.2016.03.001
Azizi M, Mousavi Ghasemi SA, Ejlali RG, Talatahari S (2020) Optimum design of fuzzy controller using hybrid ant lion optimizer and Jaya algorithm. Artif Intell Rev 53:1553–1584. https://doi.org/10.1007/s10462-019-09713-8
Behera RK, Naik D, Rath SK, Dharavath R (2020) Genetic algorithm-based community detection in large-scale social networks. Neural Comput Appl 32:9649–9665. https://doi.org/10.1007/s00521-019-04487-0
Bogar E, Beyhan S (2020) Adolescent Identity Search Algorithm (AISA): a novel metaheuristic approach for solving optimization problems. Appl Soft Comput J 95:106503. https://doi.org/10.1016/j.asoc.2020.106503
Chang T, Kong D, Hao N, Xu K, Yang G (2018) Solving the dynamic weapon target assignment problem by an improved artificial bee colony algorithm with heuristic factor initialization. Appl Soft Comput J 70:845–863. https://doi.org/10.1016/j.asoc.2018.06.014
Cui L, Li G, Zhu Z, Wen Z, Lu N, Lu J (2018) A novel differential evolution algorithm with a self-adaptation parameter control method by differential evolution. Soft Comput 22:6171–6190. https://doi.org/10.1007/s00500-017-2685-5
Deng W, Yao R, Zhao H, Yang X, Li G (2019) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput 23:2445–2462. https://doi.org/10.1007/s00500-017-2940-9
Ding Z, Li J, Hao H (2019) Structural damage identification using improved Jaya algorithm based on sparse regularization and Bayesian inference. Mech Syst Signal Process 132:211–231. https://doi.org/10.1016/j.ymssp.2019.06.029
El-Ashmawi WH, Elminaam DSA (2019) A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem. Appl Soft Comput J 82:105565. https://doi.org/10.1016/j.asoc.2019.105565
Emami H, Sharifi AA (2020) A novel bio-inspired optimization algorithm for solving peak-to-average power ratio problem in DC-biased optical systems. Opt Fiber Technol 60:102383. https://doi.org/10.1016/j.yofte.2020.102383
Fan L, Chen H, Gao Y (2020) An improved flower pollination algorithm to the urban transit routing problem. Soft Comput 24:5043–5052. https://doi.org/10.1007/s00500-019-04253-3
Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl-Based Syst 191:105190. https://doi.org/10.1016/j.knosys.2019.105190
Feng ZK, Niu WJ, Liu S (2020) Cooperation search algorithm: a novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2020.106734
Gandomi AH, Alavi AH (2011) Multi-stage genetic programming: a new strategy to nonlinear system modeling. Inf Sci (Ny) 181:5227–5239. https://doi.org/10.1016/j.ins.2011.07.026
Gholami J, Pourpanah F, Wang X (2020a) Feature selection based on improved binary global harmony search for data classification. Appl Soft Comput J 93:106402. https://doi.org/10.1016/j.asoc.2020.106402
Gholami J, Ghany KKA, Zawbaa HM (2020b) A novel global harmony search algorithm for solving numerical optimizations. Soft Comput 25:2837–2849. https://doi.org/10.1007/s00500-020-05341-5
Gholami K, Olfat H, Gholami J (2021) An intelligent hybrid JAYA and crow search algorithms for optimizing constrained and unconstrained problems. Soft Comput 25:14393–14411. https://doi.org/10.1007/s00500-021-06205-2
Goudos SK, Yioultsis TV, Boursianis AD, Psannis KE, Siakavara K (2019) Application of New hybrid jaya grey Wolf optimizer to antenna design for 5G communications systems. IEEE Access 7:71061–71071. https://doi.org/10.1109/ACCESS.2019.2919116
Gunduz M, Aslan M (2021) DJAYA: A discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275. https://doi.org/10.1016/j.asoc.2021.107275
Hakli H, Kiran MS (2020) An improved artificial bee colony algorithm for balancing local and global search behaviors in continuous optimization. Int J Mach Learn Cybern 11:2051–2076. https://doi.org/10.1007/s13042-020-01094-7
Kaur A, Sharma S, Mishra A (2019) A novel jaya-BAT algorithm based power consumption minimization in cognitive radio network. Wirel Pers Commun 108:2059–2075. https://doi.org/10.1007/s11277-019-06509-5
Kumar V, Yadav SM (2018) Optimization of reservoir operation with a new approach in evolutionary computation using TLBO algorithm and jaya algorithm. Water Resour Manag 32:4375–4391. https://doi.org/10.1007/s11269-018-2067-5
Leghari ZH, Hassan MY, Said DM, Jumani TA, Memon ZA (2020) A novel grid-oriented dynamic weight parameter based improved variant of Jaya algorithm. Adv Eng Softw 150:102904. https://doi.org/10.1016/j.advengsoft.2020.102904
Li Y, Wang C, Gao L, Song Y, Li X (2020) An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling. Complex Intell Syst. https://doi.org/10.1007/s40747-020-00205-9
Liu L, Luo S, Guo F, Tan S (2020) Multi-point shortest path planning based on an Improved Discrete Bat Algorithm. Appl Soft Comput J 95:106498. https://doi.org/10.1016/j.asoc.2020.106498
Mafarja MM, Mirjalili S (2017) Hybrid Whale Optimization Algorithm with simulated annealing for feature selection. Neurocomputing 260:302–312. https://doi.org/10.1016/j.neucom.2017.04.053
Meng Z, Li G, Wang X, Sait SM, Yıldız AR (2020) A comparative study of metaheuristic algorithms for reliability-based design optimization problems. Arch Comput Methods Eng. https://doi.org/10.1007/s11831-020-09443-z
Migallón H, Jimeno-Morenilla A, Sánchez-Romero JL, Belazi A (2020) Efficient parallel and fast convergence chaotic Jaya algorithms. Swarm Evol Comput 56:100698. https://doi.org/10.1016/j.swevo.2020.100698
Mirjalili S (2015a) The ant lion optimizer. Adv Eng Softw 83:80–98. https://doi.org/10.1016/j.advengsoft.2015.01.010
Mirjalili S (2015b) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249. https://doi.org/10.1016/j.knosys.2015.07.006
Mirjalili S (2016a) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27:1053–1073. https://doi.org/10.1007/s00521-015-1920-1
Mirjalili S (2016b) SCA: a sine cosine algorithm for solving optimization problems. Knowledge-Based Syst 96:120–133. https://doi.org/10.1016/j.knosys.2015.12.022
Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer Adv Eng Softw 69:46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007
Morales-Castañeda B, Zaldívar D, Cuevas E, Maciel-Castillo O, Aranguren I, Fausto F (2019) An improved Simulated Annealing algorithm based on ancient metallurgy techniques. Appl Soft Comput J 84:105761. https://doi.org/10.1016/j.asoc.2019.105761
Ostad-Ali-Askari K, Shayannejad M (2021) Quantity and quality modelling of groundwater to manage water resources in Isfahan-Borkhar Aquifer. Environ Dev Sustain 23:15943–15959. https://doi.org/10.1007/s10668-021-01323-1
Ostad-Ali-Askari K, Shayannejad M, Eslamian S, Zamani F, Shojaei N, Navabpour B, et al (2017a) Deficit irrigation. In: Handb. Drought Water Scarcity, CRC Press, pp 375–91. https://doi.org/10.1201/9781315226774-18.
Ostad-Ali-Askari K, Shayannejad M, Ghorbanizadeh-Kharazi H (2017b) Artificial neural network for modeling nitrate pollution of groundwater in marginal area of Zayandeh-rood River, Isfahan, Iran. KSCE J Civ Eng 21:134–140. https://doi.org/10.1007/s12205-016-0572-8
Ouaddah A, Boughaci D (2016) Harmony search algorithm for image reconstruction from projections. Appl Soft Comput J 46:924–935. https://doi.org/10.1016/j.asoc.2016.02.031
Ouyang H, Wu W, Zhang C, Li S, Zou D, Liu G (2019) Improved harmony search with general iteration models for engineering design optimization problems. Soft Comput 23:10225–10260. https://doi.org/10.1007/s00500-018-3579-x
Pakzad-Moghaddam SH, Mina H, Mostafazadeh P (2019) A novel optimization booster algorithm. Comput Ind Eng 136:591–613. https://doi.org/10.1016/j.cie.2019.07.046
Pekel E (2020) Solving technician routing and scheduling problem using improved particle swarm optimization. Soft Comput 24:19007–19015. https://doi.org/10.1007/s00500-020-05333-5
Rao RV, Saroj A (2019) An elitism-based self-adaptive multi-population Jaya algorithm and its applications. Soft Comput 23:4383–4406. https://doi.org/10.1007/s00500-018-3095-z
Rizk-Allah RM (2019) An improved sine–cosine algorithm based on orthogonal parallel information for global optimization. Soft Comput 23:7135–7161. https://doi.org/10.1007/s00500-018-3355-y
Sankhwar S, Gupta D, Ramya KC, Sheeba Rani S, Shankar K, Lakshmanaprabu SK (2020) Improved grey wolf optimization-based feature subset selection with fuzzy neural classifier for financial crisis prediction. Soft Comput 24:101–110. https://doi.org/10.1007/s00500-019-04323-6
Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30–47. https://doi.org/10.1016/j.advengsoft.2017.01.004
Shao G, Shangguan Y, Tao J, Zheng J, Liu T, Wen Y (2018) An improved genetic algorithm for structural optimization of Au–Ag bimetallic nanoparticles. Appl Soft Comput J 73:39–49. https://doi.org/10.1016/j.asoc.2018.08.019
Sinha AK, Anand A (2020) Optimizing supply chain network for perishable products using improved bacteria foraging algorithm. Appl Soft Comput J 86:105921. https://doi.org/10.1016/j.asoc.2019.105921
Soltani P, Hadavandi E (2019) A monarch butterfly optimization-based neural network simulator for prediction of siro-spun yarn tenacity. Soft Comput 23:10521–10535. https://doi.org/10.1007/s00500-018-3624-9
Song B, Wang Z, Zou L (2021) An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree Bezier curve. Appl Soft Comput 100:106960. https://doi.org/10.1016/j.asoc.2020.106960
Sun N, Lu Y (2019) A self-adaptive genetic algorithm with improved mutation mode based on measurement of population diversity. Neural Comput Appl 31:1435–1443. https://doi.org/10.1007/s00521-018-3438-9
Tian M, Bo Y, Chen Z, Wu P, Yue C (2019a) Multi-target tracking method based on improved firefly algorithm optimized particle filter. Neurocomputing 359:438–448. https://doi.org/10.1016/j.neucom.2019.06.003
Tian M, Bo Y, Chen Z, Wu P, Yue C (2019b) A new improved firefly clustering algorithm for SMC-PHD filter. Appl Soft Comput J 85:105840. https://doi.org/10.1016/j.asoc.2019.105840
Vanani HR, Shayannejad M, SoltaniTudeshki AR, Ostad-Ali-Askari K, Eslamian S, Mohri-Esfahani E et al (2017) Development of a new method for determination of infiltration coefficients in furrow irrigation with natural non-uniformity of slope. Sustain Water Resour Manag 3:163–169. https://doi.org/10.1007/s40899-017-0091-x
Venkata RR (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19–34. https://doi.org/10.5267/j.ijiec.2015.8.004
Wang RL, Okazaki K (2007) An improved genetic algorithm with conditional genetic operators and its application to set-covering problem. Soft Comput 11:687–694. https://doi.org/10.1007/s00500-006-0131-1
Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22:387–408. https://doi.org/10.1007/s00500-016-2474-6
Wang S, Li Y, Yang H (2019) Self-adaptive mutation differential evolution algorithm based on particle swarm optimization. Appl Soft Comput J 81:105496. https://doi.org/10.1016/j.asoc.2019.105496
Wu J, Wang YG, Burrage K, Tian YC, Lawson B, Ding Z (2020) An improved firefly algorithm for global continuous optimization problems. Expert Syst Appl 149:113340. https://doi.org/10.1016/j.eswa.2020.113340
Xiong G, Zhang J, Shi D, Zhu L, Yuan X (2020) Optimal identification of solid oxide fuel cell parameters using a competitive hybrid differential evolution and Jaya algorithm. Int J Hydrogen Energy. https://doi.org/10.1016/j.ijhydene.2020.11.119
Yan C, Li M, Liu W (2020) Prediction of bank telephone marketing results based on improved whale algorithms optimizing S_Kohonen network. Appl Soft Comput J 92:106259. https://doi.org/10.1016/j.asoc.2020.106259
Yang XS. Metaheuristics in water, geotechnical and transport engineering. In: Metaheuristics water. Geotech Transp Eng 10: 15. https://doi.org/10.1016/C2011-0-07801-8.
Yildiz AR, Abderazek H, Mirjalili S (2020) A comparative study of recent non-traditional methods for mechanical design optimization. Arch Comput Methods Eng 27:1031–1048. https://doi.org/10.1007/s11831-019-09343-x
Zhang J, Xiao M, Gao L, Pan Q (2018) Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems. Appl Math Model 63:464–490. https://doi.org/10.1016/j.apm.2018.06.036
Zhang T, Yue Q, Zhao X, Liu G (2019) An improved firework algorithm for hardware/software partitioning. Appl Intell 49:950–962. https://doi.org/10.1007/s10489-018-1310-3
Zhang Z, Mao L, Guan C, Zhu L, Wang Y (2020) An improved scatter search algorithm for the corridor allocation problem considering corridor width. Soft Comput 24:461–481. https://doi.org/10.1007/s00500-019-03925-4
Zhao Z, Liu B, Zhang C, Liu H (2019) An improved adaptive NSGA-II with multi-population algorithm. Appl Intell 49:569–580. https://doi.org/10.1007/s10489-018-1263-6
Zhao Y, Liu H, Gao K (2020) An evacuation simulation method based on an improved artificial bee colony algorithm and a social force model. Appl Intell. https://doi.org/10.1007/s10489-020-01711-6
Funding
There is no funding source.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Gholami, J., Kamankesh, M.R., Mohammadi, S. et al. Powerful enhanced Jaya algorithm for efficiently optimizing numerical and engineering problems. Soft Comput 26, 5315–5333 (2022). https://doi.org/10.1007/s00500-022-06909-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-022-06909-z