Pregled bibliografske jedinice broj: 37089
Evolutionary Algorithm for Steiner Tree Optimization
Evolutionary Algorithm for Steiner Tree Optimization // Proc. of the 21st Int. Conf. ITI'99 - Information Technology Interfaces / Kalpić, D. Hljuz, V. (ur.).
Zagreb: Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu, 1999. str. 425-432 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 37089 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Evolutionary Algorithm for Steiner Tree Optimization
Autori
Šmuc, Tomislav ; Bogunović, Nikola ; Šarić, Davor
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proc. of the 21st Int. Conf. ITI'99 - Information Technology Interfaces
/ Kalpić, D. Hljuz, V. - Zagreb : Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu, 1999, 425-432
Skup
21st Int. Conf. ITI'99 - Information Technology Interfaces
Mjesto i datum
Pula, Hrvatska, 15.06.1999. - 18.06.1999
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Steiner problem in graphs; evolutionary algorithm; search control; OR-library
Sažetak
Steiner problem in graphs represents a search for the minimal-length tree connecting a subset of nodes in an undirected graph with nonnegative edge costs, G=(N,E,c). In this work we present an algorithm for obtaining nearly optimal Steiner trees in sparse graphs. Concept of coding of Steiner trees in the algorithm is simple and important for the formulation of a set of genetic operators used in a search. The structure of the algorithm and its main operators is described. Results obtained on a set of SPG instances from the OR-library are presented and discussed
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika
