| One dimensional cutting stock problem is categorized as a class of important and typical design tasks, which has been widely used in various industries, so that its solution methodology and techniques are important not only to itself, but also to other design problems. It is one of the considerably complicated scheduling problems due to its NP-completeness. The fundamental issue lies in how to find the best corresponding relations between different factors such as Stock lengths, Stock supply, Piece lengths and Piece order demands. In order to satisfy so many constraints, the problem results in an extremely large number of solution sets. Hence one can hardly find absolutely satisfying solutions when dealing this problem in the field of Project Research.Through general models and algorithms comparison the combination method of linear programming and integer programming is adopted to this total material cost minimization construct solution models. A search tree is used to develop the pattern generation method and the MATLAB C++ Math Library & Branch and Bound Technique are utilized to get the optimization result. The one dimensional optimum cutting system based on this architecture has been implemented and tested on a Windows OS based workstation. 2-D and 3-D cutting stock problems are discussed in addition.Software developed using Visual C++ is easy of operation with a friendly and convenient user interface, in which functions as optimum cutting, surplus materials management, standard slitter knife parameters query, stocks and pieces' data management are involved. Researches in this dissertation will contribute to economize raw materials, reduce operating costs and improve the enterprise' s economic efficiency.
|
PDF Full Text Request