Comparative experiments with GRASP and constraint programming for the oil well drilling problem

Authors:
Romulo A. Pereira;Arnaldo V. Moura;Cid C. de Souza
Affiliations:
Institute of Computing, University of Campinas;Institute of Computing, University of Campinas;Institute of Computing, University of Campinas
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 4
Cited 1

Flight scheduling and maintenance base planning

Management Science
Operations sequencing in discrete parts manufacturing

Management Science
Tabu Search

Tabu Search
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization

The offshore resources scheduling problem: detailing a constraint programming approach

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Before promising locations become productive oil wells, it is often necessary to complete drilling activities at these locations. The scheduling of such activities must satisfy several conflicting constraints and attain a number of goals. Here, we describe a Greedy Randomized Adaptive Search Procedure (GRASP) for the scheduling of oil well drilling activities. The results are compared with those from a well accepted constraint programming implementation. Computational experience on real instances indicates that the GRASP implementation is competitive, outperforming the constraint programming implementation.