论文部分内容阅读
针对全局最优化求解布局问题 ,通过对目标函数的局部极小出发的两级搜索 ,获得多个邻接极小 ,实现布局模式的自动生成 ;从而获得基于不同布局模式的可行解集以及基于此解集的相对最优解 .并通过矩形空间中的圆布局问题给出实例演示 .
In order to solve the global optimization problem, two adjacent levels of the objective function are searched to get the minimum number of adjacencies so that the layout pattern can be generated automatically. Based on this, a feasible solution set based on different layout patterns is obtained. The relative optimal solution of the set is given and an example is given through the circular layout problem in rectangular space.