By Topic

Solving graphical Steiner tree problem using parallel 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
$33 $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

2 Author(s)
Nguyen Viet Huy ; Department of Computer Science, Faculty of Information Technology, Hanoi University of Technology, No.1, Dai Co Viet road, Vietnam ; Nguyen Duc Nghia

The graphical Steiner tree problem is a classical combinatorial optimization problem that appears in many practically important applications. This paper presents a new parallel genetic algorithm for solving the problem. The presented algorithm is based on binary encoding, used the Distance Network Heuristic for evaluating fitness of individuals and is implemented in parallel using global population model. The results of experiments on the OR-Library tests are reported to show the algorithmpsilas performance in comparison with other metaheuristics for the given problem. The speed-up of the parallel implementation is also discussed.

Published in:

Research, Innovation and Vision for the Future, 2008. RIVF 2008. IEEE International Conference on

Date of Conference:

13-17 July 2008