Abstract
In this paper we present an algorithm for solving a pproximately large-scale strip cutting/packing problems. The strip packing problem consists of packing a large strip with a fixed-width and unlimited length into smaller rectangles, without violating the demand values imposed on each rectang le. The strip packing problem is reduced to a series of single constrained cutting stock problem and solved by using hybrid metaheuristic, variable neig hborhood search and simulated annealing. The performance of the propose d algorithm is evaluated on a set of medium and large size problem instances, t he results are compared with literature, on this way the results are satisfy.
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 callDisclaimer: 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.
