Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems

Rao, R.

Growing Science » International Journal of Industrial Engineering Computations » Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems

Journals

IJIEC Volumes

Volume 1 (17)
- Issue 1 (9)
- Issue 2 (8)

Volume 2 (68)
- Issue 1 (12)
- Issue 2 (20)
- Issue 3 (20)
- Issue 4 (16)

Volume 3 (76)
- Issue 1 (9)
- Issue 2 (15)
- Issue 3 (20)
- Issue 4 (12)
- Issue 5 (20)

Volume 4 (50)
- Issue 1 (14)
- Issue 2 (10)
- Issue 3 (12)
- Issue 4 (14)

Volume 5 (47)
- Issue 1 (13)
- Issue 2 (12)
- Issue 3 (12)
- Issue 4 (10)

Volume 6 (39)
- Issue 1 (7)
- Issue 2 (12)
- Issue 3 (10)
- Issue 4 (10)

Volume 7 (47)
- Issue 1 (10)
- Issue 2 (14)
- Issue 3 (10)
- Issue 4 (13)

Volume 8 (30)
- Issue 1 (9)
- Issue 2 (7)
- Issue 3 (8)
- Issue 4 (6)

Volume 9 (32)
- Issue 1 (9)
- Issue 2 (6)
- Issue 3 (7)
- Issue 4 (10)

Volume 10 (34)
- Issue 1 (8)
- Issue 2 (10)
- Issue 3 (8)
- Issue 4 (8)

Volume 11 (36)
- Issue 1 (9)
- Issue 2 (8)
- Issue 3 (9)
- Issue 4 (10)

Volume 12 (29)
- Issue 1 (9)
- Issue 2 (6)
- Issue 3 (8)
- Issue 4 (6)

Volume 13 (41)
- Issue 1 (10)
- Issue 2 (8)
- Issue 3 (10)
- Issue 4 (13)

Volume 14 (50)
- Issue 1 (11)
- Issue 2 (15)
- Issue 3 (9)
- Issue 4 (15)

Volume 15 (55)
- Issue 1 (19)
- Issue 2 (15)
- Issue 3 (12)
- Issue 4 (9)

Countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print) Quarterly Publication Volume 7 Issue 1 pp. 19-34 , 2016

Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems Pages 19-34 Download PDF

Authors: R. Venkata Rao

DOI: 10.5267/j.ijiec.2015.8.004

Keywords: CEC 2006, Constrained benchmark problems, Jaya algorithm, Optimization, Statistical tests, Unconstrained benchmark problems

Abstract: A simple yet powerful optimization algorithm is proposed in this paper for solving the constrained and unconstrained optimization problems. This algorithm is based on the concept that the solution obtained for a given problem should move towards the best solution and should avoid the worst solution. This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters. The performance of the proposed algorithm is investigated by implementing it on 24 constrained benchmark functions having different characteristics given in Congress on Evolutionary Computation (CEC 2006) and the performance is compared with that of other well-known optimization algorithms. The results have proved the better effectiveness of the proposed algorithm. Furthermore, the statistical analysis of the experimental work has been carried out by conducting the Friedman’s rank test and Holm-Sidak test. The proposed algorithm is found to secure first rank for the ‘best’ and ‘mean’ solutions in the Friedman’s rank test for all the 24 constrained benchmark problems. In addition to solving the constrained benchmark problems, the algorithm is also investigated on 30 unconstrained benchmark problems taken from the literature and the performance of the algorithm is found better.

How to cite this paper

 Rao, R. (2016). Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems.International Journal of Industrial Engineering Computations , 7(1), 19-34.

Refrences

Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandanavian Journal of Statistics, 6(2), 65-70.

Joaquin, D., Salvador, G., Daniel, M., & Francisco, H. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1), 3–18.

Karaboga, D., & Basturk, B. (2007). Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems, LNAI, SpringerVerlag Berlin, 4529, 789-798.

Karaboga, D., & Akay, B. (2009). A comparative study of Artificial Bee Colony algorithm. Applied Mathematics and Computation, 214(1) 108-132.

Karaboga, D., & Akay, B. (2011). A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems. Applied Soft Computing, 11, 3021-3031.

Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P.N., Coello, C.A.C., & Deb, K. (2006). Problem Definitions and Evaluation Criteria for the CEC 2006 Special Session On Constrained Real-Parameter Optimization, Technical Report, Nanyang Technological University, Singapore, http://www.ntu.edu.sg/home/EPNSugan.

Patel, V.K., & Savsani, V.J. (2015). Heat transfer search (HTS): a novel optimization algorithm. Information Sciences, 324, 217-246.

Rao, R.V. (2015). Teaching Learning Based Optimization And Its Engineering Applications. Springer Verlag, London.

Rao, R.V., & Patel, V. (2012). An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems. International Journal of Industrial Engineering Computations, 3(4), 535-560.

Rao, R.V., & Patel, V. (2013). Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems. International Journal of Industrial Engineering Computations, 4(1), 29-50.

Rao, R.V., Savsani, V.J. & Vakharia, D.P. (2011). Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design, 43(3), 303-315.