A hybrid simulated annealing algorithm for container loading problem

Authors:
Yu Peng;Defu Zhang;Francis Y.L. Chin
Affiliations:
Xiamen University, 361005, Xiamen, China;Xiamen University, Xiamen, China;University of Hong Kong, Hong Kong, Hong Kong
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 2
Cited 0

A parallel tabu search algorithm for solving the container loading problem

Parallel Computing - Special issue: Parallel computing in logistics
A least wasted first heuristic algorithm for the rectangular packing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a hybrid simulated annealing algorithm for container loading problem with boxes of different sizes and single container for loading. A basic heuristic algorithm is introduced to generate feasible solution from a special structure called packing sequence. The hybrid algorithm uses basic heuristic to encode feasible packing solution as packing sequence, and searches in the encoding space to find an approximated optimal solution. The computational experiments on 700 weakly heterogeneous benchmark show that our algorithm outperforms all previous methods in average.