Meta Heuristic Search Algorithms
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. 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
-
2. Genetic programming: crossover operators, building blocks and semantic emergence / Programação genética: operadores de crossover, blocos construtivos e emergência semântica
Evolutionary algorithms are heuristic methods used to find solutions to optimization problems. These methods use stochastic search mechanisms inspired by Natural Selection Theory. Genetic Algorithms and Genetic Programming are two of the most popular evolutionary algorithms. These techniques make intensive use of crossover operators, a mechanism responsible
Publicado em: 2010
-
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. HEURÍSTICAS PARA O PROBLEMA DAS P-MEDIANAS CONECTADAS / HEURISTICS FOR THE CONNECTED P-MEDIAN PROBLEM
In this work, the connected p-median and the connected facility location problems are defined. Applications arise in regional planning, design of telecommunications and transportation networks. For the first problem, two integer linear programming formulations are proposed. Adaptations are made in one of these formulations and are used to model the second pr
Publicado em: 2006
-
5. MODELS AND ALGORITHMS FOR THE DIAMETER CONSTRAINED MINIMUM SPANNING TREE PROBLEM / MODELOS E ALGORITMOS PARA O PROBLEMA DA ÁRVORE GERADORA DE CUSTO MÍNIMO COM RESTRIÇÃO DE DIÂMETRO
In this work, models and approximation algorithms to solve the Diameter Constrained Minimum Spanning Tree Problem (AGMD) are proposed. This problem typically models network design applications where all vertices must communicate with each other at a minimum cost, while meeting a given quality requirement. The formulations proposed by Achuthan and Caccetta ar
Publicado em: 2006
-
6. UMA ABORDAGEM MULTI-CRITÉRIOS PARA PROBLEMAS DE CÉLULAS EM TECNOLOGIA DE GRUPO / A MULTI-CRITERIA PROPOSE FOR CELL PROBLEM IN TECNOLOGY GROUP
Group tecnology techniques are now widely used in many manufacturing systems. Severla algorithms have been proposed for the optimal design of efficient manufacturing cells. The cell formation problem must take into account several objectives: the number of bottleneck operations, the number of bottleneck machines and/or parts, the intercell flow, the intracel
Publicado em: 1993