A model for a multi-size inland container transportation problem

In the multi-size Inland Container Transportation Problem (mICT) trucks are able to transport up to two 20-foot or one 40-foot container at a time along routes with various pickup and delivery locations. A mixed-integer linear program for the mICT is presented using two alternative objective functions: minimization of the total travel distance and minimization of the total operation time of the trucks. The presented model is tested on instances which vary in size. Computational experiments show that by means of the presented model small problem instances can be solved optimally.

[1]  Milorad Vidovic,et al.  Vehicle Routing in Containers Pickup Up and Delivery Processes , 2011 .

[2]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[3]  Rob A. Zuidwijk,et al.  MIPLIB Truckload PDPTW Instances Derived from a Real-World Drayage Case , 2010 .

[4]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

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

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

[7]  Herbert Kopfer,et al.  Container Flows and Truck Routes in Inland Container Transportation , 2014, LDIC.

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

[9]  Herbert Kopfer,et al.  A Neighborhood Search for a Multi-size Container Transportation Problem , 2015 .

[10]  Ruiyou Zhang,et al.  Multi-size container transportation by truck: modeling and optimization , 2015 .

[11]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[12]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[13]  Jörn Schönberger,et al.  A Model for the Coordination of 20-foot and 40-foot Container Movements in the Hinterland of a Container Terminal , 2013, ICCL.

[14]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[15]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[16]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[17]  Teodor Gabriel Crainic,et al.  An heuristic search for the routing of heterogeneous trucks with single and double container loads , 2013 .

[18]  Alan L. Erera,et al.  Intermodal Drayage Routing and Scheduling , 2008 .

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

[20]  Petros A. Ioannou,et al.  Port dynamic empty container reuse , 2006 .

[21]  Hark Hwang,et al.  Development of mathematical models for the container road transportation in Korean trucking industries , 2007, Comput. Ind. Eng..

[22]  Rob Konings,et al.  Foldable Containers to Reduce the Costs of Empty Transport? A Cost–Benefit Analysis from a Chain and Multi-Actor Perspective , 2005 .

[23]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[24]  Herbert Kopfer,et al.  A Tabu Search Heuristic for the Inland Container Transportation Problem , 2013, Comput. Oper. Res..

[25]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[27]  Gerrit K. Janssens,et al.  Challenges in Managing Empty Container Movements at Multiple Planning Levels , 2011 .

[28]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

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

[30]  Milorad Vidovic,et al.  The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows , 2014 .

[31]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[32]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[33]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[34]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

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

[36]  Ruiyou Zhang,et al.  Modeling and optimization of a container drayage problem with resource constraints , 2011 .

[37]  Erwin Pesch,et al.  A truck scheduling problem arising in intermodal container transportation , 2013, Eur. J. Oper. Res..

[38]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[39]  M. Grötschel,et al.  Schnelle Rundreisen: Das Travelling-Salesman-Problem , 2007 .

[40]  M. Horst,et al.  Coordination in Hinterland Transport Chains: A Major Challenge for the Seaport Community , 2008 .

[41]  Frank Meisel,et al.  Workforce routing and scheduling for electricity network maintenance with downtime minimization , 2013, Eur. J. Oper. Res..

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

[43]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[44]  Won Young Yun,et al.  Reducing hinterland transportation costs through container sharing , 2015 .

[45]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

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

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

[48]  Jean-Paul Rodrigue,et al.  Port regionalization: towards a new phase in port development , 2005 .

[49]  Milorad Vidovi´c,et al.  Two mathematical formulations for the containers drayage problem with time windows , 2012 .