摘要: This paper presents a comprehensive discussion of the Jaya algorithm, novel approach for optimization. There exist two broad categories heuristic algorithms are: evolutionary and swarm intelligence. These algorithms' performance vastly depends on parameters used need extensive tuning during computational experiments to achieve superior performance. The algorithm is new optimization has been proposed recently parameter less therefore not needed it. primary aim this discuss based rational aspects outlined as: (a) what algorithm; (b) How it works (c) why one should use author believes that might be useful explore potential general audience working
sci-hub.se 参考文章(4)
R. Venkata Rao, Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems International Journal of Industrial Engineering Computations. ,vol. 7, pp. 19- 34 ,(2016) , 10.5267/J.IJIEC.2015.8.004
Matej Črepinšek, Shih-Hsi Liu, Marjan Mernik, Exploration and exploitation in evolutionary algorithms: A survey ACM Computing Surveys. ,vol. 45, pp. 35- ,(2013) , 10.1145/2480741.2480752
Hari Mohan Pandey, Ankit Chaudhary, Deepti Mehrotra, A comparative review of approaches to prevent premature convergence in GA soft computing. ,vol. 24, pp. 1047- 1077 ,(2014) , 10.1016/J.ASOC.2014.08.025
Hari Mohan Pandey, Ankit Chaudhary, Deepti Mehrotra, Grammar induction using bit masking oriented genetic algorithm and comparative analysis soft computing. ,vol. 38, pp. 453- 468 ,(2016) , 10.1016/J.ASOC.2015.09.044