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

článek ve sborníku ve WoS nebo 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.

Anglický 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.

Klíčová slova anglicky

Hill Climbing, Genetic Algorithm, Knapsack Problem

Rok RIV

2002

Vydáno

07.11.2002

Nakladatel

Humusoft, s.r.o.

Místo

Praha, CZ

ISBN

80-7080-500-5

Kniha

Matlab 2002

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",
  month="November",
  publisher="Humusoft, s.r.o.",
  address="Praha, CZ",
  isbn="80-7080-500-5"
}