By Topic

DNA words based on an enhanced algorithm of multi-objective particle swarm optimization in a continuous search space

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

5 Author(s)
Selvan, K.V. ; Dept. of Electron. Eng., Univ. Malaysia Sarawak, Kota Samarahan, Malaysia ; Muhammad, M.S. ; Masra, S.M.W. ; Ibrahim, Z.
more authors

In this paper, particle swarm optimization algorithm in a continuous search space is implemented to generate a set of DNA words. A single swarm with 20 particles is used to find the best solution (gbest). Here, each particle has a number of sub-particles which is referred as the number of sequences to be designed. Overall, the particle which has the optimum fitness value is considered as the best solution. Fitness value of a particle is computed from the average value of all the applied objective functions. The solution obtained from this algorithm is found to be better as compared with other approaches. Furthermore, it has a fast convergence towards the optimum fitness value.

Published in:

Electrical, Control and Computer Engineering (INECCE), 2011 International Conference on

Date of Conference:

21-22 June 2011