Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design

M. T. Fiala Timlin and W. R. Pulleyblank
Additional contact information
M. T. Fiala Timlin: Gandalf Mobile Systems, Inc., 2 Gurdwara Road, Suite 500, Nepean, Ontario, K2E 1A2, Canada
W. R. Pulleyblank: Thomas J. Watson Research Centre, IBM, PO Box 218, Yorktown Heights, New York 10598, USA

Interfaces, 1992, vol. 22, issue 3, 100-111

Abstract: Mobil Producing Nigeria has an offshore oil field consisting of approximately 45 platforms. Each day certain platforms must be visited to regulate flow rates and a number of people must be transported between specified pairs of platforms. All transport is performed by helicopter. Mobil wanted to find a route for each daily set of stops that satisfied all the requirements and minimized the total distance flown. We developed two heuristics that produce very good solutions to this problem. The first ignores the problem of helicopter capacity, and the second handles it explicitly. Mobil has cited two benefits of the optimization software: all routing requirements are satisfied, and a significant reduction of total daily flying time has been achieved.

Keywords: transportation: route selection; industries: petroleum/natural gas (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.22.3.100 (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:inm:orinte:v:22:y:1992:i:3:p:100-111

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().