Comparison of meta-heuristic algorithms for clustering rectangles

✍ Scribed by Edmund Burke; Graham Kendall

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 258 KB
• Volume: 37
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(99)00099-6

✦ Synopsis

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The problem, and its representation, is fully described along with key test results.