摘要
针对一个实际问题,讨论了一种约束布局的启发式算法,提出了约束布局求解的启发式规则及相应的布局方案求解策略,改进后的算法具有很强的灵活性和柔性,同时还对该算法的实际性能进行了仿真,结果表明了改进算法的有效性和合理性。
According to a practicable problem, a heuristic algorithm about constrained layout problem is discussed, some heuristic formula and strategy on how to solve constrained layout problem are proposed. The improved algorithm has a strong flexibility. A emluator is ceded to validate the performance of the improved algorithm, the results proved the rationality and the effectiveness of the improved algorithm.
出处
《信息技术》
2007年第3期13-15,共3页
Information Technology
基金
甘肃省自然科学基金资助项目(ZS031-A25-019-G)
关键词
分治法
局部优化
NP难问题
约束布局
divided - and - conquer
local optimization
NP - hard problem
constrained layout