A parallel tabu search algorithm for solving the container loading problem

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Issues in designing parallel and distributed search algorithms for discrete optimization problems, Publication CRT-96-36, Centre de recherche sur les transports, Universitede Montreal, Canada, 1996] i.e., several search paths are investigated concurrently. The parallel searches are carried out by differently configured instances of a tabu search algorithm, which cooperate by the exchange of (best) solutions at the end of defined search phases. The parallel search processes are executed on a corresponding number of LAN workstations. The efficiency of the parallel tabu search algorithm is demonstrated by an extensive comparative test including well-known reference problems and loading procedures from other authors.

[1]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[2]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[3]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[4]  Michel Gendreau,et al.  Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements , 1995 .

[5]  Hermann Gehring,et al.  Ein verteilt-paralleles Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat , 1999 .

[6]  Peter Kall,et al.  Operations Research Proceedings 1998 , 1999 .

[7]  Reinaldo Morabito,et al.  An AND/OR-graph Approach to the Container Loading Problem , 1994 .

[8]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

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

[10]  Guntram Scheithauer.  Algorithms for the Container Loading Problem , 1992 .

[11]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[12]  Bryan Kok Ann Ngoi,et al.  Applying spatial representation techniques to the container packing problem , 1994 .

[13]  Jörg Homberger,et al.  A parallel two-phase metaheuristic for routing problems with time windows , 2001 .

[14]  Hermann Gehring,et al.  Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat , 1997 .

[15]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[16]  M.S.W. Ratcliff,et al.  Loading pallets with non-identical items , 1995 .

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

[18]  Hermann Gehring,et al.  A Parallel Genetic Algorithm for Solving the Container Loading Problem , 2002 .

[19]  Andreas Bortfeldt.  Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen , 1995 .

[20]  Andreas Bortfeldt,et al.  A tabu search algorithm for weakly heterogeneous container loading problems , 1998 .

[21]  Gerhard Wäscher,et al.  Cutting and packing , 1995, Eur. J. Oper. Res..

[22]  Wolfgang Gaul,et al.  Operations Research Proceedings 1991 , 1992 .