Modeling Permutations for Genetic Algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A86075454" target="_blank" >RIV/61989100:27240/09:86075454 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modeling Permutations for Genetic Algorithms
Original language description
Combinatorial optimization problems form a class of appealing theoretical and practical problems attractive for their complexity and known hardness. They are often NP-hard and as such not solvable by exact methods. Combinatorial optimization problems aresubject to numerous heuristic and metaheuristic algorithms, including genetic algorithms. In this paper, we present two new permutation encodings for genetic algorithms and experimentally evaluate the influence of the encodings on the performance and result of genetic algorithm on two synthetic and real-world optimization problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
Article name in the collection
2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION
ISBN
978-1-4244-5330-6
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Place of publication
NEW YORK
Event location
Malacca, MALAYSIA
Event date
Dec 4, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000277207700018