Detail publikace

Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment

MATOUŠEK, R.

Anglický název

Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

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 algorithm denoted as a GA-HS. A different behavior of heuristic algorithms related to size of KS restriction is shown.

Vydáno

2002-11-07

Nakladatel

Humusoft, s.r.o.

Místo

Praha, CZ

ISBN

80-7080-500-5

Kniha

Matlab 2002

Strany od–do

315–

Počet stran

4

BIBTEX


@inproceedings{BUT10428,
  author="Radomil {Matoušek}",
  title="Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment",
  booktitle="Matlab 2002",
  year="2002",
  pages="4",
  publisher="Humusoft, s.r.o.",
  address="Praha, CZ",
  isbn="80-7080-500-5"
}