Abstract
In this paper we propose an Adaptive Memory Procedure to solve the Profitable Arc Tour Problem (PATP). The PATP is a variant of the well-known Vehicle Routing Problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. Computational experiments show that our algorithms provide good results in terms of quality of solution and running times.