a successful software should be finalized with determined and predetermined cost and time. software is a production which its approximate cost is expert workforce and professionals. the most important and approximate software cost estimation (sce) is related to the trained workforce. creative nature of software projects and its abstract nature make extremely cost and time of projects difficult ...

the pupose of this paper is modeling of partial digest problem (pdp) as a mathematical programming problem. in this paper we present a new viewpoint of pdp. we formulate the pdp as a continuous optimization problem and develope a method to solve this problem. finally we constract a linear programming model for the problem with an additional constraint. this later model can be solved by the simp...

Insurance-linked securities portfolio with the VaR constraint optimization problem have a kind of weak dominance or ordering property, which enables us to reduce the variables’ dimensions gradually through exercising a genetic algorithm with randomly selected initial populations. This property also enables us to add boundary attraction potential to GA-MPC’s repair operator, among other modifica...

1 Technical University of Cluj-Napoca Abstract -The paper proposes a new multiobjective optimization method, based on fuzzy techniques. The method performs a real multiobjective optimization, every parameter modification taking into account the unfulfillment degrees of all the requirements. It uses fuzzy sets to define fuzzy objectives and fuzzy systems to compute new parameter values. The stra...

This work presents a method (CDOM) for optimizing multiple system level assembly characteristics of complex mechanical assemblies by placement of their components. It addresses any component shape (including non-convex, hollow, sharp edges) connected together by functional constraints. This method finds multiple solutions to the Engineering Configuration Design Problem (ECDP) and proposes a sim...

Derivative free optimization (DFO) methods are typically designed to solve optimization problems whose objective function is computed by a “black box”; hence, the gradient computation is unavailable. Each call to the “black box” is often expensive, so estimating derivatives by finite differences may be prohibitively costly. Finally, the objective function value may be computed with some noise, ...

in this paper, we introduce a model  to optimization of milk run system that is one of vrp problem with time window and uncertainty in inventory. this approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .the problem is formulated as a robust optimization problem. since the resulted problem illustrates that grows up ...