2000
DOI: 10.1016/s0305-0483(99)00054-7
|View full text |Cite
|
Sign up to set email alerts
|

Optimal policies for maintaining a supply service in the Norwegian Sea

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0
4

Year Published

2002
2002
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 87 publications
(46 citation statements)
references
References 10 publications
0
42
0
4
Order By: Relevance
“…Literature on the PVRP where one single route may last more than one day is scarce. Two relevant papers are [10] and [11], where there are also multiple use of vehicles.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Literature on the PVRP where one single route may last more than one day is scarce. Two relevant papers are [10] and [11], where there are also multiple use of vehicles.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (8) set the value of the voyage duration variables d vt to the sum of all service, sailing and waiting times rounded up to nearest whole time period (day). Constraints (9) limit the duration of voyages to be within a minimum and maximum number of days, and ensure that d vt is 0 if OSV v does not start on a voyage on day t. Constraints (10) limit the number of installation visits on a voyage to be within a minimum and maximum, constraints (11) are the OSVs' capacity constraints, and constraints (12) are the supply depot capacity constraints limiting the number of OSVs that may be prepared for a voyage starting on day t. The non-negativity requirements for the waiting variables are set by constraints (13), and constraints (14)- (16) set the binary requirements for variables δ v , y vijt and z vit , respectively.…”
Section: T C Vmentioning
confidence: 99%
See 1 more Smart Citation
“…In phase two the single routes generated in phase one are combined into multiple routes, and in phase three a set partitioning problem is solved. The method cannot handle ships with different speed, and thus Fagerholt and Lindstad [58] proposed a new solution algorithm considering this aspect. The algorithm was tested on a real-life problem for offshore supply ships in the Norwegian Sea and considerable savings were identified compared to the solution used at that time.…”
Section: 11mentioning
confidence: 99%
“…Additional vehicle scheduling problems with locational aspects have been studied more recently [16][17][18], and the sensitivity of operating in a nuclear environment can be seen in [19][20][21]. In addition, problems for geographically dispersed services [22,23] and for developing facility networks across large areas [24][25][26][27] are the focus of recent research. However, instances of scheduling for field service maintenance technicians over large geographic areas have only rarely been studied [28,29], and no known research uses location methods such as the MCLP for scheduling maintenance technicians over large geographic areas.…”
Section: Location Modelingmentioning
confidence: 99%