View article

The classical one dimensional bin packing problem consists of a set of pieces, which must be packed into as few bins as possible. Each piece j has a weight wj, and each bin has capacity c. The objective is to minimise the number of bins used, where each piece is assigned to one bin only, and the weight of the pieces in each bin does not exceed c. To avoid large plateaus in the search space around the best solutions, we employ an alternative fitness function to the number of bins, which is explained in section 5. A mathematical formulation of the bin packing problem is shown in equation 1, taken from [1].