Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
161 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
148 | en_US |
dc.citation.volume |
121 | en_US |
dc.contributor.author |
Yu, M. T. | en_US |
dc.contributor.author |
Lin, T. Y. | en_US |
dc.contributor.author |
Hung, C. | en_US |
dc.contributor.department |
機械工程學系 | zh_TW |
dc.contributor.department |
Department of Mechanical Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:08:55Z | |
dc.date.available |
2014-12-08T15:08:55Z | |
dc.date.issued |
2009-09-01 | en_US |
dc.description.abstract |
The cutting-stock problem, which considers how to arrange the component profiles on the material without overlaps, can increase the utility rate of the sheet stock, and is thus a standard constrained optimisation problem. In some applications the components should be placed with specific orientations, but in others the components may be placed with any orientation. This study presents an overlap index and it is much more suitable for the active-set SQP method which can reduce the time spend for constraint consideration. Using this method, various object orientations can be considered easily and the number of object on the sheet stock can be improved by up to eight percent. (C) 2009 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.ijpe.2009.01.014 | en_US |
dc.identifier.issn |
0925-5273 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.ijpe.2009.01.014 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/6781 | |
dc.identifier.wosnumber |
WOS:000270622600017 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Cutting-stock problem | en_US |
dc.subject |
Material saving | en_US |
dc.subject |
Rotatable | en_US |
dc.subject |
Active-set | en_US |
dc.subject |
Sequential quadratic programming | en_US |
dc.title |
Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons | en_US |
dc.type |
Article | en_US |
檔案
- 000270622600017.pdf (630.7 KB, Adobe PDF)
所屬典藏: 會議論文
引用此條目
Yu, M. T., Lin, T. Y., & Hung, C. (2009). Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 121(1), 148–161. https://doi.org/10.1016/j.ijpe.2009.01.014
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6781