Comparison of meta-heuristic algorithms
β
Edmund Burke; Graham Kendall
π
Article
π
1999
π
Elsevier Science
π
English
β 258 KB
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