Applying evolutionary algorithms and the No Fit Polygon to the nesting problem

Citation

Burke E & Kendall G (1999) Applying evolutionary algorithms and the No Fit Polygon to the nesting problem. In: Arabnia H (ed.) Proceedings of the International Conference on Artificial Intelligence, IC-AI '99, June 28 - July 1, 1999, Las Vegas, Nevada, USA, Volume 1. International Conference on Artificial Intelligence, IC-AI '99, Las Vegas, NV, USA, 28.06.1999-01.07.1999. CSREA Press, pp. 51-57.

Abstract
In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with the results already obtained with SA. The evaluation method is described, along with a description of the NFP. Computational results are given.

Keywords
evolutionary; nesting; No Fit Polygon