Decision making is indispensable to any optimization in intelligent computing. In this study, we discuss a mathematical foundation for bilateral decision making under synchronous and asynchronous time constraint. The problem on time constraint is to evaluate the cost of time or the value of the entire duration of certain decision process. We propose a formula to compute the cost of time by intr...

Randomly-generated constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an `easy-soluble' region, where problems have many solutions and are almost always easy to solve. However, in this region, systematic search algorithms may occasionally encounter problems which are extremely expensive to solve. It has been suggested that i...

Here we show how to ensure a constant cost for the computation-unit in graphs depicting the number of (sequential) computation-units at different problem sizes. This is needed for a meaningful evaluation of scalability and efficiency, specially for distributed computations where it is an assumption of the measurement. We report empirical evaluation with ADOPT revealing that the computation cost...

The symmetric cardinality constraint is described in terms of a set of variables X = {x1, . . . , xk}, which take their values as subsets of V = {v1, . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi , uxi ] and at the same time it restricts the number of occurrences of each value vj ∈ V in the sets assigned to variables in X to be in an ...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

We present a new family of algorithms that solve the bias problem in the equation-error based adaptive in nite impulse response (IIR) ltering. A novel constraint, called the constant-norm constraint, uni es the quadratic constraint and the monic one. By imposing the monic constraint on the mean square error (MSE) optimization, the merits of both constraints are inherited and the shortcomings ar...

Optimum laminate configuration for minimum weight of filament–wound laminated conical shells subject to buckling load constraint is investigated. In the case of a laminated conical shell the thickness and the ply orientation (the design variables) are functions of the shell coordinates, influencing both the buckling load and its weight. These effects complicate the optimization problem consider...

In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...

Optimization of the product portfolio has been recognized as a critical problem in industry, management, economy and so on. It aims at the selection of an optimal mix of the products to offer in the target market. As a probability function, reliability is an essential objective of the problem which linear models often fail to evaluate it. Here, we develop a multiobjective integer nonlinear cons...