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

Distance based hybrid genetic algorithm: an application for the graph coloring problem

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

4 Author(s)
Tagawa, K. ; Dept. of Electr. & Electron. Eng., Kobe Univ., Japan ; Kanesige, K. ; Inoue, K. ; Haneda, Hiromasa

A hybrid genetic algorithm (GA) which combines the global search power of GA with the local search power of a local optimization algorithm is described for the graph coloring problem (GCP). Each solution of the GCP, which is called phenotype, is represented by a set of isomorphic genotypes conceptually. Then, a metric function between two phenotypes is defined by the least Hamming distance between the corresponding sets of isomorphic genotypes. The phenotypic distance is useful to analyze and control the behavior of genotypes in the search space from the view point of the problem space. A new crossover technique named harmonic crossover is proposed for the GCP. The phenotypic distance between two parents is considered in the harmonic crossover for preserving their common characteristics. Furthermore, the phenotypic distance between two parents is also used to predict promising regions in the problem space. In the proposed hybrid GA for the GCP, the local optimization algorithm is applied only in the most promising regions restrictedly and intensively. Consequently, the run of the local optimization algorithm does not hinder the performance of GA in its progress of global search

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference:

1999

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.