Jaya Optimization Algorithm and Its Variants
This chapter presents the details of TLBO algorithm, NSTLBO algorithm, Jaya algorithm and its variants named as Self-Adaptive Jaya, Quasi-Oppositional Jaya, Self-Adaptive Multi-Population Jaya, Self-Adaptive Multi-Population Elitist Jaya, Chaos Jaya, Multi-Objective Jaya, and Multi-Objective Quasi-Oppositional Jaya. Suitable examples are included to demonstrate the working of Jaya algorithm and its variants for the unconstrained and constrained single and multi-objective optimization problems. Three performance measures of coverage, spacing and hypervolume are also described to assess the performance of the multi-objective optimization algorithms.
- Rao, R. V. (2016b). Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. International Journal of Industrial Engineering Computations, 7, 19–34.Google Scholar
- Rao, R. V., Rai, D. P., Balic, J. (2016). Multi-objective optimization of machining and micro-machining processes using non-dominated sorting teaching–Learning-based optimization algorithm. Journal of Intelligent Manufacturing, 2016. https://doi.org/10.1007/s10845-016-1210-5.
- Rao, R. V., & Saroj, A. (2018). An elitism-based self-adaptive multi-population Jaya algorithm and its applications. Soft Computing. https://doi.org/10.1007/s00500-018-3095-z.
- Simon, D. (2013). Evolutionary optimization algorithms. New York: Wiley.Google Scholar