| 应用基因概率学习算法求解最小码覆盖问题 |
| |
| 引用本文： | 林大瀛,郝志峰,舒蕾.应用基因概率学习算法求解最小码覆盖问题[J].华南理工大学学报(自然科学版),2003,31(6):67-70,75. |
| |
| 作者姓名： | 林大瀛 郝志峰 舒蕾 |
| |
| 作者单位： | 华南理工大学,应用数学系,广东,广州,510640 |
| |
| 摘 要： | 概述最小码覆盖问题，以及现有的几种求解最小码覆盖问题的计算机搜索算法．在基因概率学习算法(PBIL)的基础上，建立码覆盖问题的目标函数，引进启发式算子HF0，针对局部陷阱设计跳出策略，从而获得一种新的快速求解码覆盖问题的算法．
|
| 关 键 词： | 最小码覆盖 基因概率学习算法 启发式算子 跳出策略 |
| 文章编号： | 1000-565(2003)06-0067-05 |
Application of Population-based Incremental Learning Algorithm in Solving Code Covering Problem |
| |
| Lin Da-ying Hao Zhi-feng Shu Lei.Application of Population-based Incremental Learning Algorithm in Solving Code Covering Problem[J].Journal of South China University of Technology(Natural Science Edition),2003,31(6):67-70,75. |
| |
| Authors: | Lin Da-ying Hao Zhi-feng Shu Lei |
| |
| Abstract: | In this paper the code covering problem and some of its computer search algorithms are introduced. Based on population-based incremental learning (PBIL) algorithm, a fast algorithm is presented with heuristic feasible operator (HFO) to solve some binary code covering problems. According to local minimum traps, several jump-out strategies are designed. Finally some new ideas are proposed for the algorithm improvement. |
| |
| Keywords: | code covering problem PBIL algorithm heuristic feasible operator jump-out strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
