| 型材优化下料问题的变换算法 |
| |
| 引用本文： | 王波.型材优化下料问题的变换算法[J].咸宁学院学报,2005,25(6):61-62,66. |
| |
| 作者姓名： | 王波 |
| |
| 作者单位： | 咸宁学院,数学系,湖北,咸宁,437005 |
| |
| 摘 要： | 根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法．该算法避免了求解大量下料方式及求解大规模整数规划的复杂问题．最后给出了一个实际例子，表明该方法是可行的．
|
| 关 键 词： | 一维下料 近似算法 最优化 |
| 文章编号： | 1006-5342（2005）06-0061-02 |
| 收稿时间： | 04 19 2005 12:00AM |
| 修稿时间： | 2005-04-19 |
Swap Algorithm for One- Dimensional Cutting- Stock Problem Optimization |
| |
| WANG Bo.Swap Algorithm for One- Dimensional Cutting- Stock Problem Optimization[J].Journal of Xianning College,2005,25(6):61-62,66. |
| |
| Authors: | WANG Bo |
| |
| Institution: | Department of Mathematics, Xianning College, Xianning 437005, China |
| |
| Abstract: | The paper based on the idea of K - OPT Algorithm for TSP, present a swap algorithm for the one - dimensional cutting - stock problem. The algorithm avoids the great complexity of deducing cutting - pattern and solving LP. Result shows that the algorithm is valid. |
| |
| Keywords: | One - dimensional cutting stock problem Heuristic algorithm Optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
