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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145–159.
Martello S and Toth P (1990). Knapsack Problems, Algorithms and Computer Implementations. John Wiley and Sons Ltd: England.
Haessler RW and Sweeney PE (1991). Cutting stock problems and solution procedures. Eur Journal Opl Res 54: 141–150.
Falkenauer E (1996). A hybrid grouping genetic algorithm for bin packing. J Heuristics 2: 5–30.
Hinterding R and Khan L (1995). Genetic algorithms for cutting stock problems: with and without contiguity. In: Yao X (ed). Progress in Evolutionary Computation. Springer: Berlin, Germany, pp 166–186.
Reeves C (1996). Hybrid genetic algorithms for bin-packing and related problems. Ann Oper Res 63: 371–396.
Vink M (1997). Solving combinatorial problems using evolutionary algorithms. Available from http://citeseer.nj.nec.com/vink97solvinghtml.
Liang K-H, Yao X, Newton C and Hoffman D (2002). A new evolutionary approach to cutting stock problems with and without contiguity. Comput Oper Res 29: 1641–1659.
Dorigo M, Maniezzo V and Colorni A (1996). The ant system: Optimization by a colony of cooperating agents. IEEE T Syst Man Cy B 26: 29–41.
Bonabeau E, Dorigo M and Theraulez G (1999). Swarm Intelligence: From Natural to Artificial Intelligence. Oxford University Press, Inc.: New York, NY, USA.
Dorigo M and Stützle T (2002). The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover F and Kochenberger G (eds). Handbook of Metaheuristics. Kluwer Academic Publishers, Norwell, MA, USA, pp 251–285.
Bilchev G (1996). Evolutionary metaphors for the bin packing problem. In: Fogel L, Angeline P and Bäck T (eds). Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming. MIT Press, Cambridge, MA, USA, pp 333–341.
Bischoff EE and Wäscher G (1995). Cutting and packing. Eur J Opl Res 84: 503–505.
Coffman EG, Garey MR and Johnson DS (1996). Approximation algorithms for bin packing: a survey. In: Hockbaum D (ed). Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA, USA, pp 46–93.
Gilmore PC and Gomory RE (1961). A linear programming approach to the cutting stock problem. Oper Res 9: 848–859.
Winston WL (1993). Operations Research: Applications and Algorithms. International Thompson Publishing: Belmont, CA, USA.
Falkenauer E and Delchambre A (1992). A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 International Conference on Robotics and Automation. IEEE Press, Piscataway, NJ, USA, pp 1186–1192.
Dorigo M and Gambardella L (1997). Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE T Evolut Comput 1: 53–66.
Stützle T and Hoos H (2000). MAX-MIN ant system. Future Gener Comp Sys 16: 889–914.
Maniezzo V, Colorni A and Dorigo M (1994). The ant system applied to the quadratic assignment problem. Technical Report, IRIDIA, Universit é Libre de Bruxelles, Brussels, Belgium.
Gambardella L, Taillard E and Dorigo M (1999). Ant colonies for the quadratic assignment problem. J Opl Res Soc 50: 167–176.
Bauer A, Bullnheimer B, Hartl R and Strauss C (1999). An ant colony optimization approach for the single machine total tardiness problem. In: Proceedings of the 1999 Congress on Evolutionary Computation. IEEE Press, Piscataway, NJ, USA, pp 1445–1450.
Stützle T (1998). An ant approach to the flow shop problem. In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing. Verlag Mainz, Aachen, Germany, pp 1560–1564.
Gambardella L, Taillard E and Agazzi G (1999). MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M and Glover F (eds). New Ideas in Optimization. McGraw-Hill, London, UK, pp 63–76.
Costa D and Hertz A (1997). Ants can colour graphs. J Opl Res Soc 48: 295–305.
Michel R and Middendorf M (1999). An ACO algorithm for the shortest supersequence problem. In: Corne D, Dorigo M and Glover F (eds). New Ideas in Optimization. McGraw-Hill, London, UK, pp 51–61.
Leguizamon G and Michalewicz Z (1999). A new version of ant system for subset problems. In: Proceedings of the 1999 Congress of Evolutionary Computation. IEEE Press, Piscataway, NJ, USA, pp 1459–1464.
Alvim A, Glover F, Ribeiro C and Aloise D (1999). Local search for the bin packing problem. Available from http://citeseer.nj.nec.com/alvim99local.html.
Scholl A, Klein R and Jürgens C (1997). BISON: a fast procedure for exactly solving the one-dimensional bin packing problem. Comput Oper Res 24: 627–645 Test problems available from http://www.bwl.tudarmstadt.de/bw13/forsch/projekte/binpp.
Gent I (1997). Heuristic solution of open bin packing problems. J Heuristics 3: 299–304.
Alvim A, Glover F, Ribeiro C and Aloise D (2002). A hybrid improvement heuristic for the bin packing problem. Available from http://citeseer.nj.nec.com/557429.html.
Fleszar K and Hindi K (2002). New heuristics for one-dimensional bin-packing. Comput Oper Res 29: 821–839.
Acknowledgements
We would like to thank Ko-Hsin Liang and Xin Yao for sharing their results with us. We would also like to thank Thomas Stützle, Gianni di Caro and Luca Gambardella for useful feedback on this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Levine, J., Ducatelle, F. Ant colony optimization and local search for bin packing and cutting stock problems. J Oper Res Soc 55, 705–716 (2004). https://doi.org/10.1057/palgrave.jors.2601771
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601771