Uma Heuristica aplicada ao problema do caixeiro viajante
The aim of this paper is to present a new method applied to solve the Travelling Salesman Problem (TSP). The method can also be used to solve Combinatorial Optimization Problems that involves permutation, it is a simple program of computer where the solution structure is based on permutation. This t...
| Authors: | , , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2005 |
| Country: | Brasil |
| Institution: | Universidade Federal do Ceará (UFC) |
| Repository: | Repositório Institucional da Universidade Federal do Ceará (UFC) |
| Language: | Portuguese |
| OAI Identifier: | oai:repositorio.ufc.br:riufc/13121 |
| Online Access: | http://www.repositorio.ufc.br/handle/riufc/13121 |
| Access Level: | Open access |
| Keyword: | Problema do caixeiro viajante Otimização combinatória Heurística |
| Summary: | The aim of this paper is to present a new method applied to solve the Travelling Salesman Problem (TSP). The method can also be used to solve Combinatorial Optimization Problems that involves permutation, it is a simple program of computer where the solution structure is based on permutation. This technique partitions the set of feasible solutions into small regions to diversify the local search. The technique was applied effectively to the TSP which is an NP-Complete problem and difficult to be solved in the practice. Extensive computational experiments are reported for instances with up to 443 cities and the results are compared with those obtained from the literature. |
|---|