| Cutting stock is an indispensable and very important part of industrial production,and also plays an important role in cost-cutting plan of manufacturing industry companies.At present,classical cutting stock problems have been studied and explored in depth for a long time.However,few researches are aiming at many unsolved practical cutting stock problems.Study focus on these problems can improve competitiveness of companies further,reduce resources and fill the research gap.Problem with sequence-dependent cut losses is a particular one-dimensional cutting stock problem abstracted from specific wood industrial applications.This problem is arranging a number of trapezoid items with the same height which would be cut from larger stocks of a certain length.It's can be simplified to a one-dimensional cutting stock problem,while the pattern's quality is related to the sequence of items.The sequential value correction frame could be used to find the optimal or better practical solution in shorter time than other cutting stock algorithms,and optimize direct at the particular requires easily.This paper including:(1)For a particular one-dimensional cutting stock problem abstracted from specific wood industrial applications,an algorithm based on sequential value correction proposed with considering minimize stock material waste and the problem's special properties.The cutting patterns were generated sequentially after defining and getting the cost between each two items,and then got a cutting plan make up by these patterns.Produced many different cutting plans by continue correcting the value of items,and chose the best one to approach optimal solution.By calculating the experiment data and comparing with published algorithms,the results show that the proposed cutting plan generating approach can get less consumption of raw material and low computation time.(2)Introduce the open stacks reducing problem research for physical condition of these wood industrial applications.Try graph-based heuristic search algorithm and directly restrict number of item types in a pattern to reduce the maximum number of open stacks of a cutting plan.Compare the two open stacks optimizing methods and the combine of these methods on instances datasets of problem with sequence-dependent cut losses.The results show that each method can reduce maximum open stacks to some degree in short time,but the item types restricting method would sacrifice the stock utilization.(3)Realize the algorithms on computer.Prove their validity by calculating test,comparing and analyzing. |
