In this paper we consider the two-dimensional rectangular packing problem, where a fixed
set of items have to be allocated on a single object. Two heuristics, which belong to the class of
packing procedures that preserve bottom-left stability, are hybridised with three meta-heuristic
algorithms (genetic algorithms, simulated annealing, naïve evolution) and local search heuristic
(hill-climbing). This study compares the hybrid algorithms in terms of solution quality and
computation time on a number of packing problems of different size. In order to show the
effectiveness of the design of the different algorithms, their performance is compared to random
search and heuristic packing routines.