Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling.

We consider the famous bin packing problem where a set of items must be stored in bins of equal capacity. In the classical version, the objective is to minimize the number of bins used. Motivated by ...

J. Levine, F. Ducatelle, Ant Colony Optimization and Local Search for Bin Packing and Cutting Stock Problems, The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local ...