Using a tabu search approach for solving the two-dimensional irregular cutting problem
Annals of Operations Research - Special issue on Tabu search
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
A Knowledge Based System for Minimum Rectangle Nesting
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Evolutionary Algorithm for Solving Congestion Problem in Computer Networks
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Hi-index | 0.00 |
The paper concerns the strip nesting problem. This kind of problems is NP-hard even fort rectangular shapes and plate with no rotation allowed. In this paper computer system for making efficiency comparison of heuristic algorithms is proposed. The evaluation of tabu search, ACO and simulated annealing algorithms with raster approach to the geometry of problem is described. The evaluation was made on the basis of the results of simulations made using the experimentation system designed and implemented by authors.