| 基于改进遗传算法的布局优化子问题 |
| |
| 引用本文： | 曾明华,冯恩民.基于改进遗传算法的布局优化子问题[J].运筹与管理,2005,14(1):13-18. |
| |
| 作者姓名： | 曾明华 冯恩民 |
| |
| 作者单位： | 大连理工大学,应用数学系,辽宁,大连,116024 |
| |
| 摘 要： | 本针对子问题，构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题，数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题，所以利用该算法可以找到整个布局优化问题的全局最优解。
|
| 关 键 词： | 运筹学 改进遗传算法 布局优化子问题 组合变异 同构布局等价类 |
| 文章编号： | 1007-3221(2005)01-0013-06 |
| 修稿时间： | 2004年6月2日 |
Layout Optimal Subproblem Based on an Improved Genetic Algorithm |
| |
| ZENG Ming-hua,FENG En-min.Layout Optimal Subproblem Based on an Improved Genetic Algorithm[J].Operations Research and Management Science,2005,14(1):13-18. |
| |
| Authors: | ZENG Ming-hua FENG En-min |
| |
| Abstract: | 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. |
| |
| Keywords: | operational research improved genetic algorithm layout optimal subproblem combinational mutation isomorphic layout equivalent class |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
