计算机工程与科学2011，Vol.33Issue(7)：158-162,5.DOI:10.3969/j.issn.1007-130X.2011.07.030
基于蚁群优化算法求解矩形件排样问题
Solving Rectangular Packing Problems Based on the Ant Colony Optimization Algorithm
童科 1毛力1
作者信息
- 1. 江南大学信息工程学院,江苏无锡214122
- 折叠
摘要
Abstract
The rectangular packing problem comes from the actual production, it is important for industries to save raw material utilization, reduce costs, improve economic efficiency. Ant Colony System is the abstract simulation of ants group behaviors. ACS has the advantages of distributed computing, information feedback and heuristic search. The optimal layout for rectangles is a NP-complete combinatorial optimization problem. The ant colony system algorithm and the surplus rectangle algorithm are used for solving the 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. At the end of this paper, the new ant colony system is validated by two examples,and the facts show that the new algorithm presented by this paper is efficient.关键词
矩形优化排样/蚁群优化算法/排样方案/组合优化Key words
rectangle packing/ant colony system algorithm/packing pattern/combinatorial optimization分类
信息技术与安全科学引用本文复制引用
童科,毛力..基于蚁群优化算法求解矩形件排样问题[J].计算机工程与科学,2011,33(7):158-162,5.
