An Aggregated Rank Removal Heuristic Based Adaptive Large Neighborhood Search for Work-over Rig Scheduling Problem

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Work-over Rig Scheduling Problem (WRSP) is a well known challenge in oil & gas industry. Given the limited number of work-over rigs to cater to the maintenance needs of a large number of wells, the challenge lies in planning an optimum schedule that minimizes the overall production loss. In this work, we propose a new Aggregated Rank Removal Heuristic (ARRH) applied to Adaptive Large Neighborhood Search to solve WRSP. The proposed approach results in more efficient searches as compared to existing heuristics - Genetic Algorithm, Variable Neighborhood Search and Adaptive Large Neighborhood Search.

Cite

CITATION STYLE

APA

Shaji, N., Sundar, C. S., Jagyasi, B., & Dutta, S. (2019). An Aggregated Rank Removal Heuristic Based Adaptive Large Neighborhood Search for Work-over Rig Scheduling Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11941 LNCS, pp. 385–394). Springer. https://doi.org/10.1007/978-3-030-34869-4_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free