跳到主要导航 跳到搜索 跳到主要内容

Mutation ant colony algorithms of constrained two-dimensional guillotine cutting problems

  • Shandong University of Finance and Economics

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

The two-dimensional cutting problem plays an important role in many goods production processes. The two-dimensional cutting problem addressed in this paper consists of cutting a large rectangular plate into a number of stripes which are then cut to obtain ordered smaller rectangles. Its objective is to maximize the total area used and the numbers of ordered pieces are limited to specified numbers. To obtain ant colony algorithm for this problem, an order-cutting method is given and solving this problem is translated to searching an optimal machining order by order-cutting method. Then an ant colony algorithm and its improving algorithm with mutation operator and reproduction in-break operator are given to searching an optimal machining order. Computational results are presented for some large randomly generated problems.

源语言英语
主期刊名Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
3042-3046
页数5
DOI
出版状态已出版 - 2006
已对外发布
活动6th World Congress on Intelligent Control and Automation, WCICA 2006 - Dalian, 中国
期限: 21 6月 200623 6月 2006

出版系列

姓名Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
1

会议

会议6th World Congress on Intelligent Control and Automation, WCICA 2006
国家/地区中国
Dalian
时期21/06/0623/06/06

学术指纹

探究 'Mutation ant colony algorithms of constrained two-dimensional guillotine cutting problems' 的科研主题。它们共同构成独一无二的指纹。

引用此