By Topic

Vector Evaluated Gravitational Search Algorithm (VEGSA) for Multi-objective Optimization 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

6 Author(s)
Ibrahim, Z. ; Fac. of Electr. & Electron. Eng., Univ. Malaysia, Pekan, Malaysia ; Muhammad, B. ; Ghazali, K.H. ; Kian Sheng Lim
more authors

This paper presents a novel algorithm, which is based on Gravitational Search Algorithm (GSA), for multiobjective optimization problems. The proposed algorithm, which is called Vector Evaluated Gravitational Search Algorithm (VEGSA), uses a number of populations of particles. In particular, a population of particles corresponds to one objective function to be minimized or maximized. Simultaneous minimization or maximization of every objective function is realized by exchanging a variable between populations. Two versions of VEGSA algorithm are presented in this study. Convex and non-convex test functions on biobjective optimization problems are used to evaluate the effectiveness of the proposed VEGSA.

Published in:

Computational Intelligence, Modelling and Simulation (CIMSiM), 2012 Fourth International Conference on

Date of Conference:

25-27 Sept. 2012