O problema do caixeiro viajante alugador : um estudo algorítmico
The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour of visits can be decomposed into contiguous paths that may be performed in different rental cars. The aim is to determine the Hamiltonian cycle that...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| 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/17945 |
| Acceso en línea: | https://repositorio.ufrn.br/jspui/handle/123456789/17945 |
| Access Level: | acceso abierto |
| Palabra clave: | O Problema do caixeiro alugador Metaheurísticas GRASP/VND Colônia de formigas Computação evolucionária Algoritmo memético Transgenética computacional The car rental salesman problem Metaheuristics Ant colony Evolutionary computation Memetic algorithm Computational transgenic CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO |
| Sumario: | The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour of visits can be decomposed into contiguous paths that may be performed in different rental cars. The aim is to determine the Hamiltonian cycle that results in a final minimum cost, considering the cost of the route added to the cost of an expected penalty paid for each exchange of vehicles on the route. This penalty is due to the return of the car dropped to the base. This paper introduces the general problem and illustrates some examples, also featuring some of its associated variants. An overview of the complexity of this combinatorial problem is also outlined, to justify their classification in the NPhard class. A database of instances for the problem is presented, describing the methodology of its constitution. The presented problem is also the subject of a study based on experimental algorithmic implementation of six metaheuristic solutions, representing adaptations of the best of state-of-the-art heuristic programming. New neighborhoods, construction procedures, search operators, evolutionary agents, cooperation by multi-pheromone are created for this problem. Furtermore, computational experiments and comparative performance tests are conducted on a sample of 60 instances of the created database, aiming to offer a algorithm with an efficient solution for this problem. These results will illustrate the best performance reached by the transgenetic algorithm in all instances of the dataset |
|---|