The two-dimensional irregular cutting stock problem: optimization allocation and path of cutting instrument

Abstract

Thispaper regardsthe problem ofthe two-dimensional irregular cutting stock problem (ICSP). Its solution consists of several stages, from which most complex are those, that concerning to optimization geometric modeling problems: nesting of geometric objects in determined areas and generation of path of cutting instrument. For their solution were developed: the class of hodograph-oriented algorithms, using metaheuristic methods of local search — HO-MH (Hodograph Oriented MetaHeuristics) and modification of GRASP algorithm (Greedy Randomized Adaptive Search Procedure). The algorithms are included. The structure of computer cutting system is considered. The numerical experiment is described.