Computer system for making efficiency analysis of meta-heuristic algorithms to solving nesting problem

  • Authors:
  • Pawel Bogalinski;Leszek Koszalka;Iwona Pozniak-Koszalka;Andrzej Kasprzak

  • Affiliations:
  • Dept. of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland;Dept. of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland;Dept. of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland;Dept. of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland

  • Venue:
  • ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.