A Study On The One-dimensional Cutting Stock Problem With Stocks Of Many Models And Variable-section Based On Multilevel Heuristic

Cutting stock problem can be found in various manufacturing. In order to increase profit and advance competition, how to make the rate of using raw materials most as well as the loss is the least, is the problem of each manufacturing enterprise attend.After summarize the basic conception, sort and actuality of research of cutting stock problem, some classical arithmetic to settle one-dimensional cutting stock problem and their deficiency are introduced.Then, One-dimensional cutting stock problem with stocks of many models and variable-section is abstracted according to actual production of some enterprises. Depending on deeply study, the model of cutting stock optimization which considering cutter slit is upbuilt, and a multi-level grouping heuristic algorithm is proposed to solve the optimization problem combining the characteristics of the problem. A example of cutting stock in a tyre manufacturer is presented, through computing which, we can get satisfying near-optimal solution in acceptable time complexity by the new algorithm. Basing on the new algorithm, the decision-making system of optimization of cutting stock has been used in the enterprise, which making a good effect of saving material.