O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico
This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices, each associated with a bonus, and a set of vehicles are given. The objective is to determine a cycle that visits some vertices collecting,...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| 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/18693 |
| Acceso en línea: | https://repositorio.ufrn.br/jspui/handle/123456789/18693 |
| Access Level: | acceso abierto |
| Palabra clave: | Caixeiro alugador com coleta de prêmios. Metaheurísticas. GRASP/VNS. Algoritmo memético. Transgenética computacional. Computação evolucionária The Prize Collecting Traveling Car Renter Problem. Metaheuristics. GRASP/VNS. Memetic Algorithm. Computational Transgenetic. Evolutionary Computation CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO |
| Sumario: | This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices, each associated with a bonus, and a set of vehicles are given. The objective is to determine a cycle that visits some vertices collecting, at least, a pre-defined bonus, and minimizing the cost of the tour that can be traveled with different vehicles. A mathematical formulation is presented and implemented in a solver to produce results for sixty-two instances. The proposed problem is also subject of an experimental study based on the algorithmic application of four metaheuristics representing the best adaptations of the state of the art of the heuristic programming.We also provide new local search operators which exploit the neighborhoods of the problem, construction procedures and adjustments, created specifically for the addressed problem. Comparative computational experiments and performance tests are performed on a sample of 80 instances, aiming to offer a competitive algorithm to the problem. We conclude that memetic algorithms, computational transgenetic and a hybrid evolutive algorithm are competitive in tests performed |
|---|