“Discrete Convex Analysis” is aimed at establishing a novel theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The theoretical framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from ...

Optimization problems are considered that involve the multiplication of variable matrices to be selected from a given family, which might discrete set, continuous set or combination both. Such nonlinear, and possibly discrete, optimization arise in applications biology materials science among others, known NP-hard for special case interest. The underlying structure such is analysed two particul...

this paper presents a cuckoo optimization algorithm (coa) model for the cost optimization of the one-way and two-way reinforced concrete (rc) slabs according to aci code. the objective function is the total cost of the slabs including the cost of the concrete and that of the reinforcing steel. in this paper, one-way and two-way slabs with various end conditions are formulated as aci code. the t...

Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

Facility layout planning (FLP) involves a set of design problems related to the arrangement elements that shape industrial production systems in physical space. The fact they are considered one most important decisions as part business operation strategies, and their proven repercussion on systems’ costs, efficiency productivity, mean this theme has been widely addressed science. In context, pr...

Discrete convex analysis [18, 40, 43, 47] aims to establish a general theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from th...

Abstract. In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous, non-convex optimization problems. The principle of HKA is to explicitly consider the optimization problem as a measurement process designed to give an estimate of the optimum. A specific procedure, based on...

This paper presents the development of a mixed-variable optimization framework for the aeroelastic analysis and design of active twist rotors. Proper tailoring of the blade properties can lead to the maximization of the active twist and the control authority for vibration reductionunder operating conditions. Thus, usingmathematical optimization, the cross-sectional layout is designed using cont...

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...