A reactive tabu search algorithm for the multi-depot container truck transportation problem

A container truck transportation problem that involves multiple depots with time windows at both origins and destinations, including the reposition of empty containers, is formulated as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. Since the problem is NP-hard, a cluster method and a reactive tabu search (RTS) algorithm are developed to solve the problem. The two methods are compared with the mixed integer program which can be used to find optimum solutions for small size problems. The computational results show that the developed methods, particularly the RTS algorithm, can be efficiently used to solve the problem.

[1]  Warren B. Powell,et al.  An attribute–decision model for cross-border drayage problem , 2008 .

[2]  Andrea Fusiello,et al.  Automatic selection of MRF control parameters by reactive tabu search , 2007, Image Vis. Comput..

[3]  Jose Roberto Sanches Mantovani,et al.  Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm , 2008 .

[4]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[5]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

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

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

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

[9]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[10]  Alan L. Erera,et al.  Planning local container drayage operations given a port access appointment system , 2008 .

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

[12]  Won Young Yun,et al.  A simulation model for container-terminal operation analysis using an object-oriented approach , 1999 .

[13]  Akio Imai,et al.  The container shipping network design problem with empty container repositioning , 2007 .

[14]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[15]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

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

[18]  Chaug-Ing Hsu,et al.  Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network , 2007, Math. Comput. Model..

[19]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[20]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

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