Robust Strategic Route Planning in Logistics

Logistics is a cost sensitive industry with large and fast growing routing networks. In this paper we devise a computational, robust optimization method for the strategic routing decisions of a logistics’ customer, i.e., a company that uses the services of different freight forwarders to meet its transportation demands between several sources, sinks, and hubs. The costs of such transports are determined by tariff systems that typically show economies of scale and reward the consolidation of goods that complement each other in properties relevant for transport, such as weight and volume. In the strategic planning phase, routes and hubs have to be chosen roughly one year ahead, in particular, before the actual demand is known. Our method anticipates the fluctuation of demands by minimizing the worst-case cost over a restricted scenario set. The combination of a realistic cost function, a robust modeling of uncertainty, and large-scale networks leads to highly intractable models. We show that the correspondi...

[1]  Morton E. O'Kelly,et al.  Twenty-Five Years of Hub Location Research , 2012, Transp. Sci..

[2]  Jannik Matuschke,et al.  An Integrated Approach to Tactical Transportation Planning in Logistics Networks , 2016, Transp. Sci..

[3]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[4]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[5]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[6]  Hande Yaman,et al.  The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations , 2011, INFORMS J. Comput..

[7]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[8]  Martin W. P. Savelsbergh,et al.  Improved Load Plan Design Through Integer Programming Based Local Search , 2013, Transp. Sci..

[9]  Teodor Gabriel Crainic,et al.  Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[10]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[11]  John G. Klincewicz,et al.  Solving a Freight Transport Problem Using Facility Location Techniques , 1990, Oper. Res..

[12]  Panos M. Pardalos,et al.  A bilinear relaxation based algorithm for concave piecewise linear network flow problems , 2007 .

[13]  Martin W. P. Savelsbergh,et al.  Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem , 2010, INFORMS J. Comput..

[14]  Teodor Gabriel Crainic,et al.  Service Network Design with Resource Constraints , 2016, Transp. Sci..

[15]  Peter Sanders,et al.  Think Locally, Act Globally: Highly Balanced Graph Partitioning , 2013, SEA.

[16]  Michael Poss,et al.  Affine recourse for the robust network design problem: Between static and dynamic routing , 2011, Networks.