A parallel hybrid local search algorithm for the container loading problem |
| |
Authors: | D Mack A Bortfeldt H Gehring |
| |
Affiliation: | Chair of Information Systems, University of Hagen, Germany |
| |
Abstract: | In this contribution, a parallel hybrid local search algorithm for the three‐dimensional container loading problem (CLP) is proposed. First a simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic. Finally, parallel versions are introduced for these algorithms. The emphasis is on CLP instances with a weakly heterogeneous load. Numerical tests based on the well‐known 700 test instances from Bischoff and Ratcliff are performed, and the outcome is compared with methods from other authors. The results show a high solution quality obtained with reasonable computing time. |
| |
Keywords: | cutting and packing container loading problem local search metaheuristic simulated annealing tabu search hybrid algorithm distributed-parallel search |
|