Metal Strip Cutting Algorithm And System Development Considering Surface Defects

With the continuous improvement of the level of global industrialization,the competition faced by steel companies has become more intense.Reducing production costs,improving production management and customer service levels are inevitable trends in the development of steel companies.In order to improve the product yield rate,reduce the inventory level,and then reduce the production cost and improve the customer service level,this thesis studies the metal strip cutting algorithm considering the surface defects and develops the optimization system.The main work is as follows:(1)The relevant theories and research status of metal strip cutting are reviewed.The problem is solved in two stages.The first stage solves the problem of cutting with defective metal strips with the highest product value,and the second stage solves the problem of variable size two-dimensional packing.(2)For the problem of cutting the defective metal strip with the maximum product value,the improved enumeration method and dynamic programming method are used to solve the problem.Among them,the improved enumeration method has made some improvements to reduce the search space and reduce the time complexity,but still can not solve large-scale problems in a limited time.The dynamic programming method can give the optimal solution in a short time,with good effect and strong usability.(3)For the two-dimensional packing problem of variable size,a hybrid heuristic algorithm is designed to solve.Although the algorithm cannot solve the optimal solution,it can solve a higher quality solution in a short time.Finally,the effectiveness of the algorithm is proved by experiments.(4)Based on the above algorithm,a metal strip optimized cutting system was designed and developed.The system interface uses Qt as the foreground,Oracle as the database,and the background algorithm through C++.It realizes three functions of data maintenance,solution solving and visual display.