期刊论文

Chen, Mao（陈矛）;Liu, Sanya

英文

Computers & Industrial Engineering

0360-8352

2018

119

114-120

10.1016/j.cie.2018.03.030

The authors thank the anonymous referees for their helpful comments and suggestions which contributed to the improvement of the presentation and the contents of this paper. This work is supported by National Natural Science Foundation of China (Grant No. 60903023 ), Self-determined Research Funds of CCNU from the colleges’ basic research and operation of MOE – China (Grant No. CCNU15A02006 ) and 12th Five-Year Science and Technology Support Program of China (Grant No. 2015BAK07B03 ).

本校为第一且通讯机构

This paper presents a greedy heuristic algorithm for solving the circle packing problem whose objective is to pack a set of unit circles into the smallest circular container. The proposed algorithm can be divided into two stages. In the first stage, a greedy packing procedure is introduced to determine whether the given set of circles can be packed into a fixed container. According to the greedy packing procedure, the circles are packed into the container one by one and each circle is packed into the container by a corner-occupying placement wi...