Premium
A parallel hybrid local search algorithm for the container loading problem
Author(s) -
Mack D.,
Bortfeldt A.,
Gehring H.
Publication year - 2004
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2004.00474.x
Subject(s) - tabu search , simulated annealing , container (type theory) , metaheuristic , computer science , guided local search , hybrid algorithm (constraint satisfaction) , mathematical optimization , algorithm , local search (optimization) , search algorithm , mathematics , artificial intelligence , local consistency , mechanical engineering , probabilistic logic , engineering , constraint satisfaction
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.