Abstract
In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. First, greedy biggest space sequencing (GBSS) is presented as a new placement strategy, which is very essential to RPP. Then, borrowing from the respective advantages of the two algorithms, genetic algorithm (GA) and simulated annealing (SA), a hybrid optimization policy is developed. The hybrid GASA is subjected to a test using a set of benchmarks. Compared to other approaches from the literature the hybrid optimization strategy performs better.
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.
