Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/18998
Title: Novel binary PSO for continuous global optimization problems
Authors: Chauhan P.
Pant M.
Deep, K.
Published in: Proceedings of Advances in Intelligent and Soft Computing
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. © 2012 Springer India Pvt. Ltd.
Citation: Proceedings of Advances in Intelligent and Soft Computing, (2012), 169- 176. Roorkee
URI: https://doi.org/10.1007/978-81-322-0487-9_17
http://repository.iitr.ac.in/handle/123456789/18998
Issue Date: 2012
Keywords: Binary PSO
Gompertz function
Paramters
Binary number
Binary particle swarm optimization
Binary PSO
Combined effect
Global optimization problems
Gompertz function
Linear functions
Numerical results
Paramters
Problem solving
Soft computing
Global optimization
ISBN: 9.79E+12
ISSN: 18675662
Author Scopus IDs: 35752990300
23467551900
8561208900
Author Affiliations: Chauhan, P., Indian Institute of Technology Roorkee, Roorkee, India
Pant, M., Indian Institute of Technology Roorkee, Roorkee, India
Deep, K., Indian Institute of Technology Roorkee, Roorkee, India
Corresponding Author: Chauhan, P.; Indian Institute of Technology Roorkee, Roorkee, India; email: pinkeychauhan030@gmail.com
Appears in Collections:Conference Publications [MA]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.