A parallel tabu search algorithm for solving the container loading problem

✍ Scribed by A Bortfeldt; H Gehring; D Mack

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 241 KB
• Volume: 29
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(03)00047-4

✦ Synopsis

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, Universit e ede Montr e eal, 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.