Publication detail

Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment

MATOUŠEK, R.

English title

Hybrid Genetic Algorithms and Knapsack Problem in MATLAB Environment

Type

conference paper

Language

en

Original abstract

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.

English abstract

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.

Keywords in English

Hill Climbing, Genetic Algorithm, Knapsack Problem

RIV year

2002

Released

07.11.2002

Publisher

Humusoft, s.r.o.

Location

Praha, CZ

ISBN

80-7080-500-5

Book

Matlab 2002

Pages count

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"
}