Performance comparison of pattern search, simulated annealing, genetic algorithm and jaya algorithm

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we have shown the performance comparison of four powerful global optimization algorithms, namely Pattern Search, Simulated Annealing, Genetic Algorithm and Jaya Algorithm. All of these algorithms are used to find an optimum solution. The standard benchmark functions are utilized for the implementation. The results are collected and analyzed that helps to classify the algorithms according to their computational capability to solve the optimization problems.

Cite

CITATION STYLE

APA

Pandey, H. M., Rajput, M., & Mishra, V. (2018). Performance comparison of pattern search, simulated annealing, genetic algorithm and jaya algorithm. In Advances in Intelligent Systems and Computing (Vol. 542, pp. 377–384). Springer Verlag. https://doi.org/10.1007/978-981-10-3223-3_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free