%0 Journal Article
%T 求解圆形packing问题的拟人退火算法
%A 张德富
%A 李新
%J 自动化学报
%P 590-595
%D 2005
%X ？CirclespackingproblemisanNP-hardproblemandisdifficulttosolve.Inthispaper,ahybridsearchstrategyforcirclespackingproblemisdiscussed.Awayofgeneratingnewconfigurationispresentedbysimulatingthemovingofelasticobjects,whichcanavoidtheblindnessofsimulatedannealingsearchandmakeiterationprocessconvergefast.Inspiredbythelifeexperiencesofpeople,aneffectivepersonifiedstrategytojumpoutoflocalminimaisgiven.Basedonthesimulatedannealingideaandpersonificationstrategy,aneffectivepersonifiedannealingalgorithmforcirclespackingproblemisdeveloped.Numericalexperimentsonbenchmarkprobleminstancesshowthattheproposedalgorithmoutperformsthebestalgorithmintheliterature.
%K Packingproblem
%K simulatedannealingalgorithm
%K personification
%U http://www.aas.net.cn/CN/abstract/abstract16020.shtml