Skip to Main content Skip to Navigation
Conference papers

The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover

Abstract : In view of the cutting stock problem of the plate fragments and scrap cannot make full use, this paper introduces the concept of standard usage leftover, uses the recursive algorithm and the sequential heuristic procedure to solve the circle cutting problem, achieving the follow-up orders specification to use the usage leftover of the previous orders. This method can make the cutting process more simple, convenient usage leftovers inventory management, as well as conform to the requirements of the blanking for a long time. Computational experimental results show that the algorithm has a high material utilization, and playing a guiding role to the actual industrial production.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01820897
Contributor : Hal Ifip <>
Submitted on : Friday, June 22, 2018 - 10:42:40 AM
Last modification on : Tuesday, October 15, 2019 - 11:00:04 AM
Long-term archiving on: : Monday, September 24, 2018 - 11:04:37 PM

File

978-3-319-68121-4_25_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Chen Yan, Qiqi Xie, Qiulin Chen, Li Zhang, Yaodong Cui, et al.. The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover. 2nd International Conference on Intelligence Science (ICIS), Oct 2017, Shanghai, China. pp.234-240, ⟨10.1007/978-3-319-68121-4_25⟩. ⟨hal-01820897⟩

Share

Metrics

Record views

74

Files downloads

78