Comparison of meta-heuristic algorithms for clustering rectangles

Authors
Burke, E Kendall, G
Citation
E. Burke et G. Kendall, Comparison of meta-heuristic algorithms for clustering rectangles, COM IND ENG, 37(1-2), 1999, pp. 383-386
Citations number
4
Categorie Soggetti
Engineering Management /General
Journal title
COMPUTERS & INDUSTRIAL ENGINEERING
ISSN journal
03608352 → ACNP
Volume
37
Issue
1-2
Year of publication
1999
Pages
383 - 386
Database
ISI
SICI code
0360-8352(199910)37:1-2<383:COMAFC>2.0.ZU;2-4
Abstract
In this paper we consider a simplified version of the stock cutting (two-di mensional bin packing;) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) wh en applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the gene tic algorithm. The problem, and its representation is fully described along with key test results. (C) 1999 Elsevier Science Ltd. All rights reserved.