A Tabu Search Algorithm for a Routing and Container Loading Problem

This article considers a combination of capacitated vehicle routing and three-dimensional loading, with additional constraints frequently encountered in freight transportation. It proposes a tabu search algorithm that iteratively invokes an inner tabu search procedure for the solution of the loading subproblem. The algorithm is experimentally evaluated both on instances adapted from vehicle routing instances from the literature and on new real-world instances.

[1]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[2]  Rajasooriyar Partheepan.  Hybrid Genetic Algorithms , 2004 .

[3]  Gregory Levitin,et al.  Optimal routing of multiple-load AGV subject to LIFO loading constraints , 2003, Comput. Oper. Res..

[4]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[5]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[6]  Daniele Vigo,et al.  Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..

[7]  Andrea Lodi,et al.  Multi-Dimensional Packing by Tabu Search , 2002, Stud. Inform. Univ..

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

[9]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[10]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

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

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

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

[14]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[15]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[16]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[17]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[18]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[19]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[20]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[21]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[22]  Michel Gendreau,et al.  Solving the hub location problem in a star–star network , 2008 .