机械与电子2024，Vol.42Issue(3)：12-16,25,6.
基于贪心混合定位算法三阶段排样问题研究
Research on Three-stage Nesting Problem Based on Greedy Hybrid Positioning Algorithm
摘要
Abstract
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.关键词
三阶段排样/混合整数规划模型/贪心混合定位算法Key words
three stages nesting/mixed integer programming model/greedy hybrid positioning algorithm分类
信息技术与安全科学引用本文复制引用
陈烨烨,李捍东..基于贪心混合定位算法三阶段排样问题研究[J].机械与电子,2024,42(3):12-16,25,6.基金项目
国家自然科学基金资助项目(52167007) （52167007）
