Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems
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....
Main Author: | R. Venkata Rao |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2016-01-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol7/IJIEC_2015_32.pdf |
Similar Items
-
Review of applications of TLBO algorithm and a tutorial for beginners to solve the unconstrained and constrained optimization problems
by: R. Venkata Rao
Published: (2016-01-01) -
A comparative study of a teaching–learning-based optimization algorithm on multi-objective unconstrained and constrained functions
by: R. Venkata Rao, et al.
Published: (2014-09-01) -
A many-objective Jaya algorithm for many-objective optimization problems
by: Sandeep U. Mane, et al.
Published: (2018-09-01) -
Unconstrained numerical optimization using real-coded genetic algorithms: a study case using benchmark functions in R from Scratch
by: Omar Andres Carmona Cortes, et al.
Published: (2019-09-01) -
Master-Slave TLBO Algorithm for Constrained Global Optimization Problems
by: Sandeep Mane, et al.
Published: (2021-04-01)