Multiobjective Bayesian Optimization Algorithm for Combinatorial Problems: Theory and Practice
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU28723" target="_blank" >RIV/00216305:26220/01:PU28723 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Multiobjective Bayesian Optimization Algorithm for Combinatorial Problems: Theory and Practice
Original language description
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the multiobjective optimization of combinatorial problems. Three probabilistic models used in the Estimation Distribution Algorithms (EDA), such as UMDA, BMDA and BOA which allow to search effectively on the promising areas of the combinatorial search space are discussed. The main attention is focused on the incorporation of Pareto optimality concept into classical structure of the BOA algorithm. We have modified tthe standard algorithm BOA for one criterion optimization utilizing the known niching techniques to find the Pareto optimal set. The experiments are focused on tree classes of the combinatorial problems: artificial problem with known Pareto set, multiple 0/1knapsack problem and the bisectioning of hypergraphs as well.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
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
Name of the periodical
NEURAL NETWORK WORLD
ISSN
1210-0552
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
5
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
19
Pages from-to
423-441
UT code for WoS article
—
EID of the result in the Scopus database
—