Skip to main content
SpringerLink
Log in

Using and extending fix-and-relax to solve maritime inventory routing problems

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

The paper presents a new way of optimising maritime inventory routing problems (IRP) by using a heuristic approach based on fix-and-relax time decomposition extended with two new features. The purpose of the extensions is to reduce computation time during the fix-and-relax process and to improve solution quality after a first solution is found. The feature which improves solution quality is independent of the method used for calculating the first solution. In this study, the algorithm and extensions have been tested on four liquefied natural gas (LNG) cases and the impacts on computational time and objective function value are reported. The results show that using fix-and-relax reduces computing time considerably while the objective function value is only slightly worse compared to a general MILP solver. Furthermore, the results confirm that the extensions work according to the intentions when compared to the original fix-and-relax heuristic. For relatively complex cases, it appears advantageous to use the extensions developed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Absi N, Kedad-Sidhoum S (2007) MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO Oper Res 41:171–192

    Article  Google Scholar 

  • Akartunali K, Miller A (2009) A heuristic approach for big bucket multi-level production planning problems. Eur J Oper Res 193:396–411

    Article  Google Scholar 

  • Al-Ameri TA, Shah N, Papageorgiou LG (2008) Optimization of vendor-managed inventory systems in a rolling horizon framework. Comput Ind Eng 54:1019–1047

    Article  Google Scholar 

  • Al-Khayal F, Hwang SJ (2007) Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: applications and model. Eur J Oper Res 176:106–130

    Article  Google Scholar 

  • Alonso A, Escudero LF, Ortuno MT (2000) A stochastic 0-1 program based approach for the air traffic flow management problem. Eur J Oper Res 120:47–62

    Article  Google Scholar 

  • Alonso-Ayuso A, Escudero LF, Pizarro C (2009) On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty. Ann Oper Res 166:223–242

    Article  Google Scholar 

  • Alonso-Ayuso A, Escudero LF, Pizarro C, Romeijn HE, Romero Morales D (2006) On solving the multi-period single-sourcing problem under uncertainty. Comput Manag Sci 3:29–53

    Article  Google Scholar 

  • Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536

    Article  Google Scholar 

  • Appelgren LH (1969) A column generation algorithm for a ship scheduling problem. Transp Sci 3:53–68

    Article  Google Scholar 

  • Appelgren LH (1971) Integer programming methods for a vessel scheduling problem. Transp Sci 5:64–78

    Article  Google Scholar 

  • Aytekin M (2002) Applying a fix-and-relax heuristic to U.S. navy force structure planning. Naval Postgraduate School

  • Beraldi P, Ghiani G, Grieco A, Guerriero E (2006) Fix and relax heuristic for a stochastic lot-sizing problem. Comput Optim Appl 33:303–318

    Article  Google Scholar 

  • Beraldi P, Ghiani G, Grieco A, Guerriero E (2008) Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up cost. Comput Oper Res 35:3644–3656

    Article  Google Scholar 

  • Campbell AM, Clarke L, Kleywegt A, Savelsbergh MWP (1998) Inventory routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer Academic, Dordrecht

    Google Scholar 

  • Christiansen M (1999) Decomposition of a combined inventory and time constrained ship routing problem. Transp Sci 33:3–16

    Article  Google Scholar 

  • Christiansen M, Fagerholt K (2009) Maritime inventory routing problems. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York

    Google Scholar 

  • Christiansen M, Nygreen B (1998a) A method for solving ship routing problems with inventory constraints. Ann Oper Res 81:357–378

    Article  Google Scholar 

  • Christiansen M, Nygreen B (1998b) Modelling path flows for a combined ship routing and inventory management problem. Ann Oper Res 82:391–412

    Article  Google Scholar 

  • Christiansen M, Nygreen B (2005) Robust inventory ship routing by column generation. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, New York

    Google Scholar 

  • Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38:1–18

    Article  Google Scholar 

  • Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. In: Barnhart C, Laporte G (eds) Transportation. Handbooks in operations research and management science. Elsevier, Amsterdam, Chap 4

    Google Scholar 

  • Cordeau JF, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. In: Barnhart C, Laporte G (eds) Transportation. Handbooks in operations research and management science. Elsevier, Amsterdam, Chap 6

    Google Scholar 

  • Dauzère-Pérès S, Nordli A, Olstad A, Haugen K, Koester U, Myrstad PO, Teistklub G, Reistad A (2007) Omya hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 37:39–51

    Article  Google Scholar 

  • De Araujo S, Arenales MN, Clark AR (2007) Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. J Heuristics 13:337–358

    Article  Google Scholar 

  • De Araujo S, Arenales MN, Clark AR (2008) Lot sizing and furnace scheduling in small foundries. Comput Oper Res 35:916–932

    Article  Google Scholar 

  • Dillenberger C, Escudero LF, Wollensak A, Zhang W (1994) On practical resource allocation for production planning and scheduling with period overlapping setups. Eur J Oper Res 75:275–286

    Article  Google Scholar 

  • Dror M, Ball M, Golden B (1985) A computational comparison of algorithms for the inventory routing problem. Ann Oper Res 4:3–23

    Article  Google Scholar 

  • Escudero LF, Salmeron J (2005) On a fix-and-relax framework for a class of project scheduling problems. Ann Oper Res 140:163–188

    Article  Google Scholar 

  • Federgruen A, Meissner J, Tzur M (2007) Progressive interval heuristic for multi-item capacitated lot-sizing problems. Oper Res 55:490–502

    Article  Google Scholar 

  • Ferreira D, Morabito R, Rangel S (2009) Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur J Oper Res 196:697–706

    Article  Google Scholar 

  • Flatberg T, Haavardtun H, Kloster O, Løkketangen A (2000) Combining exact and heuristic methods for solving a vessel routing problem with inventory constraints and time windows. Ric Oper 29:55–68

    Google Scholar 

  • Fodstad M, Tolstad Uggen K, Rømo F, Lium A-G, Stremersch G, Hecq S (2010) LNGScheduler: a rich model for coordinating vessel routing, inventories and trade in the LNG-supply chain. J Energy Mark 3:1–34

    Google Scholar 

  • Golden B, Assad A, Dahl R (1984) Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Syst 7:181–190

    Google Scholar 

  • Grønhaug R, Christiansen M (2009) Supply chain optimization for the liquefied natural gas business. In: Bertazzi L, Speranza MG, Van Nunen JAEE, (eds) Innovations in distribution logistics. Springer, Berlin

    Google Scholar 

  • Grønhaug R, Christiansen M, Desaulniers G, Desrosiers J (2008) A branch-and-price-and-cut method for a liquefied natural gas inventory routing problem. Les Cahiers du GERAD

  • IEA (2009) World energy outlook. http://www.iea.org/speech/2009/Tanaka/WEO2009_Press_Conference.pdf

  • Kelly JD, Mann JL (2004) Flowsheet decomposition heuristic for scheduling: a relax-and-fix method. Comput Chem Eng 28:2193–2200

    Article  Google Scholar 

  • Marín ÁG (2006) Airport management: taxi planning. Ann Oper Res 143:191–202

    Article  Google Scholar 

  • Miller DM (1987) An interactive computer-aided ship scheduling system. Eur J Oper Res 32:363–379

    Article  Google Scholar 

  • Mohammadi M, Fatemi Ghomi SMT, Karimi B, Torabi SA (2008) Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lot-sizing problem with sequence-dependent setups. J Intell Manuf

  • Moscato P, Cotta C (2003) a gentle introduction to memetic algorithms. In: Glover FW, Kochenberger GA (eds) Handbook of metaheuristics. Springer, Berlin

    Google Scholar 

  • Ouhimmou M, D’amours S, Beauregard R, Ait-Kadi D, Singh Chauhan S (2008) Furniture supply chain tactical planning optimization using a time decomposition approach. Eur J Oper Res 189:952–970

    Article  Google Scholar 

  • Persson JA, Göthe-Lundgren M (2005) Shipment planning at oil refineries using column generation and valid inequalities. Eur J Oper Res 163:631–652

    Article  Google Scholar 

  • Pochet Y, Warichet F (2008) A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Comput Chem Eng 32:2723–2744

    Article  Google Scholar 

  • Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper Res 51:487–502

    Article  Google Scholar 

  • Wolsey LA (1998) Integer Programming. Wiley, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SINTEF, S.P. Andersens v. 5, 7465, Trondheim, Norway

    Kristin Tolstad Uggen, Marte Fodstad & Vibeke Stærkebye Nørstebø

  2. Norwegian University of Science and Technology, Alfred Getz v 3, 7491, Trondheim, Norway

    Marte Fodstad

Authors
  1. Kristin Tolstad Uggen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marte Fodstad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vibeke Stærkebye Nørstebø
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marte Fodstad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Uggen, K.T., Fodstad, M. & Nørstebø, V.S. Using and extending fix-and-relax to solve maritime inventory routing problems. TOP 21, 355–377 (2013). https://doi.org/10.1007/s11750-011-0174-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-011-0174-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation