Research On Optimized Cutting Algorithms For Machinability

The Cutting Stock Problem(CSP)is an NP-complete problem with the highest complexity,which has a wide range of engineering practical application background.Such as in the vehicle,leather,paper,machinery,furniture,glass,ships and other manufacturing industries are widely used in the cutting stock problem.As a big manufacturing country,China needs to consume a lot of raw materials to manufacture various products every year.Improving material utilization,optimizing cutting paths and shortening calculation time are the most direct and effective ways to reduce production costs.An efficient cutting algorithm can not only effectively improve the material utilization rate,optimize the cutting path,shorten the life cycle of the product,but also improve the enterprise’s competitiveness and economic benefits.Therefore,an efficient cutting algorithm has become a vital topic.Considering to improve the material utilization rate and simplify the cutting path,this thesis discusses the one and a half dimensional and two-dimensional cutting stock problem from the manufacturing industry.The main research contents include:(1)Aiming at the one and a half dimensional silicon steel sheets optimization cutting stock problem,an integer programming optimization model with the minimize sum of material and production costs as optimization was established,then a cutting algorithm based on leftover utilization sequential correction was proposed to solve the model.Aimed at the demand for silicon steel sheet of enterprises is not many and long-term repeated characteristics,a strategy considering the generation and utilization of the available leftovers at the same time is put forward to avoid the overstock by limiting total number and types of leftovers.The experimental results show that the proposed algorithm can effectively reduce the total consumption cost and improve the economic benefit of the enterprise under the premise of ensuring the reasonable running time.(2)Aiming at the two-dimensional rectangular parts optimization cutting stock problem,a mathematical model with the minimum sum of material and cutting costs as the optimization objective was established,then an optimal cutting algorithm considering rectangular parts homogeneous blocks was proposed to solve the model.The sequential value correction(SVC)algorithm was combined with the recursive algorithm to determine cutting plan.Generate various cutting plans through multiple iterations,then select the lowest total cost one as the solution of the problem.After each type of cutting pattern was generated,the value of the rectangular parts appearing in the current pattern was corrected once to make its value close to the ideal value.Each pattern meets the requirements of some rectangular parts,and the process was repeated until all rectangular parts were met.In addition,given the common edge cutting strategy between strips within homogeneous blocks and rectangular parts within strips,the cutting path can be reduced as much as possible.The experimental results show that the proposed algorithm can effectively reduce the cutting path length while ensuring high material utilization.