Abstract
The present study proposes a novel variant of binary PSO employing gompertz function for generating binary numbers with an additional benefit of controlling its parametrs so as to induce an combined effect of sigmoid as well as linear function. The corresponding variant is termend as Gompertz Binary Particle Swarm Optimization (GBPSO). The proposed GBPSO is tested on a a well known suite of 5 continuous benchmark fuctions. Numerical results indicate the competence of the proposed mechanism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gompertz, B.: On the Nature of the Function Expressive of the Law of Human Mortality, and on a New Mode of Determining the Value of Life Contingencies. Phil. Trans. R. Soc. Lond. 115, 513–583 (1825), doi:10.1098/rstl.1825.0026
Kennedy, J., Eberhart, R.C.: A Discrete Binary Version of the Particle Swarm Algorithm. In: Proc. of IEEE 1997 Conference Systems Man Cybernetics, Piscataway, NJ, pp. 4104–4108 (1997)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE International Joint Conference on Neural Networks, pp. 1942–1948 (1995)
Luh, G.C., Lin, C.Y., Lin, Y.S.: A Binary Particle Swarm Optimization For Continuum structural topology Optimization. Applied Soft Computing 11, 2833–2844 (2011)
Sangwook, L., Park, H., Jeon, M.: Binary particle swarm optimization with bit change mutation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E-90A(10), 2253–2256 (2007)
Sangwook, L., Sangmoon, S., Sanghoun, O., Pedrycz, W., Jeon, M.: Modified binary particle swarm optimization. Progress in Natural Science 18, 1161–1166 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer India Pvt. Ltd.
About this paper
Cite this paper
Chauhan, P., Pant, M., Deep, K. (2012). Novel Binary PSO for Continuous Global Optimization Problems. In: Deep, K., Nagar, A., Pant, M., Bansal, J. (eds) Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011. Advances in Intelligent and Soft Computing, vol 130. Springer, India. https://doi.org/10.1007/978-81-322-0487-9_17
Download citation
DOI: https://doi.org/10.1007/978-81-322-0487-9_17
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0486-2
Online ISBN: 978-81-322-0487-9
eBook Packages: EngineeringEngineering (R0)