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...

Full description

Bibliographic Details
Main Author: Ravipudi Venkata Rao
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
id doaj-9f5e10e44924435d888ea062b7dac8cf
record_format Article
spelling doaj-9f5e10e44924435d888ea062b7dac8cf2020-11-25T00:23:36ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342020-01-0111110713010.5267/j.ijiec.2019.6.002Rao algorithms: Three metaphor-less simple algorithms for solving optimization problemsRavipudi Venkata RaoThree 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.http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_16.pdfMetaphor-less algorithmsOptimizationBenchmark functions
collection DOAJ
language English
format Article
sources DOAJ
author Ravipudi Venkata Rao
spellingShingle Ravipudi Venkata Rao
Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
International Journal of Industrial Engineering Computations
Metaphor-less algorithms
Optimization
Benchmark functions
author_facet Ravipudi Venkata Rao
author_sort Ravipudi Venkata Rao
title Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
title_short Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
title_full Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
title_fullStr Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
title_full_unstemmed Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
title_sort rao algorithms: three metaphor-less simple algorithms for solving optimization problems
publisher Growing Science
series International Journal of Industrial Engineering Computations
issn 1923-2926
1923-2934
publishDate 2020-01-01
description 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.
topic Metaphor-less algorithms
Optimization
Benchmark functions
url http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_16.pdf
work_keys_str_mv AT ravipudivenkatarao raoalgorithmsthreemetaphorlesssimplealgorithmsforsolvingoptimizationproblems
_version_ 1725356123826946048