Ant colony optimisation and local search for bin-packing and cutting stock problems

Tools

Levine, J and Ducatelle, F (2004) Ant colony optimisation and local search for bin-packing and cutting stock problems. Journal of the Operational Research Society, 55 (7). pp. 705-716. ISSN 0160-5682 (https://doi.org/10.1057/palgrave.jors.2601771)

[thumbnail of strathprints004823]
Preview
 Text. Filename: strathprints004823.pdf
Accepted Author Manuscript
Download (130kB)| Preview

Abstract

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO.

ORCID iDs

Levine, J ORCID logoORCID: https://orcid.org/0000-0001-7016-2978 and Ducatelle, F;
CORE (COnnecting REpositories)