A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

  • Authors:
  • E. Hopper;B. C. H. Turton

  • Affiliations:
  • Cardiff University, School of Engineering, PO Box 689, Cardiff CF24 3TF, UK E-mail: HopperE@gmx.net;Cardiff University, School of Engineering, PO Box 689, Cardiff CF24 3TF, UK E-mail: Turton@cf.ac.uk

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.