Traveling Salesman
Mostrando 13-24 de 40 artigos, teses e dissertações.
-
13. 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
-
14. ABORDAGEM BASEADA NA HEURÍSTICA DE COLÔNIA DE FORMIGAS PARA ELABORAÇÃO DE ROTAS NA FASE DE COLETA DE AMOSTRAS DE COMBUSTÍVEIS / HEURISTIC APPROACH FOR COLONY ANTS FOR DEVELOPMENT OF ROUTES IN THE PHASE COLLECTION SAMPLE FUEL
A comercialização de derivados de petróleo, gás natural e biocombustível é uma atividade que necessita, constantemente, de fiscalização e monitoramento. A ANP (Agência Nacional do Petróleo, Gás Natural e Biocombustível) é responsável em garantir a qualidade dos produtos gerados pela indústria do petróleo. No entanto, para atuar com eficiênci
Publicado em: 2009
-
15. Rede neural recorrente com perturbação simultânea aplicada no problema do caixeiro viajante / Recurrent neural network with simultaneous perturbation applied to traveling salesman problem
This work proposes to solve the classic combinatorial optimization problem known as traveling salesman problem. A recurrent neural network was used in the system of optimization to search the shorter path. The structural topology linking the feedbacks of the network adopted here is known by Wang recurrent network. As learning rule to find the appropriate val
Publicado em: 2008
-
16. Algoritmos Evolucionários Aplicados ao Problema do Caixeiro Viajante Multiobjetivo.
Este trabalho apresenta uma visão geral sobre os principais conceitos da otimização combinatória multiobjetivo, onde apresentamos as técnicas mais utilizadas para a resolução de problemas desta natureza. Ao falarmos das técnicas, discutiremos também aspectos importantes quanto aos parâmetros envolvidos em cada técnica, mostrando as principais abor
Publicado em: 2008
-
17. Estratégias de aplicações sequenciais e paralelas da metaheurística otimização por enxame de partículas ao problema do caixeiro viajante
Particle Swarm Optimization is a metaheuristic that arose in order to simulate the behavior of a number of birds in flight, with its random movement locally, but globally determined. This technique has been widely used to address non-liner continuous problems and yet little explored in discrete problems. This paper presents the operation of this metaheuristi
Publicado em: 2008
-
18. Comparison of algorithms used in the construction of genetic linkage maps / Comparação de algoritmos usados na construção de mapas genéticos
Genetic linkage maps are linear arrangements showing the order and distance between loci in chromosomes of a particular species. Recently, the availability of molecular markers has made such maps more saturated and efficient methods are needed for their construction. One of the steps that deserves more attention in the construction of genetic linkage maps is
Publicado em: 2008
-
19. Nuvem de partículas aplicada à seleção de atributos
Abstract: The particle swarm optimization (PSO) algorithm is a recently developed metaheuristic technique and belongs to the category of swarm intelligence techniques. The swarm intelligence concepts are inspired by the social behavior of flocking animals such as swarms of birds, ants and fish school. PSO is a population based algorithm that exploits a popul
Publicado em: 2008
-
20. Aplications of genetic and fuzzy metaheusistic in the ant colony system for the traveling salesman problem / Aplicações de meta-heuristica genetica e fuzzy no sistema de colonia de formigas para o problema do caixeiro viajante
Amongst the several existing heuristical and accurate techniques for the resolution of combinatorial problems, the population algorithms ant colony optimization and genetic have been detached due to their good performance. In special the ant colony algorithms are considered currently as one of the techniques most succeeded for the resolution of some combinat
Publicado em: 2007
-
21. Algoritmo treansgenético na solução do problema do Caixeiro Viajante
The Traveling Purchaser Problem is a variant of the Traveling Salesman Problem, where there is a set of markets and a set of products. Each product is available on a subset of markets and its unit cost depends on the market where it is available. The objective is to buy all the products, departing and returning to a domicile, at the least possible cost defin
Publicado em: 2007
-
22. 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
-
23. ALGORITMO EVOLUTIVO PARA O PROBLEMA DO CAIXEIRO VIAJANTE COM DEMANDAS HETEROGÊNEAS / ALGORITHM EVOLUTIONARY FOR THE TRAVELLING SALESMAN PROBLEM WITH HETEROGENEOUS DEMANDS
The work proposed in this dissertation is the field of combinatorial optimization, which aims to find a solution to these types of problems at a low computational time and effectively. The combinatorial optimization studies a set of discrete solutions, which have a finite number of elements, to find the best viable solution to the problems of this magnitude.
Publicado em: 2006
-
24. A Particle Swarm Approach for Combinatorial Optimization Problems / Uma abordagem por nuvem de partículas para problemas de otimização combinatória
Combinatorial optimization problems have the goal of maximize or minimize functions defined over a finite domain. Metaheuristics are methods designed to find good solutions in this finite domain, sometimes the optimum solution, using a subordinated heuristic, which is modeled for each particular problem. This work presents algorithms based on particle swarm
Publicado em: 2006