ACM Home Page
Please provide us with feedback. Feedback
Magnifier particle swarm optimization for numerical optimization
Full text PdfPdf (277 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
POSTER SESSION: Ant colony optimization, swarm intelligence, and artificial immune systems posters table of contents
Pages 167-168  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Junqi Zhang  Peking University, Beijing, China
Kun Liu  Peking University, Beijing, China
Ying Tan  Peking University, Beijing, China
Xingui He  Peking University, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 59,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389122
What is a DOI?

ABSTRACT

A novel particle swarm optimization algorithm based on magnification transformation, called magnifier particle swarm optimization (MPSO), is proposed for the first time in this paper. In the MPSO, we enlarge the range around the best individual of each generation like using a magnifier, while the velocity of particles unchanged. In such a way, MPSO achieves much faster convergence performance and better optimization solving capability than the conventional standard particle swarm optimization and latest clonal PSO by a number of simulations. A detailed description and explanation of the MPSO algorithm are given in the paper. Experiments on fourteen benchmark test functions are conducted and shows the inspiring success that the proposed MPSO speeds up the convergence tremendously, while keeping a good search capability of global solution with much more accuracy. Experiments on fourteen benchmark test functions are conducted to demonstrate that the proposed MPSO algorithm is able to speedup the evolution process distinctly and improve the performance of global optimizer greatly.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Kennedy and R. Eberhart, "Particle Swarm Optimization," Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, IEEE Service Center, Vol. 4. Piscataway, NJ, 1995, pp. 1942--1948.
 
2
Y. H. Shi and R. Eberhart, "A Modified Particle Swarm Optimizer," IEEE World Congress on Computational Intelligence, Alaska, ALTEC, vol. 1, 1998, pp.69--73.
 
3
Paul Blenkhorn and David Gareth Evans, "A Screen Magnifier Usin High Level' Implementation Techniques" IEEE TRANSACTIONS ON NEURAL SYSTEMS AND REHABILITATION ENGINEERING, vol. 14, no. 4, 2006, pp. 501--504.
 
4
Y. Tan and Z. M. Xiao, "Clonal Particle Swarm Optimization and Its Applications," IEEE Congress on Evolutionary Computation, 2007, pp. 2303--2309.

Collaborative Colleagues:
Junqi Zhang: colleagues
Kun Liu: colleagues
Ying Tan: colleagues
Xingui He: colleagues