We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem differs from the well-known period vehicle routing problem in several aspects. One major difference between them, responsible for increasing the complexity of the problem, is that, in the proposed problem, the number of visits required by a customer during the period is not previously determined. We developed some pure GRASP heuristics and some other heuristics that include the use of memory in GRASP. Experimental results illustrate the effectiveness of GRASP with adaptive memory over pure GRASP heuristics.
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L.