Cart (Loading....) | Create Account
Close category search window

The Improved Genetic Algorithm for Assingment 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)
Cheshmehgaz, H.R. ; Fac. of Comput. Sci. & Inf. Syst., Univ. Teknol. Malaysia (UTM), Skudai, Malaysia ; Haron, H. ; Jambak, M.I.

In this paper, we describe a new mechanism of cellular selection as an improved genetic algorithm for some optimization problems like cellular channel assignment which have multi feasible/optimum solution per one case. Considering the problems and the nature of relationship among individuals in population, we use 2-dimension cellular automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This idea as 2D cellular automata Hamming GA has introduced locality in genetic algorithms and global knowledge for their selection process on cells of 2D cellular automata. The selection based on 2D cellular automata can ensure maintaining population diversity and fast convergence in the genetic search. The cellular selection of individuals is controlled based on the structure of cellular automata, to prevent the fast population diversity loss and improve the convergence performance during the genetic search.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.