Metaheuristics for the Graphical Steiner Tree Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21358" target="_blank" >RIV/00216305:26210/01:PU21358 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Metaheuristics for the Graphical Steiner Tree Problem
Original language description
The graphical Steiner tree problem finds a shortest tree spanning a given vertex subset within a network. It is an NP-complete problem and therefore for large scaled instances, the optimal solution cannot be found in a reasonable amount of time, being usually solved by approximation or deterministic heuristic methods. This paper proposes an approach that uses two stochastic heuristic methods (genetic algorithms and simulated annealing) applied to a binary string representation of Steiner vertices candiddates. These methods are tested on standard benchmarks from OR-Library and suitable parameter settings are recommended to achieve good solutions
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 12th International DAAAM Symposium
ISBN
3-901509-19-4
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
431-432
Publisher name
Jena University of Applied Sciences
Place of publication
Jena
Event location
Jena, Germany
Event date
Oct 24, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—