Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
Three simple metaphor-less optimization algorithms are developed in this paper for solving the unconstrained and constrained optimization problems. These algorithms are based on the best and worst solutions obtained during the optimization process and the random interactions between the candidate so...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2020-01-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Subjects: | |
| Online Access: | http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_16.pdf |
| Summary: | Three simple metaphor-less optimization algorithms are developed in this paper for solving the unconstrained and constrained optimization problems. These algorithms are based on the best and worst solutions obtained during the optimization process and the random interactions between the candidate solutions. These algorithms require only the common control parameters like population size and number of iterations and do not require any algorithm-specific control parameters. The performance of the proposed algorithms is investigated by implementing these on 23 benchmark functions comprising 7 unimodal, 6 multimodal and 10 fixed-dimension multimodal functions. Additional computational experiments are conducted on 25 unconstrained and 2 constrained optimization problems. The proposed simple algorithms have shown good performance and are quite competitive. The research community may take advantage of these algorithms by adapting the same for solving different unconstrained and constrained optimization problems. |
|---|---|
| ISSN: | 1923-2926 1923-2934 |