Heuristic Algorithm
Mostrando 13-24 de 105 artigos, teses e dissertações.
-
13. PROJECT SCHEDULING OPTIMIZATION IN ELECTRICAL POWER UTILITIES
The problem of choosing from a set of projects which ones should be executed and whenthey should start, depending on several restrictions involving project costs, risks, limited resources, dependencies among projects, and aiming at different, even conflicting, goals is known as the project portfolio selection (PPS) problem. We study a particular version of t
Pesqui. Oper.. Publicado em: 2015-08
-
14. AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS
Random key genetic algorithms are heuristic methods for solving combinatorial optimization problems. They represent solutions as vectors of randomly generated real numbers, the so-called random keys. A deterministic algorithm, called a decoder, takes as input a vector of random keys and associates with it a feasible solution of the combinatorial optimization
Pesqui. Oper.. Publicado em: 2014-08
-
15. A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS
This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving
Pesqui. Oper.. Publicado em: 2014-08
-
16. Hybrid GRASP heuristics for the phylogeny problem combining path-relinking and genetic algorithm as an intensification strategy
A phylogeny is a tree that relates taxonomic units based on their similarity over a set of characteristics. The phylogeny problem under the parsimony criterion consists in finding a phylogeny with a minimum number of evolutionary steps. We propose hybrid heuristic methods - based on GRASP, path-relinking and genetic algorithm methodologies - to build a phylo
Prod.. Publicado em: 23/08/2013
-
17. Design of four-wave mixing frequency-shift-free amplitude regenerators
Frequency-shift-free all-optical amplitude regenerators based on fiber-four-wave mixing were investigated by means of simulations. These regenerators, comprised of two stages of highly nonlinear dispersion-shifted fiber, were designed using a heuristic procedure that implements a routine based on a genetic algorithm to optimize the device performance. A bit
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2013-06
-
18. An ant colony algorithm applied to lay-up optimization of laminated composite plates
Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior of real ants, related to their ability to find the shortest path between the nest and the food source. ACO has been applied successfully to different kinds of problems. So, this manuscript describes the development a
Lat. Am. j. solids struct.. Publicado em: 2013-05
-
19. An improved version of Inverse Distance Weighting metamodel assisted Harmony Search algorithm for truss design optimization
This paper focuses on a metamodel-based design optimization algorithm. The intention is to improve its computational cost and convergence rate. Metamodel-based optimization method introduced here, provides the necessary means to reduce the computational cost and convergence rate of the optimization through a surrogate. This algorithm is a combination of a hi
Lat. Am. j. solids struct.. Publicado em: 2013-03
-
20. Maximization of Fundamental Frequency of Laminated Composite Cylindrical Shells by Ant Colony Algorithm
ABSTRACT: The success in developing modern aerospace systems addresses competitive subjects as optimization, reduced costs, sustainability, environment, weight, and safety. There is an increased demand for lighter materials such as laminated composites. In order to match the demand of aeronautical companies, the shell structures are very important. The dynam
J. Aerosp. Technol. Manag.. Publicado em: 2013-03
-
21. Algoritmos para o custo médio a longo prazo de sistemas com saltos markovianos parcialmente observados / Algorithms for the long run average cost for linear systems with partially observed Markov jump parameters
In this work we are interested in the optimal control for the long run average cost (LRAC) problem for linear systems with Markov jump parameters (LSMJP), using heuristic methods like first generation evolutionary algorithms - genetic algorithm (GA) - and second generation algorithms including UMDA (Univariate Marginal Distribution Algorithm) and BOA (Bayesi
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 13/08/2012
-
22. Desenvolvimento e avaliação de algoritmos para composição dinâmica de web services baseada em QoS / Development and evaluation of algoritms for the QoS-aware web services composition problem
This MSc dissertation addresses the QoS-aware Web services composition (QWSC) problem. The field of e-commerce systems was selected because it comprises an area in wide expansion, both in national and international scenarios. Furthermore, e-commerce systems can benefit from QWSC due to its interoperability and compliance to the requirements of quality of ser
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 05/06/2012
-
23. Metaheurística para o Problema de Planejamento de Redes de Transmissão de Energia Elétrica com Redimensionamento / Metaheuristics for the transmission expansion planning problem with redesign
At times, the electrical load in dierent areas varies, claiming the construction of new electric generators and the expansion of the electrical transmission network. In this dissertation we focus on the transmission expansion planning problem, assuming that new generators are built to meet the new demands. This expansion requires large investments, which nee
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/03/2012
-
24. Codificação de vídeo baseada em fractais e representações esparsas / Video coding based on fractals and sparse representations
A video is a sequence of still images representing scenes in motion. A video is a sequence of extremely similar images separated by abrupt changes in their content. If these images were transmitted and stored without any kind of preprocessing, this would require a massive amount of storage space and communication channels with very high bandwidths. Lossy com
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 12/03/2012