[1]韩喜君 丁根宏.矩形件优化排样问题的混合遗传算法求解[J].计算机技术与发展,2006,(06):219-221.
HAN Xi-jun,DING Gen-hong.Solving the Packing Problem of Rectangles with Hybrid Genetic Algorithm[J].,2006,(06):219-221.
点击复制
矩形件优化排样问题的混合遗传算法求解(
)
《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]
- 卷:
-
- 期数:
-
2006年06期
- 页码:
-
219-221
- 栏目:
-
智能、算法、系统工程
- 出版日期:
-
1900-01-01
文章信息/Info
- Title:
-
Solving the Packing Problem of Rectangles with Hybrid Genetic Algorithm
- 文章编号:
-
1673-629X（2006）06-0219-03
- 作者:
-
韩喜君 丁根宏
-
河海大学理学院
- Author(s):
-
HAN Xi-jun; DING Gen-hong
-
College of Sciences, Hohai University
-
- 关键词:
-
正交排样; 排样方案; 剩余矩形; 遗传算法
- Keywords:
-
orthngonal paeking; paeking pattern; surplus rectangle; genetic algorithm
- 分类号:
-
O224 TP301.6
- 文献标志码:
-
A
- 摘要:
-
利用遗传算法结合剩余矩形排样法求解矩形件正交排样问题。通过遗传算法将矩形件正交排样问题转化为一个排列问题，并引人剩余矩形排样算法来惟一确定每一个排列所对应的排样图（即排样方案），两者结合用于求解矩形件排样问题。最后用此混合遗传算法对文献[1]中的两个算例进行了验证，表明了其有效性
- Abstract:
-
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
备注/Memo
- 备注/Memo:
-
韩喜君（1981-），女，江苏常熟人，硕士研究生，研究方向为优化与控制；丁根宏，副教授，主要从事运筹学方面的研究
更新日期/Last Update:
1900-01-01