Abstract:
|
The rectangular stock cutting problem widely exists in many traditional industries. In order to solve the problem effectively, this paper presents a dynamic programming algorithm with the heuristic strategies, which combines the existing dynamic programming algorithm with several heuristic strategies. This paper introduces the essence of the algorithm and the outline of a prototype system developed on the base of the algorithm. Test results are presented to support the validity of the algorithm and the practicability of the system. The algorithm is shown to possess better adaptability to various layout problems and properties to give out satisfactory layout results quickly and effectively. These qualities can help manufacturing enterprises to minimize the material waste and to improve the production efficiency.
|
Funds:
|
863计划/CIMS主题 (2003AA11350) 资助项目
|
AuthorIntro:
|
|
Reference:
|
[1] AdamowiczM,AlbanoA.A solution of the rectangular cut ting stock problem[J].IEEE Transactions onSystems,Man,andCybernetics,1976,SMC 6(4):302310.
[2] 曹炬,周济.矩形件排样优化的一种近似算法[J].计算机辅助设计与图形学学报,1995,7(3):190195.
[3] 王华昌,陶献伟,李志刚.一种矩形件优化排样综合算法[J].华中科技大学学报(自然科学版),2003,31(6):912.
|
Service:
|
【This site has not yet opened Download Service】【Add
Favorite】
|
|
|