Genetic Algorithms for the Use in Combinatorial Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00020948" target="_blank" >RIV/61989100:27240/09:00020948 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Genetic Algorithms for the Use in Combinatorial Problems
Original language description
Turbo code interleaver optimization is a NP-hard combinatorial optimization problem attractive for its complexity and variety of real world applications. In this paper, we investigate the usage and performance of recent variant of genetic algorithms, higher level chromosome genetic algorithms, on the turbo code optimization task. The problem as well as higher level chromosome genetic algorithms, that can be use for combinatorial optimization problems in general, is introduced and experimentally evaluated.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: New methods od data transmition based on turbo code</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
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
Book/collection name
Foundations of Computational Intelligence Volume 3
ISBN
978-3-642-01084-2
Number of pages of the result
20
Pages from-to
—
Number of pages of the book
528
Publisher name
Springer Heidelberg
Place of publication
Berlín
UT code for WoS chapter
—