Planning and Scheduling in Intermodal Transport

Abstract We consider a problem that arises in intermodal transport and which addresses the scheduling of transportation requests that involve container movements from customers (shippers or receivers) to terminals and vice versa. The transportation requests are handled by a trucking company which operates several depots and a fleet of homogeneous trucks that must be routed and scheduled to minimize the total truck operating time under hard time window constraints. Empty containers are considered as transportation resources. They are provided to the customers and are repositioned after usage. For the problem at hand, we present a model formulation based on a full-truckload pickup-and-delivery problem with time windows and propose a two-stage heuristic solution approach.

[1]  Ruiyou Zhang,et al.  A reactive tabu search algorithm for the multi-depot container truck transportation problem , 2009 .

[2]  Guangming Zhang,et al.  Improved modeling and solution methods for the multi-resource routing problem , 2007, Eur. J. Oper. Res..

[3]  Gerrit K. Janssens,et al.  A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals , 2010, Int. J. Comput. Aided Eng. Technol..

[4]  George L. Nemhauser,et al.  An optimization approach for planning daily drayage operations , 2006, Central Eur. J. Oper. Res..

[5]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[6]  Akio Imai,et al.  A Lagrangian relaxation-based heuristic for the vehicle routing with full container load , 2007, Eur. J. Oper. Res..

[7]  Cathy Macharis,et al.  Opportunities for OR in intermodal freight transport research: A review , 2004, Eur. J. Oper. Res..

[8]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[9]  Karen Renee Smilowitz,et al.  Multi-resource routing with flexible tasks: an application in drayage operations , 2006 .

[10]  Gerrit K. Janssens,et al.  A local search heuristic for the pre- and end-haulage of intermodal container terminals , 2009, Comput. Oper. Res..

[11]  Gerrit K. Janssens,et al.  Integrated planning of loaded and empty container movements , 2012, OR Spectrum.

[12]  Erwin Pesch,et al.  Analysis, modeling and solution of the concrete delivery problem , 2009, Eur. J. Oper. Res..

[13]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[14]  Fred Glover,et al.  TSP Ejection Chains , 1997, Discret. Appl. Math..

[15]  Ruiyou Zhang,et al.  Heuristic-based truck scheduling for inland container transportation , 2010, OR Spectr..

[16]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[17]  Petros A. Ioannou,et al.  CONTAINER MOVEMENT BY TRUCKS IN METROPOLITAN NETWORKS: MODELING AND OPTIMIZATION , 2005 .

[18]  Walter Ukovich,et al.  Minimizing fleet operating costs for a container transportation company , 2006, Eur. J. Oper. Res..