Combinatorial Heuristics for Inventory Routing Problems

References

• Adulyasak Y, Cordeau JF, Jans R (2014) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103–120.Link, Google Scholar
• Aksen D, Kaya O, Salman FS, Tüncel O (2014) An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur. J. Oper. Res. 239(2):413–426.Crossref, Google Scholar
• Archetti C, Boland N, Speranza MG (2017) A matheuristic for the multivehicle inventory routing problem. INFORMS J. Comput. 29(3):377–387.Link, Google Scholar
• Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24(1):101–116.Link, Google Scholar
• Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory routing problem. Transportation Sci. 41(3):382–391.Link, Google Scholar
• Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Internat. Trans. Oper. Res. 21(3):353–374.Crossref, Google Scholar
• Arkin E, Joneja D, Roundy R (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8:61–66.Crossref, Google Scholar
• Avella P, Boccia M, Wolsey LA (2018) Single-period cutting planes for inventory routing problems. Transportation Sci. 52(3):497–508.Link, Google Scholar
• Berger B, Peng J, Singh M (2013) Computational solutions for omics data. Nature Reviews Genetics 14(5):333–346.Crossref, Google Scholar
• Bienkowski M, Byrka J, Chrobak M, Jeż L, Nogneng D, Sgall J (2014) Better approximation bounds for the joint replenishment problem. Chekuri C, ed. Proc. 25th Annual ACM-SIAM Symp. Discrete Algorithms (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA), 42–54.Google Scholar
• Bienstock D, Goemans MX, Simchi-Levi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Math. Programming 59(1–3):413–420.Crossref, Google Scholar
• Burns L, Hall R, Blumenfeld D, Daganzo C (1985) Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33(3):469–490.Link, Google Scholar
• Campbell A, Savelsbergh M (2002) Inventory Routing in Practice, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, PA).Google Scholar
• Campbell A, Savelsbergh M, Clarke L, Kleywegt A (1998) The Inventory Routing Problem (Springer US, Philadelphia).Crossref, Google Scholar
• Chan L, Fedgergruen A, Simchi-Levi D (1998) Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. 46(1):96–106.Link, Google Scholar
• Chien TW, Balakrishnan A, Wong RT (1989) An integrated inventory allocation and vehicle routing problem. Transportation Sci. 23(2):67–76.Link, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2012a) Consistency in multi-vehicle inventory-routing. Transportation Res. Part C Emerging Tech. 24(1):270–287.Crossref, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2012b) The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11):2537–2548.Crossref, Google Scholar
• Cook W (2015) Concorde TSP solver. Accessed February 16, 2017, http://www.math.uwaterloo.ca/tsp/concorde/index.html.Google Scholar
• Desaulniers G, Rakke J, Coelho L (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Sci. 50(3):1060–1076.Link, Google Scholar
• Fischetti M, Leitner M, Ljubić I, Luipersbeck M, Monaci M, Resch M, Salvagnin D, Sinnl M (2017) Thinning out Steiner trees: A node-based model for uniform edge costs. Math. Programming Comput. 9(2):203–229.Crossref, Google Scholar
• Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27(1):1–18.Link, Google Scholar
• Fukunaga T, Nikzad A, Ravi R (2014) Deliver or hold: Approximation algorithms for the periodic inventory routing problem. Jansen K, ed. Proc. 17th Internat. Workshop Approximation Algorithms Combin. Optim Problems (Schloss Dagstuhl, Germany), 209–225.Google Scholar
• Goel V, Furman KC, Song J, El-Bakry AS (2012) Large neighborhood search for LNG inventory routing. J. Heuristics 18(6):821–848.Crossref, Google Scholar
• Goemans M, Williamson D (1995) A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2):296–317.Crossref, Google Scholar
• Hegde C, Indyk P, Schmidt L (2016) A nearly-linear time framework for graph-structured sparsity. Subbarao Kambhampati, ed. Proc. 25th Internat. Joint Conf. Artificial Intelligence (AAAI Press/International Joint Conferences on Artificial Intelligence, Palo Alto, CA), 4165–4169.Google Scholar
• Held M, Wolfe P, Crowder HP (1974) Validation of subgradient optimization. Math. Programming 6(1):62–88.Crossref, Google Scholar
• Khurana V, Peng J, Chung CY, Auluck PK, Fanning S, Tardiff DF, Bartels T, et al. (2017) Genome-scale networks link neurodegenerative disease genes to α-synuclein through specific molecular pathways. Cell Systems 4:157–170.Crossref, Google Scholar
• Leitner M, Ljubić I, Luipersbeck M, Sinnl M (2018) A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems. INFORMS J. Comput. 30(2):402–420.Link, Google Scholar
• Levi R, Roundy R, Shmoys D (2006) Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2):267–284.Link, Google Scholar
• Levi R, Roundy R, Shmoys D, Sviridenko M (2008) First constant approximation algorithm for the one-warehouse multi-retailer problem. Management Sci. 54(4):763–776.Link, Google Scholar
• Ljubić I, Weiskircher R, Pferschy U, Klau GW, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Programming 105(2–3):427–449.Crossref, Google Scholar
• Nagarajan V, Shi C (2016) Approximation algorithms for inventory problems with submodular or routing costs. Math. Programming 160:225–244.Crossref, Google Scholar
• Nonner T, Souza A (2009) Approximating the joint replenishment problem with deadlines. Discrete Math. Algorithms Appl. 1(2):153–174.Crossref, Google Scholar
• Schmidt L, Hegde C, Indyk P, Lu L, Chi X, Hohl D (2015) Seismic feature extraction using Steiner tree methods. Clarkson V, Manton J, eds. 2015 IEEE Internat. Conf. Acoustics Speech Signal Processing (ICASSP) (Institute of Electrical and Electronics Engineers (IEEE), New York), 1647–1651.Google Scholar
• Shapiro JF (1979) A survey of Lagrangean techniques for discrete optimization. Ann. Discrete Math. 5:113–138.Crossref, Google Scholar
• Shen ZJM, Qi L (2007) Incorporating inventory and routing costs in strategic location models. Eur. J. Oper. Res. 179(2):372–389.Crossref, Google Scholar
• Shirokikh VA, Zakharov VV (2015) Dynamic adaptive large neighborhood search for inventory routing problem. Le Thi H, Pham Dinh T, Nguyen N, eds. Modelling, Computation and Optimization in Information Systems and Management Sciences, vol. 359 (Springer, Cham, Switzerland), 231–241.Crossref, Google Scholar
• Tuncbag N, Braunstein A, Pagnani A, Huang SSC, Chayes J, Borgs C, Zecchina R, Fraenkel E (2013) Simultaneous reconstruction of multiple signaling pathways via the prize-collecting Steiner forest problem. J. Comput. Biology 20(2):124–136.Crossref, Google Scholar
• Yu Y, Chen H, Chu F (2008) A new model and hybrid approach for large scale inventory routing problems. Eur. J. Oper. Res. 189(3):1022–1040.Crossref, Google Scholar