A comparison of three metaheuristics for the workover rig routing problem

Glaydston Mattos Ribeiro, Gilbert Laporte, Geraldo Regis Mauri

Research output: Contribution to journalArticlepeer-review

37 Citations (SciVal)

Abstract

The workover rig routing problem (WRRP) is a variant of the Vehicle Routing Problem with Time Windows (VRPTW) and arises in the operations of onshore oil fields. In this problem, a set of workover rigs located at different positions must service oil wells requesting maintenance as soon as possible. When a well requires maintenance, its production is reduced or stopped for safety reasons and some workover rig must service it within a given deadline. It is therefore important to service the wells in a timely fashion in order to minimize the production loss. Whereas for classical VRPTWs the objective is to minimize route length, in the WRRP the objective is to minimize the total lost production, equal to the sum of arrival times at the wells, multiplied by production loss rates. The WRRP generalizes the Delivery Man Problem with Time Windows by considering multiple open vehicle routes and multiple depots. This paper compares three metaheuristics for the WRRP: an iterated local search, a clustering search, and an Adaptive Large Neighborhood Search (ALNS). All approaches, in particular ALNS, have yielded good solutions for instances derived from a real-life setting.

Original languageEnglish
Pages (from-to)28-36
Number of pages9
JournalEuropean Journal of Operational Research
Volume220
Issue number1
DOIs
Publication statusPublished - 1 Jul 2012

Funding

Glaydston Mattos Ribeiro and Geraldo Regis Mauri acknowledge Espírito Santo Research Foundation (Process 45391998/09) and National Council for Scientific and Technological Development (Processes 201509/2009-1, 300747/2010-1 and 477148/2011-5) for their financial support. Gilbert Laporte acknowledges the Canadian Natural Sciences and Engineering Research Council (Grant 39682-05 ). The authors thank Tiago Araújo Neves from Fluminense Federal University for kindly providing the data sets and ILS code used in this paper and for answering questions regarding the data sets and the problem. Thanks are due to the referees for their valuable comments.

Keywords

  • Adaptive large neighborhood search
  • Clustering search
  • Iterated local search
  • Metaheuristics
  • Workover rig routing problem

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'A comparison of three metaheuristics for the workover rig routing problem'. Together they form a unique fingerprint.

Cite this