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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66–72 (1992)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. Genetic algorithms and their applications. In: Proceedings of the Second International Conference on Genetic Algorithms. Hillsdale. Lawrence Erlbaum, NJ (1987)
Krause, J. et al.: A survey of swarm algorithms applied to discrete optimization problems. In: Swarm Intelligence and Bio-inspired Computation: Theory and Applications. Elsevier Science & Technology Books, pp. 169–191 (2013)
Shukla, A., Pandey, H.M., Mehrotra. D.: Comparative review of selection techniques in genetic algorithm. In: 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE), IEEE (2015)
Pandey, H.M.: Performance evaluation of selection methods of genetic algorithm and network security concerns. Proc. Comput. Sci. 78, 13–18(2016)
Pandey, H.M. et al.: Evaluation of genetic algorithm’s selection methods. In: Information Systems Design and Intelligent Applications. Springer India, pp. 731–738 (2016)
Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines (1988)
Pandey, H.M., Chaudhary, A., Mehrotra, D.: A comparative review of approaches to prevent premature convergence in GA. Appl. Soft Comput. 24, 1047–1077 (2014)
Pandey, H.M., Dixit, A., Mehrotra, D.: Genetic algorithms: concepts, issues and a case study of grammar induction. In: Proceedings of the CUBE International Information Technology Conference. ACM (2012)
Pandey, H.M.: Parameters quantification of genetic algorithm. In: Information Systems Design and Intelligent Applications. Springer India, pp. 711–719 (2016)
Lewis, R.M., Torczon, V.: A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds. SIAM J. Optim. 12(4), 1075–1089 (2002)
Yin, S., Cagan, J.: An extended pattern search algorithm for three-dimensional component layout. J. Mech. Des. 122(1), 102–108 (2000)
Hwang, C.-R.: Simulated annealing: theory and applications. Acta Applicandae Mathematicae 12(1), 108–111 (1988)
Rao, R.: Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Ind. Eng. Comput. 7(1), 19–34 (2016)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)
Houck, C.R., Joines, J., Kay, M.G.: A genetic algorithm for function optimization: a Matlab implementation. NCSU-IE TR 95.09 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pandey, H.M., Rajput, M., Mishra, V. (2018). Performance Comparison of Pattern Search, Simulated Annealing, Genetic Algorithm and Jaya Algorithm. In: Satapathy, S., Bhateja, V., Raju, K., Janakiramaiah, B. (eds) Data Engineering and Intelligent Computing. Advances in Intelligent Systems and Computing, vol 542 . Springer, Singapore. https://doi.org/10.1007/978-981-10-3223-3_36
Download citation
DOI: https://doi.org/10.1007/978-981-10-3223-3_36
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3222-6
Online ISBN: 978-981-10-3223-3
eBook Packages: EngineeringEngineering (R0)