Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Proceedings of the twelfth International Symposium on Interdisciplinary Electromagnetic, Mechanic and Biomedical Problems, ISEM Bad Gastein
Article type: Research Article
Authors: Luo, Pinga; * | Ni, Peihonga | Yao, Lihaib | Ho, S.L.c | Ni, GuangZhenga | Xia, Haixiaa
Affiliations: [a] College of Electrical Engineering, Zhejiang University, Hangzhou, 310027, China | [b] Zhejiang University City College, Hangzhou, 310015, China | [c] Department of Electrical Engineering, The Hong Kong Polytechnic University, Hong Kong
Correspondence: [*] Corresponding author. Fax: +86 (571) 87951915; E-mail: [email protected]
Abstract: In this paper, a new hybrid Particle Swarm Optimization algorithm is introduced which makes use of the characteristics of Simulated Annealing method, and the crossover and mutation operations of Genetic Algorithms. Simulation results demonstrate that the proposed algorithm observes faster convergent rate for a certain class of optimal problems.
Keywords: Particle swarm optimization, crossover, mutation, optimization
DOI: 10.3233/JAE-2007-764
Journal: International Journal of Applied Electromagnetics and Mechanics, vol. 25, no. 1-4, pp. 705-710, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]