The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover

(1, 2) , (2) , (2) , (2) , (2) , (2)
1
2

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.
Fichier principal
Vignette du fichier
978-3-319-68121-4_25_Chapter.pdf (374.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01820897 , version 1 (22-06-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
49 View
83 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More