Constrained Based Search
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Design Optimization of a Random Suspension Device Considering a Reliability Constraint on the Frequency Response Function
Abstract This work deals with the design of a suspension device, idealized as a spring-mass-damper system. The amplitude of a nominal system is constrained to satisfy certain limitations in a given frequency band and the design is to be done as a reliability-based optimization. This constitutes a major difficulty since the constraint becomes a random process
Lat. Am. j. solids struct.. Publicado em: 2016-06
-
2. Sequential quadratic programming and constraint qualification / Programação quadratica sequencial e condições de qualificação
In the context of constrained optimization problems, we face the optimality conditions and also constraint qualification. Our aim is to study with details several constraint qualification, highlighting the constant positive linear dependence condition, and its influence in Sequential Quadratic Programming algorithms convergence. The relevance of this study i
Publicado em: 2009
-
3. Busca meta-heurÃstica para resoluÃÃo de CSP em teste de software
The meta-heuristic search algorithms have been researched in several domains, including in constraint satisfaction problem. Due to its good adaptability to be used in problems where the actual solution is unknown, they are applied in innumerous contexts. The evolutive algorithms are a search algorithm family that simulates the nature behavior. The constraint
Publicado em: 2009
-
4. Uma arquitetura neuro-genética para otimização não-linear restrita / Neuro-genetic architecture for constrained nonlinear optimization
Systems based on artificial neural networks and genetic algorithms are an alternative method for solving systems optimization problems. The genetic algorithms must its popularity to make possible cover nonlinear and extensive search spaces. Artificial neural networks have high processing rates due to the use of a massive number of simple processing elements
Publicado em: 2007
-
5. Estratégias evolutivas com mutações governadas por distribuições estáveis
Evolutionary strategies normally use the Gaussian distributions in order to control the mutations over real values. Since there are other kinds of distributions in nature and in mathematics, such as those of Cauchy, Lévy and S-Lévy, in addition to several stable distributions, it seems a natural step to extend the standard approach, by using an algorithm t
Publicado em: 2007
-
6. Implementação e analise de uma abordagem de busca orientada por restrições atraves de heuristicas baseadas na folga para plantas multiproposito operando em batelada / Implementation and analysis of a constrained based search approach by means of the slack time heuristic for multipurpose batch plants
The problem considered is short term scheduling of batch chemical plants. Constraints over plant capacity are taken as intermediate storage constraints since they are frequent in the process industries area. The proposed approach using time windows utilizes a constraint based search technique based on the competiton of operations and bottleneck identificatio
Publicado em: 2005
-
7. Heuristicas para sistemas APS utilizando janelas de processamento
This work constitutes the first part of the project developing schedules heuristics using tasks processing time windows. The objective of this work is to consider scheduling heuristics in APS environments using the tasks processing time windows for scheduling problems with important due dates. Initially some types of heuristics used in commercial Advanced Pl
Publicado em: 2003
-
8. Escalonamento com restrição de mão-de-obra : heuristicas combinatorias e limitantes inferiores
This dissertation studies the scheduling problem under labour constraints (SPLC) and presents some strategies to obtain lower and upper bounds for this NP-hard problem. Concerning the lower bounds, two integer programming formulations are presented and the lower bounds associated with their linear relaxations are discussed. A branch-and-bound algorithm is al
Publicado em: 1998