[1]马 炫,张亚龙.基于遗传算法的大规模矩形件优化排样[J].智能系统学报,2007,2(5):48-52.
MA Xuan,ZHANG Ya-long.A genetic algorithm for the layout of large scale rectang ular parts[J].CAAI Transactions on Intelligent Systems,2007,2(5):48-52.
点击复制
《智能系统学报》[ISSN 1673-4785/CN 23-1538/TP] 卷:
2
期数:
2007年第5期
页码:
48-52
栏目:
学术论文—人工智能基础
出版日期:
2007-10-25
- Title:
-
A genetic algorithm for the layout of large scale rectang ular parts
- 文章编号:
-
1673-4785(2007)05-0048-05
- 作者:
-
马 炫,张亚龙
-
西安理工大学自动化与信息工程学院,陕西西安710048
- Author(s):
-
MA Xuan, ZHANG Ya-long
-
School of Automation and Information Engineering, Xi′an University of Technolog y, Xi′an 710048,China
-
- 关键词:
-
遗传算法; 矩形件排样; 组合优化
- Keywords:
-
genetic algorithm; rectangular parts layout; combinatorial optimization
- 分类号:
-
TP301
- 文献标志码:
-
A
- 摘要:
-
大规模矩形件优化排样是一个典型的组合优化问题,属于NPhard问题.实际工程中对一个排样方案一般有满足“一刀切”的工艺要求,“一刀切”要求增加了对排样的约束. 提出的优化算法,将矩形匹配分割算法作为遗传算法染色体的解码器实现一个排样方案,用遗传算法进行排样方案的全局搜索.算例比较表明,该算法可以求得满足 “一刀切”约束的最优解.
- Abstract:
-
The optimal layout of large scale rectangular parts is a combinatorial optimizat ion problem, a typical NPhard one. In practical engineering, quire cutting is o ften requested, which increases the constraints in the determination of a layout . To satisfy quire cutting requirements, in this paper, an optimization algorith m is proposed wherein a rectangular matching and segmentation algorithm is emplo yed as a decoder of chromosomes in a genetic algorithm to determine placement. A global optimal solution for placement can be achieved with this genetic algorit hm. Simulation results confirmed the validity of the proposed algorithm.
更新日期/Last Update:
2009-05-08