| 基于状态转移的组合优化方法 |
| |
| 引用本文： | 王正元,杨克巍,谭跃进.基于状态转移的组合优化方法[J].系统工程,2003,21(4):11-15. |
| |
| 作者姓名： | 王正元 杨克巍 谭跃进 |
| |
| 作者单位： | 国防科技大学,人文与管理学院,湖南,长沙,410073 |
| |
| 摘 要： | NP问题的解空间太大导致利用现有技术求解十分困难。针对这一问题．提出基于状态转移的组合优化方法。结合0／1背包问题的求解。阐明这种方法求解问题的过程。实验结果表明这种方法是有效的。
|
| 关 键 词： | 状态转移 组合优化方法 NP问题 0／1背包问题 |
| 文章编号： | 1001-4098(2003)04-0011-05 |
State Transition Based Combinatorial Optimization |
| |
| WANG Zheng yuan,YANG Ke wei,TAN Yue jin.State Transition Based Combinatorial Optimization[J].Systems Engineering,2003,21(4):11-15. |
| |
| Authors: | WANG Zheng yuan YANG Ke wei TAN Yue jin |
| |
| Abstract: | It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge. State transition based combinatorial optimization is proposed to this problem. The solution process is described with the solution of 0/1 knapsack problem. The results show that state transition based combinatorial optimization is valid. |
| |
| Keywords: | State Transition Combinatorial Optimization NP 0/1 Knapsack Problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
