Two-stage decomposition algorithms for single product maritime inventory routing

INFORMS Journal on Computing

Volumn 26, Issue 4, 2014, Pages 825-847

  Papageorgiou, Dimitri J ^a   Keha, Ahmet B ^a   Nemhauser, George L ^b   Sokol, Joel ^b  

^a EXXONMOBIL UPSTREAM RESEARCH COMPANY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Aggregation; Decomposition; Deterministic inventory routing; Lot sizing; Maritime transportation; Mixed integer linear programming

Indexed keywords

AGGLOMERATION; DECOMPOSITION; ITERATIVE METHODS; ROUTING ALGORITHMS; WATERWAY TRANSPORTATION;

CAPACITY REQUIREMENT; DECOMPOSITION ALGORITHM; INVENTORY ROUTING; LOT SIZING; MARITIME INVENTORY ROUTING; MARITIME TRANSPORTATION; MIXED INTEGER LINEAR PROGRAMMING; MIXED INTEGER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 84907697757     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2014.0601     Document Type: Article

References (31)

1. Agra A, Andersson H, Christiansen M, Wolsey L (2013a) A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4):297-314.
2. Agra A, Christiansen M, Delgado A (2013b) Mixed integer formulations for a short sea fuel oil distribution problem. Transportation Sci. 47(1):108-124.
3. Andersson H (2011) A maritime pulp distribution problem. INFOR 49(2):125-138.
4. Andersson H, Christiansen M, Fagerholt K (2010a) Transportation planning and inventory management in the LNG supply chain. Energy, Natural Resources and Environmental Economics (Springer, Berlin Heidelberg), 427-439.
5. Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010b) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9): 1515-1536.
6. Bilgen B, Ozkarahan I (2007) A mixed-integer linear programming model for bulk grain blending and shipping. Internat. J. Production Econom. 107(2):555-571.
7. Campbell A, Clarke L, Kleywegt A, Savelsbergh M (1998) The inventory routing problem. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Springer, New York), 95-113.
8. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, Vol. 14 (Elsevier, Philadelphia), 189-284.
9. Christof T, Løbel A, Stoer M (1997) Porta-polyhedron representation transformation algorithm. Software package. http://www.zib.de/Optimization/Software/Porta.
10. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1-19.
11. 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(1): 39-51.
12. 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.
13. Furman KC, Song J-H, Kocis GR, McDonald MK, Warrick PH (2011) Feedstock routing in the ExxonMobil downstream sector. Interfaces 41(2):149-163.
14. Goel V, Furman KC, Song J-H, El-Bakry AS (2012) Large neighborhood search for LNG inventory routing. J. Heuristics 18(6):821-848.
15. 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.
16. Grønhaug R, Christiansen M (2009) Supply chain optimization for the liquefied natural gas business. Innovations in Distribution Logistics (Springer, Berlin Heidelberg), 195-218.
17. 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.
18. Hennig F, Nygreen B, Furman KC, Song J-H, Kocis GR (2011) Crude oil tanker routing and scheduling. INFOR 49(2):153-170.
19. Hennig F, Nygreen B, Christiansen M, Fagerholt K, Furman K, Song J-H, Kocis G, Warrick P (2012) Maritime crude oil transportation- A split pickup and split delivery problem. Eur. J. Oper. Res. 218(3):764-774.
20. 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.
21. Loparic M, Marchand H, Wolsey LA (2003) Dynamic knapsack sets and capacitated lot-sizing. Math. Programming 95(1):53-69.
22. Papageorgiou D, Cheon M-S, Nemhauser G, Sokol J (2014a) Approximate dynamic programming for a class of long-horizon maritime inventory routing problems. Transportation Sci. Forthcoming.
23. 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.
24. Persson JA, Göthe-Lundgren M (2005) Shipment planning at oil refineries using column generation and valid inequalities. Eur. J. Oper. Res. 163(3):631-652.
25. Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming, Springer Series in Operations Research and Financial Engineering (Springer, New York).
26. 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.
27. Rocha R, Grossmann IE, de Aragão MVP (2013) Cascading knapsack inequalities: Reformulation of a crude oil distribution problem. Ann. Oper. Res. 203(1):1-18.
28. Ronen D (2002) Marine inventory routing: Shipments planning. J. Oper. Res. Soc. 53:108-114.
29. Shao Y, Furman KC, Goel V, Hoda S (2014) Bound improvement for LNG inventory routing. Transportation Sci. Submitted.
30. Song J-H, Furman KC (2013) A maritime inventory routing problem: Practical approach. Comput. Oper. Res. 40(3):657-665.
31. 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.