Abstract
We propose a hybrid procedure to obtain a reduced number of different patterns in cutting stock problems. Initially, we generate patterns with limited waste that fulfill the demands of at least two items when the patterns are repeatedly cut as much as possible but without overproducing any of the items. The problem is reduced and the residual problem is solved. Then, pattern reduction techniques (local search) are applied starting with the generated solution. The scheme is straightforward and can be used in cutting stock problems of any dimension. Variations of the procedure are also indicated. Computational tests performed indicated that the proposed scheme provides alternative solutions to the pattern reduction problem which are not dominated by other solutions obtained using procedures previously suggested in the literature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.