Title: Development of Optimization Software to Solve Practical Packing and Cutting Problems
Abstract: The paper describes a developed optimization software intended to solve various practical problems of recourse allocation.In a basis of the software lays a designed class library for solving different recourse allocation problems including packing and cutting problems.Due to belonging of all packing problems to the class of NP-completed problems they cannot be solved in polynomial time depending on their size.To solve such problems are usually used metaheuristic algorithms of multicriteria optimization.The designed class library allows to solve all packing and problems using a variety of metaheuristic algorithms which makes the developed software universal with respect to types of solved problems and algorithms used.