Hybrid Meta Heuristic
Mostrando 1-5 de 5 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. Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas
O presente trabalho visa propor uma meta-heurística híbrida para o Problema de Roteamento de Veículos com Frotas Heterogêneas (PRVFH), que é um problema de otimização combinatória NP-difícil, e que se caracteriza pelo uso de uma frota limitada composta por veículos distintos com capacidades distintas. O método híbrido desenvolvido utiliza-se de u
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 13/07/2011
-
3. Fuzzy logic and particle swarm optimization for reactive power and voltage control / Logica nebulosa e tecnica de otimização particle swarm aplicados ao controle de tensão e de potencia reativa
Due to the growing electrical power demand and the lag of transmission system infrastruc ture, the operation of transmission systems approaches to its limits and increases the complexity of the system operation. ln this context, in order to satisfy the more rigid operating conditions, managing voltage profile and power flow in a more effective way becomes ve
Publicado em: 2008
-
4. 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
-
5. 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