Cart (Loading....) | Create Account
Close category search window

Solving the Identifying Code Problem by a Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yi-chun Xu ; Sch. of Electr. Eng. & Inf. Technol., China Three Gorges Univ., Yichang ; Ren-Bin Xiao

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

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:37 ,  Issue: 1 )

Date of Publication:

Jan. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.