By Topic

A New Heuristic Algorithm for Constrained Redundancy-Optimization in Complex Systems

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
$33 $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

1 Author(s)
Shi Dinghua ; Shanghai Institute of Railway Technology; 1, Zhennan Lu; Shanghai 200333; P. R. CHINA.

A new heuristic algorithm solves the problem of constrained redundancy optimization in complex systems using minimal path sets. With two examples, the effect of new algorithm and existing methods are compared.

Published in:

IEEE Transactions on Reliability  (Volume:R-36 ,  Issue: 5 )