.png){kind=icon}
返回
Developing a simulated annealing algorithm for the cutting stock problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(96)00205-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an intuitive, simple and efficient simulated annealing searching technique to solve non-guillotine, two- or three-dimensional cutting stock problems. This algorithm considers the possibility of placing different sizes of small rectangles or boxes on a larger rectangle (pallet) or container, in such a way that the amount of trim loss is minimized. The algorithm we propose provides a basis for exploring the integration of the simulated annealing technique with artificial intelligence, and interval algebra. The algorithm is programmed in C and run on a personal computer with an Intel 486-based CPU. The algorithm is tested using randomly generated test cases and also using real data from a printing company in Hong Kong. Copyright (C) 1997 Elsevier Science Ltd
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容