Evolving feasible linear ordering problem solutions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F08%3A86085138" target="_blank" >RIV/61989100:27240/08:86085138 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/1456223.1456293" target="_blank" >http://dx.doi.org/10.1145/1456223.1456293</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/1456223.1456293" target="_blank" >10.1145/1456223.1456293</a>
Alternative languages
Result language
angličtina
Original language name
Evolving feasible linear ordering problem solutions
Original language description
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP-hard problem), rich collection of testing data and variety of real world applications. In this paper, we investigate the usage and performance oftwo variants of Genetic Algorithms - Mutation Only Genetic Algorithms and Higher Level Chromosome Genetic Algorithms - on the Linear Ordering Problem. Both methods are tested and evaluated on a collection of real world and artificial LOP instances. Copyright 2008 ACM.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
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
5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings
ISBN
978-1-60558-046-3
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
337-342
Publisher name
ACM
Place of publication
New York
Event location
Cergy-Pontoise
Event date
Oct 28, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—