求解不等圆packing问题的一个启发式算法-维普.pdfVIP

维普资讯 计算 机研究与发展 ISSN 1000—1239／CN 11-1777／TP JournalofComputerResearchandDevelopment 44(12)：2092～2097，2007 求解不等圆Packing问题的一个启发式算法 陈 矛 黄文奇 (华中师范大学教育信息技术工程研究中心 武汉 430079) (华中科技大学计算机科学与技术学院 武汉 430074) (mchen_1@163．com) A HeuristicAlgorithm fortheUnequalCirclePackingProblem ChenM ao ·andHuangW enqi (EngineeringCenterforEducationalInformationTechnology，HuazhongNormalUniversity，Wuhan430079) (SchoolofComputerScience Technology，HuazhongUniversityofScienceandTechnology，Wuhan430074) Abstract Circlepackingproblem ，oneoftheNPhardproblems，isofgreattheoreticalandpracticalvalue． Tosolvethecirclepackingproblem thatencountersin thefieldoftransportation offreight，aheuristic algorithm isproposed forfinding agoodarrangementofmultiple different—sized circleswithin a larger rectangularcontainer．Inthisalgorithm，thecirclesaresortedbynon—increasingorderofradiusandpacked intothecontaineronebyoneaccordingtotheorder．Eachcircleshouldbeplacedinsidethecontainerbya cornerplacementSO thatthecircle doesnotoverlap any othercircleand istangentwith twopreviously packedcircles．Bypseudo—placingoneormorecirclestobepacked，twogreedymethodsareintroducedto evaluatethebenefitofacornerplacement，oneofwhich isthedegreeofplacement，and theotherisa boundedenumerationstrategythatisbasedon thefirstone．Ateachiterationofpackingintheresulting algorithm ，eachcircleispackedintothecontainerbyacornerplacementwiththehighestbenefitaccording totheboundedenumerationstrategy．TheexperimentaIresultsarepresented，showingtheeffectivenessof thisalgorithm ． Keywords NP—hardproblem；circlepackingproblem ；heuristicalgorithm ；cornerplacement；bounded enumeration 摘 要 求解具有NP难度的圆形packing问题具有很高的理论与实用价值．现提出一个启发式方法，求 解了货运 中常遇到的矩形区域 内的不等圆packing问题．此算法首先将待布局 圆按半径大小降序排列， 然后用 占