|標題:||Sequential quadratic programming method with a global search strategy on the cutting-stock problem with rotatable polygons|
|作者:||Yu, M. T.|
Lin, T. Y.
Department of Mechanical Engineering
|關鍵字:||Cutting-stock problem;Material saving;Rotatable;Sequential quadratic programming;Global optimization|
|摘要:||The cutting-stock problem, which considers how to arrange the component profiles on the material without overlaps, can increase the utility rate of the sheet stock. It is thus a standard constrained optimization problem. In some applications the components should be placed with specific orientations, but in others the components may be placed with any orientation. In general, the methods used to solve the cutting-stock problem usually have global search strategies to improve the solution, such as the Genetic Algorithm and the Simulated Annealing Algorithm. Unfortunately, many parameters, such as the temperature and the cooling rate of the Simulated Annealing method and the mutation rate of the Genetic Algorithm, have to be set and different settings of these parameters will strongly affect the result. This study formulates the cutting-stock problem as an optimization problem and solves it by the SQP method. The proposed method will make it easy to consider different orientations of components. This study also presents a global search strategy for which the parameter setting is easy.|
|期刊:||JOURNAL OF INTELLIGENT MANUFACTURING|