نتایج جستجو برای: optimization mixed continuous discrete metaheuristics

تعداد نتایج: 900469  

Journal: :VLSI Design 2008
Rehab F. Abdel-Kader

Instruction scheduling is an optimization phase aimed at balancing the performance-cost tradeoffs of the design of digital systems. In this paper, a formal framework is tailored in particular to find an optimal solution to the resource-constrained instruction scheduling problem in high-level synthesis. The scheduling problem is formulated as a discrete optimization problem and an efficient popu...

A. Kaveh, M. Kalateh-Ahani, M.S. Masoudi,

Evolution Strategies (ES) are a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection. Gaussian mutation captures pair-wise dependencies between the variables through a covariance matrix. Covariance Matrix Adaptation (CMA) is a method to update this covariance matrix. In this paper, the CMA-ES, which has found many applications in solving continuous optimizatio...

2017
Latifa DEKHICI Khaled BELKADI

Nature-inspired swarm metaheuristics become one of the most powerful methods for optimization. In discrete optimization, the efficiency of an algorithm depends on how it is adapted to the problem. This paper aims to provide a discretization of the Firefly Algorithm (FF) for the scheduling of a specific manufacturing system, which is the mono processors two-stage hybrid flow shop (HFS). This kin...

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

Journal: :Evolutionary computation 2018
Krzysztof L. Sadowski Dirk Thierens Peter A. N. Bosman

Learning and exploiting problem structure is one of the key challenges in optimization. This is especially important for black-box optimization (BBO) where prior structural knowledge of a problem is not available. Existing model-based Evolutionary Algorithms (EAs) are very efficient at learning structure in both the discrete, and in the continuous domain. In this article, discrete and continuou...

2007
Uroš Klanšek Tomaž Žula Zdravko Kravanja Stojan Kravanja

ABSTRACT: The paper presents the discrete dimension optimization of unbraced rigid steel plane frames. The optimization of steel frames was carried out by the Mixed-Integer Non-linear Programming (MINLP) approach. The MINLP is a combined discrete-continuous optimization technique. It performs the discrete optimization of discrete decisions simultaneously with the continuous optimization of cont...

2009
S. Kravanja

The paper presents the Mixed-Integer Non-Linear Programming (MINLP) approach to structural optimization. MINLP is a combined discrete/continuous optimization technique, where discrete binary 0-1 variables are defined for optimization of discrete alternatives and continuous variables for optimization of parameters. The MINLP optimization is performed through three steps: i.e. the generation of a...

2005
S. Kravanja

This paper presents a structural synthesis using the Mixed-Integer Non-Linear Programming (MINLP) approach. The MINLP is a combined discrete/continuous optimization technique, where discrete binary 0-1 variables are defined for optimization of discrete alternatives and continuous variables for optimization of parameters. The MINLP optimization to a structural synthesis is performed through thre...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید