Research on Three-stage Nesting Problem Based on Greedy Hybrid Positioning Algorithm
A three-stage layout optimization method based on greedy hybrid positioning algorithm was proposed to solve the utilization problem of three-stage layout.Taking the utilization rate of sheet metal as the optimization objective,firstly,a constrained mixed integer programming model is established to segment the three-stage layout problem;secondly,the plate is divided into three partitions and the in-put sequence is sorted and optimized by greedy algorithm;finally,a hybrid positioning algorithm is used to find the optimal plate placement partition for the candidate rectangular parts.Four sets of plate data with a data scale of 3 000 rectangular pieces are used to verify the results.The results show that the proposed model has higher plate utilization and shorter running time than other algorithms.
three stages nestingmixed integer programming modelgreedy hybrid positioning algorithm
国家科技期刊平台
NSTL
万方数据
