Transgenetic algorithm for the periodic mobile piston pump unit routing problem with continuous oil replenishment

This paper reports the application of a transgenetic algorithm to the periodic mobile piston pump unit routing problem with continuous oil replenishment, a complex problem that occurs in the exploitation of onshore oil fields. The transgenetic algorithms are inspired on the endosymbiosis and on mechanisms of genetic exchange that exist in the intracellular flow. A computational experiment is reported to validate the performance of the proposed approach. In view of the difficulty in obtaining exact solutions to the problem, an upper limit is proposed. Aiming to bring the cases tackled in the computational experiment to operating conditions of onshore fields, a set of instances is built under realistic conditions of work.

[1]  Marco César Goldbarg,et al.  Transgenetic algorithm for the Traveling Purchaser Problem , 2009, Eur. J. Oper. Res..

[2]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[3]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[4]  Marco César Goldbarg,et al.  A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem , 2007, Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007).

[5]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[6]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[7]  Carolina P. de Almeida,et al.  TA-PFP: A Transgenetic Algorithm to Solve the Protein Folding Problem , 2007, Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007).

[8]  Francisco Dantas,et al.  Piston Pump Mobile Unity Tour Problem: An Evolutionary View , 2002, GECCO Late Breaking Papers.

[9]  Lynn Margulis,et al.  Serial Endosymbiotic Theory (SET) and Composite Individuality , 2004 .

[10]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[11]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[12]  S. Morito,et al.  AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM , 1988 .

[13]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[14]  Marco César Goldbarg,et al.  Transgenética computacional: uma aplicação ao problema quadrático de alocação , 2002 .