A GRASP with Adaptive Memory for a Period Vehicle Routing Problem

Author

Gonçalves, Luciana B. ; Ochi, Luiz S. ; Martins, Simone L.

Author_Institution

Departamento de Ciencia da Computacao, Univ. Fed. Fluminense, Rio de Janeiro

Volume

1

fYear

2005

fDate

28-30 Nov. 2005

Firstpage

721

Lastpage

727

Abstract

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

Keywords

computational complexity; greedy algorithms; oil drilling; randomised algorithms; search problems; transportation; vehicles; adaptive memory; computational complexity; greedy randomized adaptive search procedure heuristics; onshore oil well; period vehicle routing problem; Costs; Finishing; Mathematical model; Mixed integer linear programming; Performance analysis; Petroleum; Production; Proposals; Routing; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on

Conference_Location

Vienna

Print_ISBN

0-7695-2504-0

Type

conf

DOI

10.1109/CIMCA.2005.1631349

Filename

1631349