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

l(bi, b + i , b − i ) = max ( 0, ρ+H(bi, b + i ))−H(bi, b − i )) ) , (1) whereH(·, ·) is the Hamming distance between hash codes, ρ is a margin between the Hamming distances of withincluster code pair {bi, b+i } and between-cluster code pair {bi, bi }. The hinge loss is a convex approximation to the 0-1 ranking error, which measures the network’s violation of the ranking order specified in the ...

an elliptical tank cross-section is formulated to explore and optimization method, based on a real-coded genetic algorithm to enhance the roll stability limit of a tank vehicle. a shape genetic algorithm optimization problem is applied to minimize the overturning moment imposed on the vehicle due to c.g. height of the liquid load, and lateral acceleration and cargo load shift . the minimization...

We propose a natural cost function for the bi-clustering task, the monochromatic cost. This cost function is suitable for detecting meaningful homogeneous bi-clusters based on categorical valued input matrices. Such tasks arise in many applications, such as the analysis of social networks and in systemsbiology where researchers try to infer functional grouping of biological agents based on thei...

Business Intelligence (BI) relies on corporate data to derive information for supporting strategic decisions. Source data internal to the corporation are used to assess productivity, lucrativeness, quality, etc, whereas external data are used to evaluate market share, expansion opportunities, competitiveness, etc. In a typical BI scenario, structured data, usually gathered from application data...

A new formulation of bi-objective optimization for the general capacitor placement and sizing problem is presented. The objectives include energy loss reduction, investment cost minimization, and maximum voltage deviation improvement. The operating and expansion constraints of the system are considered for practical needed. Also, both fixed and switched types of capacitors are included. A parti...

Product portfolio management (PPM) is a critical decision-making for companies across various industries in today's competitive environment. Traditional studies on PPM problem have been motivated toward engineering feasibilities and marketing which relatively pay less attention to other competitors' actions and the competitive relations, especially in mathematical optimization domain. The key c...

In this paper we consider the Convex Quadratic Optimization problem with simultaneous perturbation in the right-hand-side of the constraints and the linear term of the objective function with different parameters. The regions with invariant optimal partitions are investigated as well as the behavior of the optimal value function on the regions. We show that identifying these regions can be done...

Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. It has previously been applied to the TSP and QAP with encouraging results that demonstrate its potential. In this paper, we present FF-AS-SBP, an algorithm that applies ACO to the ship berthing problem (SBP), a generalization ...