Abstract
A comprehensive comparison of two powerful evolutionary computational algorithms: Genetic Algorithm and Particle Swarm Optimization have been presented in this paper. Both the algorithms have the global exploration capability; is being applied to the difficult optimization problems. The operators of each algorithm greatly contribute to the success have been reviewed, focusing on how they affect the searching in the problem space. The rationale of conducting this study is: to bring additional insights into how these algorithms work, and suggest remedies, if incorporated, improves the performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Eberhart, Russ C., and James Kennedy. “A new optimizer using particle swarm theory.” Proceedings of the sixth international symposium on micro machine and human science. Vol. 1. 1995.
Goldberg, David E., and John H. Holland. “Genetic algorithms and machine learning.” Machine learning 3.2 (1988): 95–99.
Shi, Yuhui, and Russell Eberhart. “A modified particle swarm optimizer.” Evolutionary Computation, Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Conference on. IEEE, 1998.
Van den Bergh, Frans, and Andries Petrus Engelbrecht. “Cooperative learning in neural networks using particle swarm optimizers.” South African Computer Journal 26 (2000): p-84.
Pandey, Hari Mohan, Ankit Chaudhary, and Deepti Mehrotra. “A comparative review of approaches to prevent premature convergence in GA.” Applied Soft Computing 24 (2014): 1047–1077.
Premalatha, K., and A. M. Natarajan. “Hybrid PSO and GA for global maximization.” Int. J. Open Problems Compt. Math 2.4 (2009): 597–608.
Pandey, Hari Mohan. “Parameters Quantification of Genetic Algorithm.” Information Systems Design and Intelligent Applications. Springer India, 2016. 711–719.
Pandey, Hari Mohan, et al. “Evaluation of Genetic Algorithm’s Selection Methods.” Information Systems Design and Intelligent Applications. Springer India, 2016. 731–738.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pandey, H.M. (2017). Genetic Algorithm and Particle Swarm Optimization: Analysis and Remedial Suggestions. In: Satapathy, S., Bhateja, V., Raju, K., Janakiramaiah, B. (eds) Computer Communication, Networking and Internet Security. Lecture Notes in Networks and Systems, vol 5. Springer, Singapore. https://doi.org/10.1007/978-981-10-3226-4_44
Download citation
DOI: https://doi.org/10.1007/978-981-10-3226-4_44
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3225-7
Online ISBN: 978-981-10-3226-4
eBook Packages: EngineeringEngineering (R0)