Approximate dynamic programming for a class of long-horizon maritime inventory routing problems

Transportation Science

Volumn 49, Issue 4, 2015, Pages 870-885

  Papageorgiou, Dimitri J ^a   Cheon, Myun Seok ^a   Nemhauser, George ^b   Sokol, Joel ^b  

^a EXXONMOBIL UPSTREAM RESEARCH COMPANY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Approximate dynamic programming; Deterministic inventory routing; Maritime transportation; Mixed integer linear programming; Time decomposition

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DISTRIBUTION OF GOODS; INTEGER PROGRAMMING; PIECEWISE LINEAR TECHNIQUES; WATERWAY TRANSPORTATION;

APPROXIMATE DYNAMIC PROGRAMMING; INVENTORY ROUTING; MARITIME TRANSPORTATION; MIXED INTEGER LINEAR PROGRAMMING; TIME DECOMPOSITIONS;

DYNAMIC PROGRAMMING;

EID: 84946072405     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2014.0542     Document Type: Article

References (40)

1. 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(9):1515-1536.
2. Bertsekas DP, Tsitsiklis JN (1996) Neuro-Dynamic Programming (Athena Scientific, Belmont, MA).
3. Blair CE, Jeroslow RG (1977) The value function of a mixed integer program: I. Discrete Math. 19(2):121-138.
4. Blair CE, Jeroslow RG (1979) The value function of a mixed integer program: II. Discrete Math. 25(1):7-19.
5. Bouzaiene-Ayari B, Cheng C, Das S, Fiorillo R, Powell WB (2014) From single commodity to multiattribute models for locomotive optimization: A comparison of integer programming and approximate dynamic programming. Transportation Sci., ePub ahead of print July 28, http://dx.doi.org/10.1287/trsc.2014.0536.
6. Campbell A, Clarke L, Kleywegt A, Savelsbergh MWP (1998) The inventory routing problem. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer, Boston), 95-113.
7. Christiansen M, Fagerholt K (2009) Maritime inventory routing problems. Floudas CA, Pardalos PM, eds. Encyclopedia of Optimization, 2nd ed. (Springer-Verlag, New York), 1947-1955.
8. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2013) Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228(3):467-483.
9. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventoryrouting. Transportation Sci. 48(1):1-19.
10. Engineer FG, Furman KC, Nemhauser GL, Savelsbergh MWP, Song J-H (2012) A branch-price-and-cut algorithm for single product maritime inventory routing. Oper. Res. 60(1):106-122.
11. Fodstad M, Uggen KT, Rømo F, Lium A-G, Stremersch G (2010) LNGScheduler: A rich model for coordinating vessel routing, inventories and trade in the liquefied natural gas supply chain. J. Energy Markets 3(4):31-64.
12. Furman KC, Song J-H, Kocis GR, McDonald MK, Warrick PH (2011) Feedstock routing in the ExxonMobil downstream sector. Interfaces 41(2):149-163.
13. George AP, Powell WB (2006) Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Machine Learn. 65(1):167-198.
14. Godfrey GA, Powell WB (2002a) An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times. Transportation Sci. 36(1):21-39.
15. Godfrey GA, Powell WB (2002b) An adaptive dynamic programming algorithm for dynamic fleet management, II: Multiperiod travel times. Transportation Sci. 36(1):40-54.
16. Goel V, Furman KC, Song J-H, El-Bakry AS (2012) Large neighborhood search for LNG inventory routing. J. Heuristics 18(6):821-848.
17. Goel V, Slusky M, Van Hoeve W-J, Furman KC, Shao Y (2014) Constraint programming for LNG ship scheduling and inventory management. Eur. J. Oper. Res. Forthcoming.
18. Grønhaug R, Christiansen M (2009) Supply chain optimization for the liquefied natural gas business. Innovations in Distribution Logistics, Lecture Notes in Economics and Mathematical Systems, Vol. 619(Springer-Verlag, Berlin), 195-218.
19. Grønhaug R, Christiansen M, Desaulniers G, Desrosiers J (2010) A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Sci. 44(3):400-415.
20. Halvorsen-Weare E, Fagerholt K (2013) Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints. Ann. Oper. Res. 203(1):167-186.
21. Hewitt M, Nemhauser GL, Savelsbergh MWP, Song J-H (2013) A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40(5):1410-1419.
22. Nascimento JM, Powell WB (2009) An optimal approximate dynamic programming algorithm for the lagged asset acquisition problem. Math. Oper. Res. 34(1):210-237.
23. Nascimento JM, Powell WB (2013) An optimal approximate dynamic programming algorithm for concave, scalar storage problems with vector-valued controls. Automatic Control, IEEE Trans. 58(12):2995-3010.
24. Papageorgiou DJ, Keha AB, Nemhauser GL, Sokol J (2014a) Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS J. Comput. 26(4):825-847.
25. Papageorgiou DJ, Nemhauser GL, Sokol J, Cheon M-S, Keha AB (2014b) MIRPLib-A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. Eur. J. Oper. Res. 235(2):350-366.
26. Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality, 2nd ed. (John Wiley & Sons, Hoboken, NJ).
27. Rakke JG, Andersson H, Christiansen M, Desaulniers G (2015) A new formulation based on customer delivery patterns for a maritime inventory routing problem. Transportation Sci. 49(2):384-401.
28. Rakke JG, Stålhane M, Moe CR, Christiansen M, Andersson H, Fagerholt K, Norstad I (2011) A rolling horizon heuristic for creating a liquefied natural gas annual delivery program. Transportation Res. Part C 19(5):896-911.
29. Ruszczynski A (2010) Post-decision states and separable approximations are powerful tools of approximate dynamic programming. INFORMS J. Comput. 22(1):20-22.
30. Savelsbergh MWP, Song J-H (2008) An optimization algorithm for the inventory routing problem with continuous moves. Comput. Oper. Res. 35(7):2266-2282.
31. Shao Y, Furman KC, Goel V, Hoda S (2014) Bound improvement for LNG inventory routing. Transportation Sci. Forthcoming.
32. Simão HP, Day J, George AP, Gifford T, Nienow J, Powell WB (2009) An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Sci. 43(2):178-197.
33. Song J-H, Furman KC (2013) A maritime inventory routing problem: Practical approach. Comput. Oper. Res. 40(3):657-665.
34. Stålhane M, Rakke JG, Moe CR, Andersson H, Christiansen M, Fagerholt K (2012) A construction and improvement heuristic for a liquefied natural gas inventory routing problem. Comput. Indust. Engrg. 62(1):245-255.
35. Sutton RS, Barto AG (1998) Reinforcement Learning: An Introduction (MIT Press, Cambridge, MA).
36. Topaloglu H (2006) A parallelizable dynamic fleet management model with random travel times. Eur. J. Oper. Res. 175(2):782-805.
37. Topaloglu H (2007) A parallelizable and approximate dynamic programming-based dynamic fleet management model with random travel times and multiple vehicle types. Zeimpekis VS, Giaglis GM, Tarantilis CD, Minis I, eds. Dynamic Fleet Management: Concepts, Systems, Algorithms and Case Studies (Springer, New York), 65-93.
38. Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. 18(1):31-42.
39. Toriello A, Nemhauser GL, Savelsbergh MWP (2010) Decomposing inventory routing problems with approximate value functions. Naval Res. Logist. 57(8):718-727.
40. Uggen K, Fodstad M, Nørstebø V (2013) Using and extending fix-and-relax to solve maritime inventory routing problems. TOP 21(2):355-377.