By Topic

Multi-Guider and Cross-Searching Approach in Multi-Objective Particle Swarm Optimization for Electromagnetic Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Minh-Trien Pham ; Coll. of Electr. & Comput. Eng., Chungbuk Nat. Univ., Cheongju, South Korea ; Diahai Zhang ; Chang Seop Koh

The main difference between single and multi-objective optimizations using particle swarm optimization is how the guider to locate the global optimal and Pareto optimal solutions are defined in corresponding optimization problems. In general multi-objective particle swarm optimization, only one guider is selected, and, in order to reduce the non-dominated solution for more diversity in the external archive, only crowding distance in objective space is considered. This paper presents a new approach of selecting multiple guiders to lead a swarm toward a Pareto-front. Additionally, in order to overcome the local Pareto front, mutation operator is applied for not only particles but also members in an external archive. Furthermore, aside from considering the crowding distance of solutions in objective space to maintain the diversity of solutions, the crowding distance in variable space is also taken into account. The proposed algorithm is compared with recent approaches of multi-objective optimizer in solving a multi-objective version of the TEAM 22 benchmark optimization problem with three and eight design variables.

Published in:

Magnetics, IEEE Transactions on  (Volume:48 ,  Issue: 2 )