Welcome to the InfoSci Platform
Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem

Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem

Marcos R. Q. Andrade, Luiz S. Ochi, Simone L. Martins
Copyright: © 2015 |Volume: 5 |Issue: 1 |Pages: 25
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466678231|DOI: 10.4018/ijncr.2015010101
Cite Article Cite Article

MLA

Andrade, Marcos R. Q., et al. "Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem." IJNCR vol.5, no.1 2015: pp.1-25. http://doi.org/10.4018/ijncr.2015010101

APA

Andrade, M. R., Ochi, L. S., & Martins, S. L. (2015). Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem. International Journal of Natural Computing Research (IJNCR), 5(1), 1-25. http://doi.org/10.4018/ijncr.2015010101

Chicago

Andrade, Marcos R. Q., Luiz S. Ochi, and Simone L. Martins. "Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem," International Journal of Natural Computing Research (IJNCR) 5, no.1: 1-25. http://doi.org/10.4018/ijncr.2015010101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.