A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

Abstract

I present a heuristic based in tabu search, in order to generate feasible solutions for solving the Prize-collecting Rural Postman Problem. This problem was recently defined and is a generalization of other arc routing problems. The numerical results from a series of computational experiments with various types of instances show the good behavior of the proposed algorithm in comparison with previous works.