• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (7): 158-162.

• 论文 • Previous Articles     Next Articles

Solving Rectangular Packing Problems Based on the Ant Colony Optimization Algorithm

TONG Ke,MAO Li   

  1. (School of Information Technology,Jiangnan University,Wuxi 214122,China)
  • Received:2010-06-11 Revised:2010-12-10 Online:2011-07-21 Published:2011-07-25

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