Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU28648" target="_blank" >RIV/00216305:26220/01:PU28648 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem
Original language description
: 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 becaause ofthe visualization simplicity but it can be extended to multiobjective optimization, too.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Proceedings of the 7th International Mendel Conference on Soft Computing
ISBN
80-214-1894-X
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
131-136
Publisher name
Faculty of Mechanical Engineering BUT
Place of publication
Brno
Event location
Brno
Event date
Nov 30, 2000
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—