期刊论文

Yu, Xin-Guo（余新国）

英文

Computers & Operations Research

0305-0548

2018

92

47-55

10.1016/j.cor.2017.09.013

This work is supported by National Natural Science Foundation of China (Grant Nos. 61272206, 61472147, 61602429, 61702207, 61702211, 31600918, 41671377 ), National Science and Technology Support Program of China (2015BAH33F01), Self-determined Research Funds of CCNU from the colleges’ basic research and operation of MOE (Grant Nos. CCNU15A05013, CCNU15A05010, CCNU15GF001, CCNU15A02050, CCNU15A02006, CCNU16JYKX004 ). We sincerely thank Eckard Specht for processing our results and publishing them on the Packomania website! Finally, we would give our special thanks to the editor and the anonymous referees for their professional comments and valuable suggestions that improve this paper significantly!

本校为第一且通讯机构

A circle packing problem involves packing given circles into a container. The objective is to minimize the size of the container without causing any overlap. This paper focuses on a representative circle packing problem where the circles are unequal and the container is a square, called Packing Unequal Circles into a Square (PUCS). It proposes a memetic algorithm to solve the problem. The memetic algorithm can be regarded as a combination of a genetic algorithm (GA) and an iterated local search (ILS). It is composed of a local search phase and ...