Performance Comparison of Pattern Search, Simulated Annealing, Genetic Algorithm and Jaya Algorithm

Pandey, Hari, Rajput, Manjul and Varun, Mishra (2017) Performance Comparison of Pattern Search, Simulated Annealing, Genetic Algorithm and Jaya Algorithm. IC3T 2016 : Third Springer International Conference on Computer & Communication Technologies, 28/10/2016-29/10/2018, India, 542, pp. 377-384, ISBN 978-981-10-3222-6, ISSN 2194-5357, DOI https://doi.org/10.1007/978-981-10-3223-3_36.

Item not available from this archive. (Request a copy)

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.

Item Type: Conference or Workshop Item (Proceedings)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Computing and Information Systems
Date Deposited: 19 Oct 2018 14:42
URI: http://repository.edgehill.ac.uk/id/eprint/10761

Archive staff only

Item control page Item control page