摘要
本文针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。
In this paper, an improved genetic algorithm for the subproblem(according to the isomorphic layout equivalent class) is constructed. Thereafter, the algorithm is used to search the optimum of the 2-D layout optimal subproblem. Numerical experiments show that with the adjoining relation of all graph elements maintained the algorithm can obtain the optimum of subproblem. As the layout optimal problem can be partitioned into finite subproblems, the optimum of the whole layout optimum problem can be obtained.
出处
《运筹与管理》
CSCD
2005年第1期13-18,共6页
Operations Research and Management Science
关键词
运筹学
改进遗传算法
布局优化子问题
组合变异
同构布局等价类
operational research
improved genetic algorithm
layout optimal subproblem
combinational mutation
isomorphic layout equivalent class
