Um Algoritmo Evolutivo Híbrido Para O Problema De Recobrimento De Rotas Com Coleta De Prêmios

Abstract

This paper proposes a hybrid evolutionary algorithm for getting an approximate solution for the Prize Collecting Covering Tour Problem (PCCTP). The proposed algorithm combines heuristic strategies based on Iterated Local Search, Variable Neighborhood Descent, Path Relinking and GENIUS procedures. Computational results on a set of instances illustrate the effectiveness and the robustness of the proposed heuristic. Keywords    Computational Intelligence, Metaheuristics, Evolutionary Algorithm. Resumo    Este artigo propõe um algoritmo evolutivo híbrido para obter soluções aproximadas para o Problema de Recobrimento de Rotas com Coleta de Prêmios (PRRCP). O algoritmo proposto combina estratégias heurísticas baseadas nos procedimentos Busca Local Iterada, Busca em Vizinhança Variável, Reconexão por Caminhos e GENIUS. Resultados computacionais para um conjunto de instâncias mostram a eficiência e a robustez da heurística proposta.

Reactive GRASP for the Prize-collecting Covering Tour Problem

“…As regards the MIP solver, Gurobi optimizer [21] was used disabling its preprocessing heuristics, cuts, and the parallel mode set to none. We remark that the original source code of the ILS-RDM-CI heuristic was kindly provided by its author Silva [30] and used in our computational experiments.…”

“…The first formulation, proposed by Lyra [19], uses flow variables to avoid the formation of disconnected cycles. The other formulation proposed by Silva [30], uses multiflow variables to avoid sub-cycles in the route.…”

“…Finally, constraints (11), ( 12) and ( 13) determine the domain of the variables y k , x ij and z ij . The formulation of Silva [30] is composed of the following variables.…”

“…The first one was proposed by Lyra [19] along with the problem and makes use of constraints based on flow to eliminate sub-routes in the solution. The second one was proposed by Silva [30], and it is based on multi-flow constraints to handle with sub-routes in the solution.…”

“…In the following, Silva [30] proposed new six heuristic methods, in which five of them are based on the ILS (Iterated Local Search) meta-heuristic [18], and one is an evolutionary heuristic. Silva [30] conducted experiments on test-problems proposed in his work and the ILS-RDM-CI was the one with the best overall performance.…”