Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem

@inproceedings{Burke1999ApplyingAA,
  title={Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem},
  author={Edmund K. Burke and Graham Kendall},
  booktitle={Australian Joint Conference on Artificial Intelligence},
  year={1999}
}
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant algorithm) is developed and the results from this algorithm are compared against SA, TS and GA. We… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 6 times over the past 90 days. VIEW TWEETS
17 Citations
24 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…