Skip to main content

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

  • Conference paper
  • First Online:
Data Engineering and Intelligent Computing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 542 ))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66–72 (1992)

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. Pandey, H.M.: Performance evaluation of selection methods of genetic algorithm and network security concerns. Proc. Comput. Sci. 78, 13–18(2016)

    Google Scholar 

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

    Google Scholar 

  7. Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines (1988)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. Pandey, H.M.: Parameters quantification of genetic algorithm. In: Information Systems Design and Intelligent Applications. Springer India, pp. 711–719 (2016)

    Google Scholar 

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

    Google Scholar 

  12. Yin, S., Cagan, J.: An extended pattern search algorithm for three-dimensional component layout. J. Mech. Des. 122(1), 102–108 (2000)

    Article  Google Scholar 

  13. Hwang, C.-R.: Simulated annealing: theory and applications. Acta Applicandae Mathematicae 12(1), 108–111 (1988)

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Houck, C.R., Joines, J., Kay, M.G.: A genetic algorithm for function optimization: a Matlab implementation. NCSU-IE TR 95.09 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hari Mohan Pandey .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics