Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU34533" target="_blank" >RIV/00216305:26210/02:PU34533 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment
Original language description
This paper discusses applications of specific heuristic methods for solvin an optimization problem known as the 0/1 Knapsack problem (KS). A Hill Climbing algorithm (HC) and Genetic Algorithm (GA) was used for design of special heuristic hybrid algorithmdenoted as a GA-HS. A different behavior of heuristic algorithms related to size of KS restriction is shown.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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
Matlab 2002
ISBN
80-7080-500-5
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
315-318
Publisher name
Humusoft, s.r.o.
Place of publication
Praha, CZ
Event location
Praha
Event date
Nov 7, 2002
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—