Abstract
In this paper, we develop a new algorithm that incorporates the improved PERM into an already existing simple deterministic heuristic, the principle of maximum cave degree for corner-occupying actions, to solve the problem of packing equal or unequal circles into a larger circle container. We compare the performance of our algorithm on several problem instances taken from the literature with previous algorithms. The computational results show that the proposed approach produces high-quality solutions within reasonable computational times. Although our algorithm is less efficient than Zhang's for several large-scale equal-size instances, it is noteworthy that for several unequal circle instances we found new lower bounds missed in previous papers.
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.
