Model and algorithm of multi-depot container truck transportation with time windows

A multi-depot container truck transportation problem with time windows is studied in this paper. Two types of transportation resources as trucks and containers and four types of container movements as inbound/outbound full and inbound/outbound empty movements are considered. The problem is formulated as a graph and then mathematically modeled as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. A reactive tabu search (RTS) algorithm is developed and tested based on a number of randomly generated examples. The results compared with the commercial tool CPLEX indicate that the RTS algorithm can find the optimum solutions of small-sized examples in short time. Furthermore, the algorithm is robust and stable to solve large-sized example.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[15]  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..

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

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

[18]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

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

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

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