Abstract
Genetic algorithms (GAs) have been found well suited for solving optimization problems. This paper introduces a robust genetic algorithm that efficiently solves the classical rectangle packing problem. Based on an encoding scheme of sliceable structure, the proposed algorithm develops a new crossover operation that inherits favorable fitness properties from its parents without further repairing. Empirical results verify two characteristics of this algorithm. First, it can achieve very promising runtime and high-quality solutions. Second, it can manage a much larger problem size compared to the state-of-the-art algorithms.
Sign-in/Register to access full text options 
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.
