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

Finding balanced graph bi-partitions using a hybrid genetic algorithm

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)
Steenbeek, A.G. ; CWI, Amsterdam, Netherlands ; Marchiori, E. ; Eiben, A.E.

Proposes a hybrid genetic algorithm (GA) for the graph-balanced bi-partition problem, a challenging NP-hard combinatorial optimization problem arising in many practical applications. The hybrid character of the GA lies in the application of a heuristic procedure to improve candidate solutions. The basic idea behind our heuristic is to identify and exploit clusters, i.e. subgraphs with a relatively high edge density. The resulting hybrid genetic algorithm turns out to be very effective, both in terms of quality of solutions and running time. On a large class of benchmark families of graphs, our hybrid genetic algorithm yields results of the same or better quality than those obtained by all other heuristic algorithms we are aware of, for comparable running times

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998

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.