期刊论文

He, Kun

英文

European Journal of Operational Research

0377-2217

2016

250

2

615-627

10.1016/j.ejor.2015.09.001

This work is supported by National Natural Science Foundation of China (Grant nos. 61272206 , 61472147 , 61173180 , 61100144 , 61262011 , 41201413 ); 111 Plan: Collaboration Innovation Base on Educational Digital Media and Visualization; Natural Science Foundation of Hubei Province, China (2014CFB661); National Social Science Foundation of China (Grant no. 14BGL131); Self-determined Research Funds of CCNU from the colleges' basic research and operation of MOE (Grant nos. CCNU15A05013 , CCNU15A05010 , CCNU15GF001 ); Key Science and Technology Project of Wuhan (Grant no. 2014010202010108 ). We sincerely thank Eckard Specht for processing our results and publishing them on the Packomania website. We also thank Prof. Jin-Kao Hao and Prof. Zhipeng Lü for their previous work in the area of Iterated Tabu Search, which inspired us a lot. Finally, we would give our special thanks to the anonymous referees for their professional comments and valuable suggestions that improve this paper significantly.

本校为第一机构

This paper presents an Iterated Tabu Search and Variable Neighborhood Descent (ITS-VND) algorithm for packing unequal circles into a circular container (PUCC). The algorithm adapts the Tabu Search procedure of Iterated Tabu Search algorithms and proposes a Tabu Search and Variable Neighborhood Descent (TS-VND) procedure. We observe there are strong complementarities between the small circles and the large vacant places, and propose the insert neighborhood to match up the small circles with the large vacant places. Although the insert neighborhood is inefficient and time-consuming, it is an imp...