摘要
为解决二维矩形布局问题,在广泛研究各种启发式方法的基础上,提出了基于目标的启发式算法.该算法在布局开始时确定布局目标,布局过程中综合运用多种策略,让每个局部最优解达到布局目标值,得到稳定的、可靠的全局解;并且简要分析了矩形正交布局的空间分解方法,提出了群组的基本策略以及布局的定序规则和定位规则.实验结果表明,算法具有较强实用性,布局效率提高200以上.
Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2D rectangle packing problem.The algorithm confirmed an objective at the beginning of packing.And many strategies were comprehensively applied during the process of packing, which made the optimal solution of each part reach the target value of packing and obtained steady and reliable global solution.The space decomposition method of orthogonal packing of rectangles was analyzed briefly. Basic strategies of group,ordering rules, and location rules of packing were proposed. The experimental results and the comparison with other methods show that the algorithm has strong practicability and the packing efficiency increases by 2%
出处
《天津大学学报（自然科学与工程技术版）》
EI
CAS
CSCD
北大核心
2005年第6期499-502,共4页
Journal of Tianjin University：Science and Technology
关键词
布局问题
布局目标
启发式方法
局部寻优
群组
空间分解
packing problem
packing objective
heuristic algorithm
local optimization
group
space decomposition
