Computer Science and Information Technologies, Computer Science and Information Technologies 2010

Font Size: 
Optimization of Resources Usage for Technological Support of Cutting Processes
T. A. Panyukova, E. A. Savitskiy

Last modified: 2021-03-29


The cutting-packing problems are often considered in following two statements: "optimal placement ofdetails having definite form and size" and optimal cutting trajectory for defined placement of details-Both of these problems are the parts of cutting process technical part preprocessing. Nevertheless, the cutting problem is inverse in some ways for placement problem. As a rule these problems are not connected to each other. However, at projecting of cutting process we need consequenly solve both of them. This research is devoted mostly the second problem optimization and its connection with the first one. As for it, let's limit with short review and methods of its solution.


Optimization of Resources; Usage for Technological; Support of Cutting; Processes


1. Verkhoturov M. A., Tarasenko P.Yu. "MathematicalSupply for Optimization Problem of Cutter Path forPlane Figure Cutting on the Base of Circuit Cut-ting". In: Vestnik USATU, "Control, Hardware andComputer Science", Ufa, USATU, 2008, vol. 10,No. 2(27). pp. 123-130.

2. Petunin A. A. "About Some Heuristic Rules for Form-ing of Cutter Path for Thermal Cutting Machines Con-trol Programs". In: Vestnik USATU, "Control, Hard-ware and Computer Science". Ufa, Vestnik UGATU,2010.

3. Petrovic S., Qu R. Casc-Based Reasoning as a Heuris-tic Selector in a Hyper-Heuristic for Course Time-tabling. To appear in Proceedings of the Sinth Inter-national Conference on Knowledge-Based Intelli-gent&Engineering Systems (KES'2002). Crema, Italy.Sep. 2002.

4. Norenkov I. P. Heuristics and their Combinations forGenetic Methods of Discrete Optimization. Moscow,Information Technologies, 1999. No 1. pp. 2-7.

5. Waliakhmetova Yu.I., Filippova A.S. Multi-methodHenetic Algorithm for Solving of Problems of Or-thogonal Packing. Moscow, InformationTechnologies, 2007. No. 12(136). P.50-57.

6. Mukhacheva E. A., Mukhacheva A.S., Waleeva A.F.Kartak V.M. Methods of Local Optimum Searchingfor the Problems of Orthogonal Cutting and Packing:Analytic Review and Perspectives of Development.Moscow, Application to Journal on InformationTechnologies. - 2004. - P. 2-17.

7. Kartak V.M., Mesyagutov M.A., Mukhacheva E.A.,Filippova A.S. Local Search of Orthogonal Packingswith Use of Lower Boundaries. Moscow, Nauka.Automatics and Telemechanics. 2009. No 6. P.153-166.

8. Filippova A.S. Modelling of Evolution Algorithms forSollSolving the Problems of Rectangular Packing UsingBlock Structures. Moscow. Information Technologies.2006. No 6. 36 р.

9. Panyukova T. Chain sequences with ordered enclos-ing. Journal of Computer and System Sciences International, 2007, Vol. 46, No.1; 10. - pp. 83-92.

10. Panyukova T. Cover with Ordered Enclosing for FlatGraphs. Electronic Notes in Discrete Mathematics,2007, No. 28. - p.17-24.

11. Panyukova T.A., Software for Constructing of Chainswith Ordered Enclosing, Proc, of39-th Regional Con-ference on Problems of Theoretical and AppliedMathematics, IMM, Ural Branch of RAS, Yekaterin-burg, 2008. pp. 360 365.

12. Panyukova T.A., Savitskiy E.A. Composition of Inter-faces for Technological Preparation of Cutting Proc-esses. Proc. of 40-th Regional Conference on Prob-lems of Theoretical and Applied Mathematics, IMM,Ural Branch of RAS, Yekaterinburg, 2009. pp. 367-372.

Full Text: PDF