A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem

被引:102
|
作者
Gronhaug, Roar [1 ]
Christiansen, Marielle [1 ]
Desaulniers, Guy [2 ]
机构
[1] Norwegian Univ Sci & Technol, NO-7491 Trondheim, Norway
[2] Ecole Polytech, Gerad, Montreal, PQ H3T 1J4, Canada
关键词
branch-and-price; column generation; maritime transportation; COLUMN GENERATION; SHIP;
D O I
10.1287/trsc.1100.0317
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a maritime inventory routing problem in the liquefied natural gas (LNG) business, called the LNG inventory routing problem (LNG-IRP). Here, an actor is responsible for the routing of the fleet of special purpose ships, and the inventories both at the liquefaction plants and the regasification terminals. Compared to many other maritime inventory routing problems, the LNG-IRP includes some complicating aspects such as (1) a constant rate of the cargo evaporates each day and is used as fuel during transportation; (2) variable production and consumption of LNG, and (3) a variable number of tanks unloaded at the regasification terminals. The problem is solved by a branch-and-price method. In the column generation approach, the master problem handles the inventory management and the port capacity constraints, while the subproblems generate the ship route columns. Different accelerating strategies are implemented. The proposed method is tested on instances inspired from real-world problems faced by a major energy company.
引用
收藏
页码:400 / 415
页数:16
相关论文
共 50 条
  • [41] Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem
    Fernando Afonso Santos
    Alexandre Salles da Cunha
    Geraldo Robson Mateus
    [J]. Optimization Letters, 2013, 7 : 1537 - 1547
  • [42] k-Splittable Delay Constrained Routing Problem: A Branch-and-Price Approach
    Truffot, Jerome
    Duhamel, Christophe
    Mahey, Philippe
    [J]. NETWORKS, 2010, 55 (01) : 33 - 45
  • [43] The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
    Fukasawa, Ricardo
    Gunter, Joshua
    [J]. OPERATIONS RESEARCH LETTERS, 2023, 51 (01) : 11 - 16
  • [44] A branch-and-price algorithm for a routing and scheduling problem from economic and environmental perspectives
    Luo, Hongyuan
    Dridi, Mahjoub
    Grunder, Olivier
    [J]. RAIRO-OPERATIONS RESEARCH, 2022, 56 (05) : 3267 - 3292
  • [45] A Branch-and-Price Heuristic Algorithm for Vehicle Routing Problem with Soft Time Windows
    Li, Han
    Qian, Bin
    Yu, Nai-kang
    Hu, Rong
    Li, Zuo-cheng
    [J]. ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT I, ICIC 2024, 2024, 14862 : 443 - 453
  • [46] A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand
    Chagas, Jonatas B. C.
    Santos, Andre G.
    [J]. INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016), 2017, 557 : 921 - 934
  • [47] A branch-and-price approach for operational aircraft maintenance routing
    Sarac, Abdulkadir
    Batta, Rajan
    Rump, Christopher M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) : 1850 - 1869
  • [48] A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm
    Ahmadi-Javid, Amir
    Amiri, Elahe
    Meskar, Mahla
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (03) : 866 - 881
  • [49] A branch-and-price algorithm for the ring/ring problem
    Osorio, Cecilia Lescano
    Hoshino, Edna Ayako
    [J]. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 516 - 522
  • [50] A Branch-and-Price Algorithm for the Multiple Knapsack Problem
    Lalonde, Olivier
    Cote, Jean-Francois
    Gendron, Bernard
    [J]. INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 3134 - 3150