A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing

References

• Al-Khayyal F., Hwang S.-J. Inventory constrained maritime routing and scheduling for multicommodity liquid bulk, Part I: Applications and model. Eur. J. Oper. Res. (2007) 176(1):106–130Crossref, Google Scholar
• Andersson H., Hoff A., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. (2010) 37(9):1515–1536Crossref, Google Scholar
• Bertazzi L., Savelsbergh M. W. P., Speranza M. G., Golden B., Raghavan S., Wasil E. Inventory routing. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) 43(Springer, New York) 49–72Crossref, Google Scholar
• Campbell A., Clarke L., Kleywegt A., Savelsbergh M. W. P., Crainic T. G., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston) 95–113Crossref, Google Scholar
• Campbell A. M., Clarke L. W., Savelsbergh M. W. P., Toth P., Vigo D. Inventory routing in practice. The Vehicle Routing Problem (2002) 9(SIAM, Philadelphia) 309–330SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Christiansen M. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Sci. (1999) 33(1):3–16Link, Google Scholar
• Christiansen M., Nygreen B. A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. (1998a) 81:357–378Crossref, Google Scholar
• Christiansen M., Nygreen B. Modelling path flows for a combined ship routing and inventory management problem. Ann. Oper. Res. (1998b) 82:391–413Crossref, Google Scholar
• Christiansen M., Fagerholt K., Nygreen B., Ronen D., Barnhart C., Laporte G. Maritime transportation. Transportation (2007) 14(B.V. Elsevier, Amsterdam) 189–284Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Cordeau J.-F., Laporte G., Savelsbergh M. W. P., Vigo D., Barnhart C., Laporte G. Vehicle routing. Transportation (2007) 14(B.V. Elsevier, Amsterdam) 367–428Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Desaulniers G. Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. (2010) 58(1):179–192Link, Google Scholar
• Dudzinski K., Walukiewicz S. Exact methods for the knapsack problem and its generalizations. Eur. J. Oper. Res. (1987) 28(1):3–21Crossref, Google Scholar
• Engineer F. G., Nemhauser G. L., Savelsbergh M. W. P., Song J.-H. The fixed-charge shortest-path problem. INFORMS J. Comput. (2011) . ePub ahead of print August 25, http://joc.journal.informs.org/content/early/2011/08/24/ijoc.1110.0469Google Scholar
• Faaland B. H. The multiperiod knapsack problem. Oper. Res. (1981) 29(3):612–616Link, Google Scholar
• Furman K. C., Song J.-H., Kocis G. R., McDonald M. K., Warrick P. H. Feedstock routing in the ExxonMobil downstream sector. Interfaces (2011) 41(2):149–163Link, Google Scholar
• Glover F. Improved linear integer programming formulations of nonlinear integer problems. Management Sci. (1975) 22(4):455–460Link, Google Scholar
• Gomory R. E. An algorithm for the mixed integer problem. (1960) . Technical report RM-2597, The RAND Corporation. (Reprinted 2010. M. Jünger, Th. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, L. A. Wolsey, eds. 50 Years of Integer Programming 1958–2008. Springer, Heidelberg, 77–104.)Google Scholar
• Grønhaug R., Christiansen M., Desaulniers G., Desrosiers J. A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Sci. (2010) 44(3):400–415Link, Google Scholar
• Irnich S., Desaulniers G., Desaulniers G., Desrosiers J., Solomon M. M. Shortest path problems with resource constraints. Column Generation (2005) (Kluwer, New York) 33–66Chap. 2Crossref, Google Scholar
• Moin N. H., Salhi S. Inventory routing problems: A logistical overview. J. Oper. Res. Soc. (2007) 58(9):1185–1194Crossref, Google Scholar
• Persson J. A., Göthe-Lundgren M. Shipment planning at oil refineries using column generation and valid inequalities. Eur. J. Oper. Res. (2005) 163(3):631–652Crossref, Google Scholar
• Pochet Y., Wolsey L. A. Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programming (1994) 67(1):297–323Crossref, Google Scholar
• Rodrigue J.-P., Comtois C., Slack B.The Geography of Transport Systems (2006) (Routledge, New York) Google Scholar
• Ronen D. Marine inventory routing: Shipments planning. J. Oper. Res. Soc. (2002) 53(1):108–114Crossref, Google Scholar
• Ryan D. M., Foster B. A., Wren A. An integer programming approach to scheduling. Computer Scheduling of Public Transport (1981) (Elsevier, Amsterdam) 269–280Google Scholar
• Savelsbergh M. W. P., Song J.-H. An optimization algorithm for the inventory routing problem with continuous moves. Comput. Oper. Res. (2008) 35(7):2266–2282Crossref, Google Scholar
• Song J.-H., Furman K. C. A maritime inventory routing problem: Practical approach. Comput. Oper. Res. (2012) . doi:10.1016/j.cor.2010.10.031. ForthcomingGoogle Scholar
• United States Energy Information AdministrationAnnual Energy Review (2007) (United States Energy Information Administration, Washington, DC) . Accessed November 2009, http://www.eia.doe.gov/emeu/aerGoogle Scholar