A Study on Performance of MOGA and HLCGA for the 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%2F09%3A00020944" target="_blank" >RIV/61989100:27240/09:00020944 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Study on Performance of MOGA and HLCGA for the 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 on a 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/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
IEEE CONFERENCE ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS SMCIA/08
ISBN
978-1-4244-3782-5
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
Muroran, JAPAN
Event date
Jun 25, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000272228200072