Hybrid Heuristics
Mostrando 13-24 de 24 artigos, teses e dissertações.
-
13. Hybrid heuristic strategies for planning and scheduling forest harvest and transportation activities in short term / Estrategias hibridas para um problema de planejamento e escalonamento de atividades florestais em curto prazo
This thesis aimed at studying and solving a planning and scheduling problem stemming from forest harvest and wood transportation activities. Our approach treated a real problem faced by large pulp and paper companies in Brazil. It consists in planning, for a short-term horizon, the harvesting operations in different forest areas and the transportation of the
Publicado em: 2008
-
14. 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
-
15. Algoritmo de RWA com considerações de sobrevivência baseado em heurística-algoritmo genético para redes IP/WDM / RWA algorithm with surviability considerations in heuristics-genetic algorithm to IP/WDM networks
This thesis describes the creation, development and application of a novel hybrid Heuristic-GA algorithm, for the optimization of dynamic routing and wavelength assignment mechanisms with survivability (S-DRWA), guided to the reserve of capacity based on sharing routes protection and applied in IP transport network over WDM. In this joint operation, heuristi
Publicado em: 2007
-
16. Algoritmos genéticos híbridos sem delimitadores de rotas para problemas de roteirização de veículos. / Hybrid genetic algorithms without trip delimeters for vehicle routing problems.
In the Vehicle Routing Problem (VRP) we seek for a set of minimum-cost vehicle routes for a fleet of identical vehicles, each starting and ending at a depot, such that each customer is visited exactly once and the total demand of any route does not exceed the vehicle capacity. Several families of heuristics have been proposed for the VRP. They can be broadly
Publicado em: 2007
-
17. 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
-
18. 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
-
19. New heuristics to crew scheduling problem / Novas heurísticas para o problema de escalonamento de atripulações
The crew scheduling problem consists in attributing to the crews the job of driving vehicles, in such a way that trips of dierent lines assisted by a company are executed with the smallest possible cost. This process is of fundamental importance in planning the operations for the public transportation sector and belongs to a class of dicult problems. Several
Publicado em: 2005
-
20. HYBRID HEURISTICS FOR THE PHYLOGENY PROBLEM / HEURÍSTICAS HÍBRIDAS PARA O PROBLEMA DA FILOGENIA
A phylogeny is a tree that relates taxonomic units, based on their similarities over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. The main goal of this work is to develop hybrid heuristics for this problem. Two strategies are proposed. The first combines the GRASP metaheuristic usin
Publicado em: 2004
-
21. Algoritmos evolutivos hídridos com detecção de regiões promissoras em espaços de busca contínuos e discretos / Hybrid evolutionary algorithms with detection of promising areas in continuous discrete search spaces
This work presents three strategies for exploitation in hybrid evolutionary algorithms. These strategies are the base of three approaches: Population Training Heuristic (called TPH), Evolutionary Clustering Search (ECS) and the Parallel Adaptive Hierarchical Fair Competition Genetic Algorithm (called APHAC). The TPH employs problem-specific heuristics for fi
Publicado em: 2004
-
22. A HYBRID IMPROVEMENT HEURISTICS FOR THE BIN PACKING PROBLEM AND ITS APPLICATION TO THE PROBLEM OF TASK SCHEDULING / UMA HEURÍSTICA HÍBRIDA DE MELHORIA PARA O PROBLEMA DE BIN PACKING E SUA APLICAÇÃO AO PROBLEMA DE ESCALONAMENTO DE TAREFAS
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several components: lower and upper bounds; reductions, construction of initial solutions by reference to the dual problem;heuristics for load redistribution based on dominance, differencing, and unbalancing; and tabu search. We also investigate the applica
Publicado em: 2003
-
23. Um sistema de suporte ao controle de tensão e potencia reativa com processamento de conhecimento
ln the Power Transmission Systems operation, voltagej reactive power probIems can occur, any time due to contingencies andjor changes in demando However, appropriate contraI decisions are necessary in a short time, in order to improve the operating state and not to put the security and reliability of eIectric system at risk. Some of these situations can requ
Publicado em: 1993
-
24. RHO—Radiation Hybrid Ordering
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating the physical distances between them. With the advent of this mapping technique, analyzing the experimental data is becoming a challenging and demanding computational task. In this paper we present the software package RHO (radiation h
Cold Spring Harbor Laboratory Press.