Improved ACO for Dimensional Cutting-stock Problem

摘要：

In order to find an effective method for solving the NP problem-dimensional cutting stock problem, the improved ACO based on entropy was introduced. After introducing the basic knowledge of the improved ACO, the dimensional cutting-stock problems mathematical model was set up. And the improved ACO was employed to optimize the problem. Computed results indicate that the ant colony algorithm can approach the theoretical optimal solution, and its astringency is good. This study provides a new approach for the optimization of the NP hard problems.

关键词： dimensional cutting-stock ant colony algorithm NP hard problems optimization

作者: Yancang Li Juanjuan Suo Shujing Zhou

作者单位: Hebei University of Engineering, Handan 056038, China

会议类型: 国际会议

会议名称: 2010 International Conference on Advanced Mechanical Engineering(2010年先进机械工程国际学术会议 AME 2010)

会议地点: 洛阳

会议语种:英文

页码: 277-280

在线出版日期: 2010-09-04（万方平台首次上网日期，不代表论文的发表时间）