摘要
优化排样问题属于典型的非确定型NP问题,需要借助计算机辅助排样选出材料利用率最大化和排样下料效率最高的排样方案,以解决企业对排样的实际需求。讨论了单一矩形毛坯无约束剪切排样优化处理问题,基于剪切冲裁相结合的下料工艺、以条带数衡量排样方式的复杂性,应用递归算法通过枚举搜索法遍历所有可能的更优的排样方案,在保证毛坯数最优的前提下选出条带数最少的排样方案。实验计算结果表明所述算法有效。
Optimal layout problem is a typical non-deterministic NP problem that needs the help of Computer Aided Nesting to select the layout scheme with material utilization ratio maximization and cutting patterns efficiency highest.In order to solve the actual demand of enterprise to the layout,the optimization problem of unconstrained cutting patterns for single rectangular blank is discussed.Through the two stages of cutting and blanking stock,with the complexity of cutting patterns measured by the number of strips,using a recursive algorithm search by enumeration method to traverse layout for all possible better,on the premise of guarantee blank for optimal,we choose the layout scheme of the minimum number strip.The calculation results show that the algorithm is effective.
作者
李海生
LI Haisheng(College of Physics and Electronic Engineering, Guangxi Normal University for Nationalities, Chongzuo 532200, Chin)
出处
《重庆理工大学学报（自然科学）》
CAS
2017年第9期125-131,共7页
Journal of Chongqing University of Technology：Natural Science
基金
国家自然科学基金资助项目(61363026)
广西民族师范学院校级科研项目(2016YB037)
关键词
计算机辅助
递归算法
优化排样
矩形毛坯
computer-aided
recursive algorithm
optimal layout
rectangle blanks
