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

In this paper we present a new image thresholding method based on a multiobjective Genetic Algorithm using the Pareto optimality approach. We aim to optimize multiple criteria in order to increase the segmentation quality. Thus, we’ve adapted the well known Non Domination Sorting Genetic Algorithm for this purpose so that it takes into consideration the contribution of the objective functions i...

This paper addresses optimal architectural design using BIM at the design stage. We present a comparative study of the differences between datacentric and process-driven interoperability approaches during the design phases. The authors will elaborate on two approaches, summarize their consequences, and present a real application of the approach using a DAI (Design Analysis Integration) prototyp...

" We show that, in markets with indivisibilities (typified by the Shapley-Scarf housing market), the strict core mechanism is categorically determined by three assumptions: individual rationality, Pareto optimality and strategy-proofness.

For a Pareto maximization problem defined in infinite dimensions in terms of cones, relationships among several types of maximal elements are noted and optimality conditions are developed in terms of tangent cones.

We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31

We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31

Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circu...

We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions. Two types of Karush-Kuhn-Tucker optimality conditions with support functions are introduced. Sufficient optimality conditions are presented by using generalized convexity and certain regularity conditions. We formulate Wolfe-type dual and Mond-Weirtype dual problems for our nonsmo...