【摘要】 针对全局最优化求解布局问题 ,通过对目标函数的局部极小出发的两级搜索 ,获得多个邻接极小 ,实现布局模式的自动生成 ;从而获得基于不同布局模式的可行解集以及基于此解集的相对最优解 .并通过矩形空间中的圆布局问题给出实例演示 .更多还原

【Abstract】 Global optimization concept is employed to solve the layout problem. Neighboring minimums are acquired by a two step search starting from a known minimum, thus new layout patterns can be automatically generated; also generated at the same time are the layout problem’s solution set and its relative optimum solution based on this set. The layout problem of circles inside a rectangle is chosen for example.更多还原