摘要
利用遗传算法结合剩余矩形排样法求解矩形件正交排样问题。通过遗传算法将矩形件正交排样问题转化为一个排列问题,并引入剩余矩形排样算法来惟一确定每一个排列所对应的排样图(即排样方案),两者结合用于求解矩形件排样问题。最后用此混合遗传算法对文献[1]中的两个算例进行了验证,表明了其有效性。
The genetic algorithm and the surplus rectangle algorithm are used for solving the orthogonal packing problem of rectangles in this paper. First, the rectangles packing problem is turned into a permutation problem. Second, a surplus rectangle algorithm is introduced to decode the permutation of rectangles to the corresponding packing pattern uniquely. Thus, a new hybrid genetic algorithm is formed to solve this packing problem. At the end of this paper, the new genetic algorithm is validated by two examples, and the fact shows that the new algorithm presented by this paper is efficacious.
出处
《计算机技术与发展》
2006年第6期219-221,共3页
Computer Technology and Development
关键词
正交排样
排样方案
剩余矩形
遗传算法
orthngonal paeking,paeking pattern
surplus rectangle
genetic algorithm
