Robust Strategic Route Planning in Logistics

References

• Altın A, Yaman H, Pınar MÇ (2011) The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1):75–89.Link, Google Scholar
• Alumur S, Kara BY (2008) Network hub location problems: The state of the art. Eur. J. Oper. Res. 190(1):1–21.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1):49–71.Crossref, Google Scholar
• Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2002) Hub location problems. Drezner Z, Hamacher HW, eds. Facility Location: Applications and Theory (Springer-Verlag, Berlin), 373–407.Crossref, Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Crainic TG, Hewitt M, Toulouse M, Vu DM (2016) Service network design with resource constraints. Transportation Sci. 50(4): 1380–1393.Link, Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM (2005) Column Generation, Vol. 5 (Springer Science+Business Media, New York).Crossref, Google Scholar
• Erera A, Hewitt M, Savelsbergh MWP, Zhang Y (2013) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
• Guisewite GM, Pardalos PM (1990) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Ann. Oper. Res. 25(1):75–99.Crossref, Google Scholar
• Harks T, König FG, Matuschke J, Richter AT, Schulz J (2016) An integrated approach to tactical transportation planning in logistics networks. Transportation Sci. 50(2):439–460.Link, Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2):314–325.Link, Google Scholar
• Klincewicz JG (1990) Solving a freight transport problem using facility location techniques. Oper. Res. 38(1):99–109.Link, Google Scholar
• König FG, Matuschke J, Richter A (2012) Multi-dimensional commodity covering for tariff selection in transportation. Delling D, Liberti L, eds. 12th Workshop on Algorithmic Approaches for Transportation Model., Optim., Systems (ATMOS 2012), OASICS, Vol. 25 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 58–70.Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
• Nahapetyan A, Pardalos PM (2007) A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J. Indust. Management Optim. 3(1):71–85.Crossref, Google Scholar
• Poss M, Raack C (2013) Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61(2):180–198.Crossref, Google Scholar
• Sanders P, Schulz C (2013) Think locally, act globally: Highly balanced graph partitioning. Bonifaci V, Demetrescu C, Marchetti-Spaccamela A, eds. Proc. 12th Internat. Sympos. Experiment. Algorithms (SEA’13), Lecture Notes Comput. Sci., Vol. 7933 (Springer-Verlag, Berlin Heidelberg), 164–175.Crossref, Google Scholar