Um algoritmo branch-and-bound para o problema do caixeiro viajante suficientemente próximo
This research deals with the Close-Enough Traveling Salesman Problem, a variant of the Traveling Salesman Problem wich has several applicatios in logistics. In the Close-Enough Traveling Salesman Problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region co...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | Brasil |
| Institución: | Universidade Federal da Paraíba (UFPB) |
| Repositorio: | Biblioteca Digital de Teses e Dissertações da UFPB |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.ufpb.br:tede/5268 |
| Acceso en línea: | https://repositorio.ufpb.br/jspui/handle/tede/5268 |
| Access Level: | acceso abierto |
| Palabra clave: | Problema do caixeiro viajante suficientemente próximo Branch-and-bound Programação cônica de segunda ordem Logística Close-enough traveling salesman problem Second order cone programming Logistics ENGENHARIAS::ENGENHARIA DE PRODUCAO |
| Sumario: | This research deals with the Close-Enough Traveling Salesman Problem, a variant of the Traveling Salesman Problem wich has several applicatios in logistics. In the Close-Enough Traveling Salesman Problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on Branch-and-Bound and Second Order Cone Programming. The proposed algorithm was tested in 824 instances suggested in the literature. Optimal solutions are obtained for open problems with up to a thousand vertices. We consider both instances in the two- and three-dimensional space. |
|---|