Hybrid Metaheuristics
Mostrando 1-12 de 20 artigos, teses e dissertações.
-
1. A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM
ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP). Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using loc
Pesqui. Oper.. Publicado em: 2016-04
-
2. Clustering search
This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunction with other metaheuristics, managing the implementation of local search algorithms for optimization problems. Usually the local search is costly and should be used only in promising regions of the search space. The CS assists in the discovery of these regi
Pesqui. Oper.. Publicado em: 2013-04
-
3. ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias / Ensembles of classifiers based on SOM and Fuzzy ART networks with parameter tuning and feature selection through evolutionary metaheuristics.
O paradigma de classificaÃÃo baseada em comitÃs tem recebido considerÃvel atenÃÃo na literatura cientÃfica em anos recentes. Neste contexto, redes neurais supervisionadas tÃm sido a escolha mais comum para compor os classificadores base dos comitÃs. Esta dissertaÃÃo tem a intenÃÃo de projetar e avaliar comitÃs de classificadores obtidos atravÃ
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/11/2011
-
4. HIBRIDIZAÇÃO DE MÉTODOS EXATOS E HEURÍSTICOS PARA RESOLUÇÃO DE PROBLEMAS DE OTIMIZAÇÃO COMBINA / HYBRIDIZATION OF EXACT AND HEURISTIC METHODS TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM
A recente evolução dos computadores como também dos métodos exatos oriundos da programação matemática, muitos destes eficientemente implementados em otimizadores comerciais, propiciou o surgimento de novos algoritmos, denominados metaheurísticas híbridas, que têm sido aplicados para resolução de problemas combinatoriais. Este trabalho apresenta a
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 04/03/2011
-
5. Abordagens heurísticas para problemas de agrupamentos / Heuristics approaches for clustering problems
The clustering problems arose from the need to group data in order to understand an object or a phenomenon still unknown. Data clustering is based on similarity between objects of a data set, where the most similar objects are in the same group. This work proposes three new heuristics approaches to clustering problems: the \textit{Variable Neighborhood Searc
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 25/02/2011
-
6. Técnicas de aumento de eficiência para metaheurísticas aplicadas a otimização global contínua e discreta / Efficiency--enhancement techniques for metaheuristics applied and continuous global optimization
Several real-world problems from various fields of Science and Engineering can be modeled as global optimization problems. In general, complex and large-scale problems can not be solved eficiently by exact techniques. In this context, Probabilistic algorithms, such as metaheuristics, have shown relevant results. Nevertheless, as the complexity of the problem
Publicado em: 2009
-
7. Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória
- This thesis presents a hybrid method, denominated Clustering Search (CS), that consists of detecting dynamically promising regions in the search space based on the frequence that are sampled in these regions the solutions originated from the metaheuristic. A iterative clustering process is executed in ensembling the metaheuristic, grouping the similar solu
Publicado em: 2009
-
8. Um novo método híbrido aplicado à solução de sistemas não-lineares com raízes múltiplas / A new hybrid method applied to the solution of nonlinear systems with multiple roots
This paper aims to present solutions for nonlinear systems with multiple roots, using a hybrid algorithm. For this purpose was developed and implemented an algorithm based on random search method proposed by Luus and Jaakola (1973) as a step in search of random starting points, which will be refined through the algorithm of Hooke and Jeeves. The differential
Publicado em: 2009
-
9. AST Um modelo para automaÃÃo de horÃrios escolares
The work here presented is about a model for automation of school timetable. It is tailored to deal with most of the restrictions found in the Brazilian schools. It also studies the relation between the constraints of the problem and its theoretical complexity. The school timetable problem is NP-complete even in the simplest cases, where the constraints are
Publicado em: 2008
-
10. Utilização de algoritmos genéticos híbridos e Web 2.0 no desenvolvimento de sistemas de roteirização de veículos
The use of a computer system for vehicle routing is essential for the competitiveness of companies working with distribution of resources and products. Despite high cost, such a system ofiers a guaranteed return on investment made. Using a Metaheuristics techniques combined with the resources currently ofiered by web, free development tools can be developed
Publicado em: 2008
-
11. Método de geração de colunas e meta-heurísticas para alocação de tripulação
In a typical crew scheduling problem, for each crew member is assigned a set of trips (a duty) to be performed. The objective is to select the duties such as the total operational cost is minimized, and no trip is left uncovered. Although there are some constraints about how the trips may be combined in a feasible duty, the total number of feasible duties is
Publicado em: 2008
-
12. Procedimentos híbridos na exploração do espaço de soluções de problemas de natureza combinatória uma aplicação ao planejamento florestal / Hybrid procedures in the exploration of the space of solutions of combinatorial problems an application to the forest planning
The present work had as intention to examine the applicability of hybridization of techniques of Constraint Programming and Metaheurístics in the exploration of spaces of solutions of combinatorial problems. For this, was done a research about the trends and applications of hybrid procedures in the literature. Based in this research, strategies of hybridiza
Publicado em: 2007