| 一种求解圆形件下料问题的启发式算法 |
| |
| 引用本文： | 侯桂玉,崔耀东,黄少丽,杨剑,潘涛.一种求解圆形件下料问题的启发式算法[J].计算机工程,2010,36(13):227-229. |
| |
| 作者姓名： | 侯桂玉 崔耀东 黄少丽 杨剑 潘涛 |
| |
| 作者单位： | 广西师范大学计算机科学与信息工程学院,桂林,541004 |
| |
| 基金项目： | 国家自然科学基金资助项目，广西科学基金资助项目，广西研究生教育创新计划基金资助项目 |
| |
| 摘 要： | 针对二维圆形件下料问题，提出一种改进的顺序启发式算法。在生成排样方式的过程中，采用价值修正策略不断修正当前排入圆片的价值，使之趋于合理，选取价值最大的排样方式组成当前排样方案，迭代调用该过程多次，从中选取最优的排样方案。实验结果证明，与线性规划算法相比，该算法更有效。
|
| 关 键 词： | 顺序启发式算法 顺序价值修正 圆形件下料 |
Heuristic Algorithm for Cutting Stock Problem of Circular Item |
| |
| HOU Gui-yu,CUI Yao-dong,HUANG Shao-li,YANG Jian,PAN Tao.Heuristic Algorithm for Cutting Stock Problem of Circular Item[J].Computer Engineering,2010,36(13):227-229. |
| |
| Authors: | HOU Gui-yu CUI Yao-dong HUANG Shao-li YANG Jian PAN Tao |
| |
| Affiliation: | (College of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004) |
| |
| Abstract: | Aiming at two-dimensional cutting stock problem of circular items, this paper presents an improved Sequential Heuristic Procedure(SHP). In the process of generating cutting patterns, Sequential Value Correction(SVC) strategy is used to update the value of circular items contained in the current pattern, making them more reasonable. The pattern with maximum value is selected to form the current cutting plan. Several solutions are constructed iteratively to select the best one. Experimental result proves that compared with LP algorithm, the algorithm is more effective. |
| |
| Keywords: | Sequential Heuristic Procedure(SHP) Sequential Value Correction(SVC) cutting stock of circular item |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
