Title :
Solving graphical Steiner tree problem using parallel genetic algorithm
Author :
Huy, Nguyen Viet ; Nghia, Nguyen Duc
Author_Institution :
Dept. of Comput. Sci., Hanoi Univ. of Technol., Hanoi
Abstract :
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.
Keywords :
genetic algorithms; trees (mathematics); binary encoding; combinatorial optimization problem; distance network heuristic; global population model; graphical Steiner tree problem; parallel genetic algorithm; Computer science; Costs; Encoding; Genetic algorithms; Information technology; Polynomials; Roads; Steiner trees; Testing; Tree graphs; Steiner tree problem; parallel genetic algorithm;
Conference_Titel :
Research, Innovation and Vision for the Future, 2008. RIVF 2008. IEEE International Conference on
Conference_Location :
Ho Chi Minh City
Print_ISBN :
978-1-4244-2379-8
Electronic_ISBN :
978-1-4244-2380-4
DOI :
10.1109/RIVF.2008.4586329
