Optimal policies for maintaining a supply service in the Norwegian Sea
Kjetil Fagerholt and
Håkon Lindstad
Omega, 2000, vol. 28, issue 3, 269-275
Abstract:
This paper considers the real problem of determining an efficient policy for a supply operation in the Norwegian Sea, where a number of offshore installations are serviced from an onshore depot by supply vessels. The purpose of the study was to evaluate the effect on the total supply cost of having some or all of the offshore installations closed for service during night, and to determine an optimal routing policy. Six scenarios were developed, varying in the opening hours and the number of weekly services of the installations, as well as an algorithm to find an optimal routing policy (which vessels to operate and the coherent weekly schedules) for each of the scenarios. By also evaluating the qualitative aspects of the solution of each scenario, a routing policy was recommended, involving potential savings of 7 million dollars. The proposed policy has been implemented and the experience so far is good.
Keywords: Scheduling; Transport; Application; Ships; Supply (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (33)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(99)00054-7
Full text for ScienceDirect subscribers only
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:eee:jomega:v:28:y:2000:i:3:p:269-275
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Omega is currently edited by B. Lev
More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().