Referenced Items are not available for this document.
A modified particle swarm optimization (PSO) algorithm is proposed in this paper to avoid premature convergence with the introduction of mutation operation. The performance of this algorithm is compared to the standard PSO algorithm and experiments indicate that it has better performance with little overhead.
Published in:
Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on
(Volume:5
)
Date of Conference: 18-21 Aug. 2005
- Page(s):
- 2993 - 2995 Vol. 5
- Print ISBN:
- 0-7803-9091-1
- INSPEC Accession Number:
- 8946048
- Conference Location :
- Guangzhou, China
- Digital Object Identifier :
- 10.1109/ICMLC.2005.1527455
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
