A parallel multi-population biased random-key genetic algorithm for a container loading problem
Computers and Operations Research
| Hi-index | 0.00 |
An optimal loading in multiple containers and pallets is considered. In this paper, a strategic search method using meta-heuristics and strategic procedure is proposed. This method gives the loading sequence of packages and selection sequence of containers and pallets to utilize them. The meta-heuristics determines the sequence of packages, and the strategic procedure determines the sequence of containers and pallets with reference to search process. Therefore, this method is realized to find optimal sequences. The effectiveness of the proposed method is compared with other methods, such as local search and simulated annealing. The experimental results show that the present method is superior to other methods.