Comparison of MetaHeuristic Algorithms for Clustering Rectangles

@inproceedings{Burke1998ComparisonOM,
  title={Comparison of MetaHeuristic Algorithms for Clustering Rectangles},
  author={Edmund K. Burke and Graham Kendall},
  year={1998}
}
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. 
6 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Optimal Blank Nesting Using Simulated Anneal

  • P. Jain, P. Fenyes, R. Richter
  • 1992

Optimal Blank Nesting Using Simulated Annealing

  • P. Jain, P. Fenyes, R. Richter
  • Trans . of ASME
  • 1992

Similar Papers

Loading similar papers…