摘要
本文以简化模型为例,给出了用模拟退火算法解布局问题的一般形式、基本步骤以及罚函数的使用方法,所给算法在选用适当的数据结构后即可求解复杂的布局问题,有很强的适应性和灵活性.
In this paper,the general form and basic steps and application of penalty function for applying the simulated annealing algorithm to solve the placement problem with a simplified model as an example are given.The algorithm is able to be applied for solving complex placement problems when se- lect suitable data structure,and therefore possesses wide adaptability and flexibility.
关键词
布局问题
模拟退火算法
罚函数
placement problem
simulated annealing algorithm
penalty functim
