Detail publikace

Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem

SCHWARZ, J. OČENÁŠEK, J.

Originální název

Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

: This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the Pareto bi-criteria optimization of the 0/1 knapsack problem. The main attention is focused on the incorporation of the Pareto optimality concept into classical structure of the BOA algorithm. We have modified the standard algorithm BOA for one criterion optimization utilizing the known niching techniques to find the Pareto optimal set. The experiments are focused mainly on the bi-criteria optimization because of the visualization simplicity but it can be extended to multiobjective optimization, too.

Klíčová slova

Knapsack problem, multiobjective optimization, Pareto set, evolutionary algorithms, Bayesian optimization algorithm, niching techniques

Autoři

SCHWARZ, J.; OČENÁŠEK, J.

Rok RIV

2001

Vydáno

7. 6. 2001

Nakladatel

Faculty of Mechanical Engineering BUT

Místo

Brno

ISBN

80-214-1894-X

Kniha

Proceedings of the 7th International Mendel Conference on Soft Computing

Strany od

131

Strany do

136

Strany počet

6

URL

http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/mend01.pdf

BibTex

@inproceedings{BUT5430,
  author="Josef {Schwarz} and Jiří {Očenášek}",
  title="Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem",
  booktitle="Proceedings of the 7th International Mendel Conference on Soft Computing",
  year="2001",
  pages="131--136",
  publisher="Faculty of Mechanical Engineering BUT",
  address="Brno",
  isbn="80-214-1894-X",
  url="http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/mend01.pdf"
}