Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem

Marcos R. Q. Andrade, Luiz S. Ochi and Simone L. Martins
Additional contact information
Marcos R. Q. Andrade: Departamento de Computação, Polo Universitário de Rio das Ostras, Rio de Janeiro, Brazil
Luiz S. Ochi: Instituto de Computação, Universidade Federal Fluminense, Rio de Janeiro, Brazil
Simone L. Martins: Instituto de Computação, Universidade Federal Fluminense, Rio de Janeiro, Brazil

International Journal of Natural Computing Research (IJNCR), 2015, vol. 5, issue 1, 1-25

Abstract: The Periodic Mobile Piston Pump Unit Routing Problem consists of, given a set of surface oil wells scattered over an onshore producing field, determining routes for each day of work, with limited duration work shift, that maximize the collection of oil carried by a mobile piston pump unit. This paper presents different construction and local search methods used in the composition of GRASP and ILS heuristics for the problem. Experimental results demonstrate the effectiveness of the proposed method.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijncr.2015010101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jncr00:v:5:y:2015:i:1:p:1-25

Access Statistics for this article

International Journal of Natural Computing Research (IJNCR) is currently edited by Xuewen Xia

More articles in International Journal of Natural Computing Research (IJNCR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().