Evolutionary Approaches to Linear Ordering Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F08%3A00021459" target="_blank" >RIV/61989100:27240/08:00021459 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Evolutionary Approaches to Linear Ordering Problem
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 ona collection of real world and artificial LOP instances.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET100300414" target="_blank" >1ET100300414: Intelligent methods for incresing of reliability of electrical networks</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
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
DEXA 2008
ISBN
978-0-7695-3299-8
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos, California
Event location
Turin, Italy
Event date
Sep 1, 2008
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000259487400095