Abstract

Cutting stock problem is an important problem that arises in a variety of industrial applications. This research constructs an irregular-shaped nesting approach for two-dimensional cutting stock problem. The techniques of shape similarity are utilized, drawn from computer vision and artificial intelligence. These techniques enable the approach to find potential matches of the unplaced pieces within the void regions of the sheet, and thus the packing density and the performance of solutions are highly improved. The proposed approach is able to deal with complex shapes in industrial application and achieve high-quality solution with shorter computational time. We evaluate the proposed method using 15 established benchmark problems available from the EURO Special Interest Group on Cutting and Packing. The results demonstrate the effectiveness and high efficiency of the proposed approach.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.