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 prob...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2008 |
| País: | Brasil |
| Institución: | Universidade Federal do Rio Grande do Norte (UFRN) |
| Repositorio: | Repositório Institucional da UFRN |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.ufrn.br:123456789/14933 |
| Acceso en línea: | https://repositorio.ufrn.br/jspui/handle/123456789/14933 |
| Access Level: | acceso abierto |
| Palabra clave: | Enxame de Partículas Problema do Caixeiro Viajante Metaheurística Paralelismo Particle swarm Traveling salesman problem Metaheuristic Parallel CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO |
| Sumario: | 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 metaheuristic, and propose strategies for implementation of optimization discret problems as form of execution parallel as sequential. The computational experiments were performed to instances of the TSP, selected in the library TSPLIB contenct to 3038 nodes, showing the improvement of performance of parallel methods for their sequential versions, in executation time and results |
|---|