IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v49y2015i2p384-401.html
   My bibliography  Save this article

A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem

Author

Listed:
  • Jørgen Glomvik Rakke

    (Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, 7491 Trondheim, Norway)

  • Henrik Andersson

    (Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, 7491 Trondheim, Norway)

  • Marielle Christiansen

    (Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, 7491 Trondheim, Norway)

  • Guy Desaulniers

    (Department of Mathematics and Industrial Engineering, École Polytechnique and GERAD, Montréal, Québec H3C 3A7, Canada)

Abstract

In this paper we address a maritime inventory routing problem encountered by one of the world’s largest producers of liquefied natural gas (LNG). The producer is responsible for the LNG inventories at the liquefaction plant, the loading port with a limited number of berths, and the routing and scheduling of a heterogeneous fleet of LNG ships. In addition, the producer has to fulfill a set of long-term contracts to customers all around the world. The producer’s goal is to create a minimum-cost long-term delivery program that respects the long-term contracts while maximizing revenue from selling LNG in the spot market. We introduce a new formulation for this problem arising from a novel decomposition scheme based on delivery patterns. To solve this formulation, we develop an exact branch-price-and-cut algorithm. Computational results show that this new formulation provides much tighter lower bounds than the only known mixed integer programming (MIP) formulation for this problem. Furthermore, on a set of 27 benchmark instances, the proposed branch-price-and-cut method clearly outperforms a commercial MIP solver applied to the existing MIP model.

Suggested Citation

  • Jørgen Glomvik Rakke & Henrik Andersson & Marielle Christiansen & Guy Desaulniers, 2015. "A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem," Transportation Science, INFORMS, vol. 49(2), pages 384-401, May.
    • Handle: RePEc:inm:ortrsc:v:49:y:2015:i:2:p:384-401
    DOI: 10.1287/trsc.2013.0503
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2013.0503
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2013.0503?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Marielle Christiansen & Bjorn Nygreen, 1998. "A method for solving ship routing problemswith inventory constraints," Annals of Operations Research, Springer, vol. 81(0), pages 357-378, June.
    2. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    3. Elin Halvorsen-Weare & Kjetil Fagerholt, 2013. "Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints," Annals of Operations Research, Springer, vol. 203(1), pages 167-186, March.
    4. Moshe Dror & Michael Ball, 1987. "Inventory/routing: Reduction from an annual to a short‐period problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 891-905, December.
    5. Marielle Christiansen, 1999. "Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem," Transportation Science, INFORMS, vol. 33(1), pages 3-16, February.
    6. Al-Khayyal, Faiz & Hwang, Seung-June, 2007. "Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model," European Journal of Operational Research, Elsevier, vol. 176(1), pages 106-130, January.
    7. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    8. Roar Grønhaug & Marielle Christiansen, 2009. "Supply Chain Optimization for the Liquefied Natural Gas Business," Lecture Notes in Economics and Mathematical Systems, in: Jo A.E.E. Nunen & M. Grazia Speranza & Luca Bertazzi (ed.), Innovations in Distribution Logistics, chapter 10, pages 195-218, Springer.
    9. Marielle Christiansen & Bjørn Nygreen, 1998. "Modelling path flows for a combined ship routingand inventory management problem," Annals of Operations Research, Springer, vol. 82(0), pages 391-413, August.
    10. Roar Grønhaug & Marielle Christiansen & Guy Desaulniers & Jacques Desrosiers, 2010. "A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem," Transportation Science, INFORMS, vol. 44(3), pages 400-415, August.
    11. D Ronen, 2002. "Marine inventory routing: shipments planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(1), pages 108-114, January.
    12. Faramroze G. Engineer & Kevin C. Furman & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing," Operations Research, INFORMS, vol. 60(1), pages 106-122, February.
    13. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    14. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Henrik Andersson & Marielle Christiansen & Guy Desaulniers, 2016. "A new decomposition algorithm for a liquefied natural gas inventory routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 564-578, January.
    2. Di Wu & Xuejun Ji & Fang Xiao & Shijie Sheng, 2022. "A Location Inventory Routing Optimisation Model and Algorithm for a Remote Island Shipping Network considering Emergency Inventory," Sustainability, MDPI, vol. 14(10), pages 1-22, May.
    3. Koza, David Franz & Ropke, Stefan & Boleda Molas, Anna, 2017. "The liquefied natural gas infrastructure and tanker fleet sizing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 99(C), pages 96-114.
    4. Ghiami, Yousef & Demir, Emrah & Van Woensel, Tom & Christiansen, Marielle & Laporte, Gilbert, 2019. "A deteriorating inventory routing problem for an inland liquefied natural gas distribution network," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 45-67.
    5. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2023. "A branch-and-price heuristic algorithm for the bunkering operation problem of a liquefied natural gas bunkering station in the inland waterways," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 145-170.
    6. Dimitri J. Papageorgiou & Myun-Seok Cheon & George Nemhauser & Joel Sokol, 2015. "Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems," Transportation Science, INFORMS, vol. 49(4), pages 870-885, November.
    7. Yazdani, Majid & Aouam, Tarik, 2023. "Shipment planning and safety stock placement in maritime supply chains with stochastic demand and transportation times," International Journal of Production Economics, Elsevier, vol. 263(C).
    8. Agostinho Agra & Marielle Christiansen & Lars Magnus Hvattum & Filipe Rodrigues, 2018. "Robust Optimization for a Maritime Inventory Routing Problem," Transportation Science, INFORMS, vol. 52(3), pages 509-525, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    2. Faramroze G. Engineer & Kevin C. Furman & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing," Operations Research, INFORMS, vol. 60(1), pages 106-122, February.
    3. Mutlu, Fatih & Msakni, Mohamed K. & Yildiz, Hakan & Sönmez, Erkut & Pokharel, Shaligram, 2016. "A comprehensive annual delivery program for upstream liquefied natural gas supply chain," European Journal of Operational Research, Elsevier, vol. 250(1), pages 120-130.
    4. Agostinho Agra & Marielle Christiansen & Alexandrino Delgado, 2013. "Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem," Transportation Science, INFORMS, vol. 47(1), pages 108-124, February.
    5. Roar Grønhaug & Marielle Christiansen & Guy Desaulniers & Jacques Desrosiers, 2010. "A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem," Transportation Science, INFORMS, vol. 44(3), pages 400-415, August.
    6. Agra, Agostinho & Christiansen, Marielle & Delgado, Alexandrino & Simonetti, Luidi, 2014. "Hybrid heuristics for a short sea inventory routing problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 924-935.
    7. Papageorgiou, Dimitri J. & Nemhauser, George L. & Sokol, Joel & Cheon, Myun-Seok & Keha, Ahmet B., 2014. "MIRPLib – A library of maritime inventory routing problem instances: Survey, core model, and benchmark results," European Journal of Operational Research, Elsevier, vol. 235(2), pages 350-366.
    8. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    9. Gustavo Diz & Luiz Felipe Scavarda & Roger Rocha & Silvio Hamacher, 2014. "Decision Support System for PETROBRAS Ship Scheduling," Interfaces, INFORMS, vol. 44(6), pages 555-566, December.
    10. Xu, Dongyang & Li, Kunpeng & Zou, Xuxia & Liu, Ling, 2017. "An unpaired pickup and delivery vehicle routing problem with multi-visit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 218-247.
    11. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
    12. G Brønmo & M Christiansen & B Nygreen, 2007. "Ship routing and scheduling with flexible cargo sizes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1167-1177, September.
    13. Dimitri J. Papageorgiou & Myun-Seok Cheon & George Nemhauser & Joel Sokol, 2015. "Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems," Transportation Science, INFORMS, vol. 49(4), pages 870-885, November.
    14. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    15. Hemmati, Ahmad & Hvattum, Lars Magnus & Christiansen, Marielle & Laporte, Gilbert, 2016. "An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 775-788.
    16. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    17. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
    18. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    19. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    20. Fink, Martin & Desaulniers, Guy & Frey, Markus & Kiermaier, Ferdinand & Kolisch, Rainer & Soumis, François, 2019. "Column generation for vehicle routing problems with multiple synchronization constraints," European Journal of Operational Research, Elsevier, vol. 272(2), pages 699-711.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:49:y:2015:i:2:p:384-401. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.