Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

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.

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

BibTex


@inproceedings{BUT5430,
  author="Josef {Schwarz} and Jiří {Očenášek}",
  title="Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem",
  annote=": 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.",
  address="Faculty of Mechanical Engineering BUT",
  booktitle="Proceedings of the 7th International Mendel Conference on Soft Computing",
  chapter="5430",
  institution="Faculty of Mechanical Engineering BUT",
  year="2001",
  month="june",
  pages="131--136",
  publisher="Faculty of Mechanical Engineering BUT",
  type="conference paper"
}