Abstract
The paper proposes a new two-dimensional circular bin packing problem (2D-CBPP) that is closely related to the well-known 2D rectangular bin packing problem and the single container circle packing problem. Inspired by Gold corner, silver side and strawy void for Chinese Go game, a greedy algorithm based on corner occupying action (GACOA) is proposed for solving the 2D-CBPP. We define the corner occupying action to pack the outside circles into a bin as compactly as possible, such that the number of used bins is minimized. As there are no existing benchmarks for this proposed problem, we generate two sets of benchmark instances with equal and unequal circles respectively. Experimental results show that the proposed algorithm performs quite well on these 2D-CBPP instances.
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.
