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

TOP

Volumn 21, Issue 2, 2013, Pages 355-377

  Uggen, Kristin Tolstad ^a   Fodstad, Marte ^a,b   Nørstebø, Vibeke Stærkebye ^a  

^a SINTEF   (Norway)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Fix and relax; Liquefied natural gas (LNG); Maritime inventory routing problem (IRP); Time decomposition heuristic

Indexed keywords

EID: 84878959111     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-011-0174-z     Document Type: Article

References (46)

1. 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.
2. Akartunali K, Miller A (2009) A heuristic approach for big bucket multi-level production planning problems. Eur J Oper Res 193: 396-411.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.
9. Appelgren LH (1969) A column generation algorithm for a ship scheduling problem. Transp Sci 3: 53-68.
10. Appelgren LH (1971) Integer programming methods for a vessel scheduling problem. Transp Sci 5: 64-78.
11. Aytekin M (2002) Applying a fix-and-relax heuristic to U. S. navy force structure planning. Naval Postgraduate School.
12. 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.
13. 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.
14. Campbell AM, Clarke L, Kleywegt A, Savelsbergh MWP (1998) Inventory routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer Academic, Dordrecht.
15. Christiansen M (1999) Decomposition of a combined inventory and time constrained ship routing problem. Transp Sci 33: 3-16.
16. Christiansen M, Fagerholt K (2009) Maritime inventory routing problems. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York.
17. Christiansen M, Nygreen B (1998a) A method for solving ship routing problems with inventory constraints. Ann Oper Res 81: 357-378.
18. Christiansen M, Nygreen B (1998b) Modelling path flows for a combined ship routing and inventory management problem. Ann Oper Res 82: 391-412.
19. 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.
20. Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38: 1-18.
21. 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.
22. 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.
23. 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.
24. 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.
25. De Araujo S, Arenales MN, Clark AR (2008) Lot sizing and furnace scheduling in small foundries. Comput Oper Res 35: 916-932.
26. 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.
27. Dror M, Ball M, Golden B (1985) A computational comparison of algorithms for the inventory routing problem. Ann Oper Res 4: 3-23.
28. Escudero LF, Salmeron J (2005) On a fix-and-relax framework for a class of project scheduling problems. Ann Oper Res 140: 163-188.
29. Federgruen A, Meissner J, Tzur M (2007) Progressive interval heuristic for multi-item capacitated lot-sizing problems. Oper Res 55: 490-502.
30. 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.
31. 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.
32. 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.
33. 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.
34. 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.
35. 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.
36. IEA (2009) World energy outlook. http://www. iea. org/speech/2009/Tanaka/WEO2009_Press_Conference. pdf.
37. Kelly JD, Mann JL (2004) Flowsheet decomposition heuristic for scheduling: a relax-and-fix method. Comput Chem Eng 28: 2193-2200.
38. Marín ÁG (2006) Airport management: taxi planning. Ann Oper Res 143: 191-202.
39. Miller DM (1987) An interactive computer-aided ship scheduling system. Eur J Oper Res 32: 363-379.
40. 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.
41. Moscato P, Cotta C (2003) a gentle introduction to memetic algorithms. In: Glover FW, Kochenberger GA (eds) Handbook of metaheuristics. Springer, Berlin.
42. 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.
43. 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.
44. Pochet Y, Warichet F (2008) A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Comput Chem Eng 32: 2723-2744.
45. 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.
46. Wolsey LA (1998) Integer Programming. Wiley, New York.