Application of Minimum-Cost Flow Problem for Shuttle Tanker Transportation Planning

被引:1
|
作者
Shi, Yifan [1 ,2 ]
Hu, Hao [1 ,2 ]
Jiang, Fangrong [3 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Naval Architecture & Ocean & Civil Engn, Shanghai 200030, Peoples R China
[2] Shanghai Jiao Tong Univ, State Key Lab Ocean Engn, Shanghai 200030, Peoples R China
[3] Shanghai North Sea Shipping Co Ltd, Shanghai, Peoples R China
关键词
ROAD NETWORK; PATH;
D O I
10.3141/2477-05
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
With the increasing demand for crude oil, offshore oil exploration has become a prevailing industry. Shuttle tankers, the watercraft for offshore oil transportation, play a key role in ensuring the safety of the offshore oil supply. Transportation cost is a critical consideration for offshore oil companies. The shuttle tanker transportation problem is formulated here as a network flow model with the objective of improving the efficiency of transportation as well as reducing the cost for offshore oil companies. The proposed model is converted to the typical minimum-cost network flow problem and is solved by the classical minimum-cost path algorithm. A real-world example is presented to demonstrate the application of the model. Results show that the proposed model and the corresponding algorithm can provide guidance to minimize the transportation cost of shuttle tankers.
引用
收藏
页码:40 / 49
页数:10
相关论文
共 50 条
  • [21] Application of the minimum cost flow problem in container shipping
    Krile, S
    PROCEEDINGS ELMAR-2004: 46TH INTERNATIONAL SYMPOSIUM ELECTRONICS IN MARINE, 2004, : 466 - 471
  • [22] THE MINIMUM-COST DAIRY FEED (An Application of "Linear Programming")
    Waugh, Frederick V.
    JOURNAL OF FARM ECONOMICS, 1951, 33 (03): : 299 - 310
  • [23] A MINIMUM-COST NETWORK-FLOW SOLUTION TO THE CASE-V THURSTONE SCALING PROBLEM
    LATTIN, JM
    PSYCHOMETRIKA, 1990, 55 (02) : 353 - 370
  • [24] MINIMUM-COST SPANNING TREE AS A PATH-FINDING PROBLEM
    MAGGS, BM
    PLOTKIN, SA
    INFORMATION PROCESSING LETTERS, 1988, 26 (06) : 291 - 293
  • [25] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
    Chen, Li
    Kyng, Rasmus
    Liu, Yang P.
    Peng, Richard
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 612 - 623
  • [26] The minimum-cost, machine-part cell formation problem
    Boctor, FF
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (04) : 1045 - 1063
  • [27] A survey on exact algorithms for the maximum flow and minimum-cost flow problems
    Cruz-Mejia, Oliverio
    Letchford, Adam N.
    NETWORKS, 2023, 82 (02) : 167 - 176
  • [28] Formulation and Algorithms for Discrete Minimum-Cost Group Assembly Problem
    Peng, Fan
    Hwang, Taesung
    Ouyang, Yanfeng
    TRANSPORTATION RESEARCH RECORD, 2013, (2333) : 9 - 15
  • [29] A MODEL FOR THE MINIMUM-COST CONFIGURATION PROBLEM IN FLEXIBLE MANUFACTURING SYSTEMS
    TETZLAFF, UAW
    INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, 1995, 7 (02): : 127 - 146
  • [30] An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
    Goldberg, AV
    Oldham, JD
    Plotkin, S
    Stein, C
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 338 - 352