Solving the Identifying Code Problem by a Genetic Algorithm

  • Authors:
  • Y. -C. Xu;R. -B. Xiao

  • Affiliations:
  • Sch. of Electr. Eng. & Inf. Technol., China Three Gorges Univ., Yichang;-

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Identifying code is a concept in information theory and can be applied to problems of fault detection and location detection. In this paper, by assigning cost to every code word, we propose an optimization problem to find an identifying code with minimum cost and formulate the problem by an integer program. We generalize the results to the robust identifying code problem, which is proposed for poor environments. A tailored genetic algorithm is provided to solve the problem, and the experimental result shows that it is competitive for large-scale problems