Journal of South China University of Technology(Natural Science Edition) ›› 2003, Vol. 31 ›› Issue (6): 67-70,75.

Previous Articles     Next Articles

Application of Population-based Incremental Learning Algorithm in Solving Code Covering Problem

LIN Daying HAO Zhifeng SHU Lei   

  • Online:2003-06-20 Published:2022-09-08
  • Contact: 林大瀛(1978一)，女，硕士研究生，主要从事数 理统计和优化算法研究。
  • About author:林大瀛(1978一)，女，硕士研究生，主要从事数 理统计和优化算法研究。

PDF

19

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.

Key words: code covering problem, PBIL algorithm, heuristic feasible operator, jump-out strategy