Solving the integrated shipment routing problem of a less-than-truckload carrier

Abstract We study a less-than-truckload (LTL) transportation network and investigate the potential benefits of implementing an integrated solution approach for shipment routing throughout this network. In LTL transportation, shipments are first delivered to local hubs to be consolidated, then transferred to another hub, and finally sent to their destinations. This routing planning process involves three routing decisions: (i) from origins to hubs,(ii) between hubs, and (iii) from hubs to destinations. These decisions are usually handled in a sequential manner due to the complexity of these individual problems, which may result in suboptimal solutions. In this study, we develop an integrated framework for solving all of these decision problems simultaneously. We propose an optimization-driven approach that can efficiently handle large instances with thousands of loads and provides solutions with significant cost savings over the sequential approach.

[1]  Ahmad I. Jarrah,et al.  Large-Scale, Less-than-Truckload Service Network Design , 2009, Oper. Res..

[2]  Sándor P. Fekete,et al.  On approximately fair cost allocation in Euclidean TSP games , 1998, Electron. Colloquium Comput. Complex..

[3]  Roberto Baldacci,et al.  An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..

[4]  T. T. Narendran,et al.  CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up , 2007, Eur. J. Oper. Res..

[5]  Ji-Bo Wang,et al.  Scheduling Jobs with Processing times Dependent on Position, Starting Time, and Allotted Resource , 2012, Asia Pac. J. Oper. Res..

[6]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

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

[8]  H. L. Ong,et al.  An Assignment-Based Local Search Method for Solving Vehicle Routing Problems , 2005, Asia Pac. J. Oper. Res..

[9]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[10]  Martin W. P. Savelsbergh,et al.  Creating schedules and computing operating costs for LTL load plans , 2013, Comput. Oper. Res..

[11]  Warren B. Powell,et al.  OR Practice - Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry , 1989, Oper. Res..

[12]  Warrren B Powell,et al.  The load planning problem of motor carriers: Problem description and a proposed solution approach , 1983 .

[13]  Selçuk Kürsat Isleyen,et al.  An Efficiently Novel Model for Vehicle Routing Problems with Stochastic Demands , 2009, Asia Pac. J. Oper. Res..

[14]  María Jesús Álvarez,et al.  Routing design for less-than-truckload motor carriers using Ant Colony Optimization , 2010 .

[15]  Nicole Wieberneit,et al.  Service network design for freight transportation: a review , 2007, OR Spectr..

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

[17]  Warren B. Powell,et al.  A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks , 1986, Transp. Sci..

[18]  P. J. Green,et al.  Real-Life Vehicle Routing with Time Windows for Visual attractiveness and Operational Robustness , 2012, Asia Pac. J. Oper. Res..

[19]  Warren B. Powell,et al.  Shipment Routing Algorithms with Tree Constraints , 1992, Transp. Sci..

[20]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[21]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[22]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..