.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more