Skip to main content
SpringerLink
Log in

A Relax-and-Fix Algorithm for a Maritime Inventory Routing Problem

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10572))

Included in the following conference series:

Abstract

This work presents a relax-and-fix algorithm for solving a class of single product Maritime Inventory Routing Problem. The problem consists in routing and scheduling a heterogeneous fleet of vessels to supply a set of ports, keeping inventory at production and consumption ports between lower and upper limits. Two sets of constraints are proposed both for tightening the problem relaxation and for obtaining better integer solutions. Four MIP-based local searches to improve the solution provided by the relax-and-fix approach are presented. Computational experiments were carried out on instances of the MIRPLIB, showing that our approach is able to solve most instances in a reasonable amount of time, and to find new best-known solutions for two instances. A new dataset has been created by removing the clustered characteristics of ports from the original instances, and the effectiveness of our method was tested in these more general instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Maritime inventory routing problem library (MIRPLIB). https://mirplib.scl.gatech.edu/ (accessed April 05, 2017)

  2. Agra, A., Andersson, H., Christiansen, M., Wolsey, L.: A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4), 297–314 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Agra, A., Christiansen, M., Ivarsøy, K.S., Solhaug, I.E., Tomasgard, A.: Combined ship routing and inventory management in the salmon farming industry. Annals of Operations Research, 1–25 (2016)

    Google Scholar 

  4. Christiansen, M.: Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem. Transportation Science 33(1), 3–16 (1999)

    Article  MATH  Google Scholar 

  5. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. European Journal of Operational Research 228(3), 467–483 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Christiansen, M., Fagerholt, K., Ronen, D.: Ship Routing and Scheduling: Status and Perspectives. Transportation Science 38(1), 1–18 (2004)

    Article  Google Scholar 

  7. Goel, V., Furman, K.C., Song, J.H., El-Bakry, A.S.: Large neighborhood search for LNG inventory routing. Journal of Heuristics 18(6), 821–848 (2012)

    Article  Google Scholar 

  8. Hewitt, M., Nemhauser, G., Savelsbergh, M., Song, J.H.: A branch-and-price guided search approach to maritime inventory routing. Computers and Operations Research 40(5), 1410–1419 (2013)

    Article  MATH  Google Scholar 

  9. Jiang, Y., Grossmann, I.E.: Alternative mixed-integer linear programming models of a maritime inventory routing problem. Computers & Chemical Engineering 77, 147–161 (2015)

    Article  Google Scholar 

  10. Papageorgiou, D.J., Cheon, M.S., Harwood, S., Trespalacios, F., Nemhauser, G.L., Stewart, H.M.: Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing (2016)

    Google Scholar 

  11. Papageorgiou, D.J., Keha, A.B., Nemhauser, G.L., Sokol, J.: Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS Journal on Computing 26(4), 825–847 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Papageorgiou, D.J., Nemhauser, G.L., Sokol, J., Cheon, M.S., Keha, A.B.: MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. European Journal of Operational Research 235(2), 350–366 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pochet, Y., Wolsey, L.A.: Production planning by mixed integer programming. Springer Science & Business Media (2006)

    Google Scholar 

  14. Song, J.H., Furman, K.C.: A maritime inventory routing problem: Practical approach. Computers & Operations Research 40(3), 657–665 (2013)

    Article  MATH  Google Scholar 

  15. Uggen, K.T., Fodstad, M., Nørstebø, V.S.: Using and extending fix-and-relax to solve maritime inventory routing problems. TOP 21(2), 355–377 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidade Federal Do Rio Grande Do Sul, Porto Alegre, Brazil

    Marcelo W. Friske & Luciana S. Buriol

Authors
  1. Marcelo W. Friske
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luciana S. Buriol
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo W. Friske .

Editor information

Editors and Affiliations

  1. University of Southampton , Southampton, United Kingdom

    Tolga Bektaş

  2. University of Southampton , Southampton, United Kingdom

    Stefano Coniglio

  3. University of Southampton , Southampton, United Kingdom

    Antonio Martinez-Sykora

  4. University of Hamburg , Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Friske, M.W., Buriol, L.S. (2017). A Relax-and-Fix Algorithm for a Maritime Inventory Routing Problem. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68496-3_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68495-6

  • Online ISBN: 978-3-319-68496-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation