摘要
提出了一种面向矩形坐标关系约束的遗传算法解决传统方法中随着排样矩形种类增多利用率开始降低的问题,可以满足一块大板材上能够裁出更多种类小矩形的要求,同时板材利用率更高。采用文中提出的方法进行排样所达到的矩形利用率为92%以上,且运算时间均在10 s以内。最后在VC++环境中开发出了系统验证排样方案的可行性。
The genetic algorithm based on rectangle coordinate constraint was proposed to solve the problem that the utilization starts to decrease with the increasing types of packing rectangles in tradi?tional method.It can meet the requirement of cutting more category small rectangle on a large rectangle material and its utilization is also higher than traditional method.The utilization of rectangular packing reached more than 92%with the method proposed in this paper,and the operation time is within 10 s.Finally,a rectangle packing system was developed in Visual C++environment to demonstrate the feasi?bility of the packing method.
作者
曹忠园
周学良
Cao Zhongyuan;Zhou Xueliang(School of Mechanical Engineering,Hubei University of Automotive Technology,Shiyan 442002,China)
出处
《湖北汽车工业学院学报》
2019年第3期58-61,71,共5页
Journal of Hubei University Of Automotive Technology
基金
湖北省自然科学基金(2016CFB402)
湖北汽车工业学院博士科研启动基金(BK201601)
关键词
矩形件
排样
坐标约束
遗传算法
系统开发
rectangular
packing
coordinate constraint
genetic algorithm
system development
