By Topic

Multistate series-parallel system expansion-scheduling subject to availability constraints

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

1 Author(s)
Levitin, G. ; Dept. of Reliability & Equipment, Israel Electr. Corp. Ltd., Haifa, Israel

This paper addresses the multistage expansion problem for multistate series-parallel systems. The study period is divided into several stages. At each stage the demand distribution is predicted in the form of a cumulative demand curve. The additional elements chosen from a list of available products can be included into any system-component at any stage to increase the total system capacity and/or reliability. Each element is characterized by its capacity (productivity), availability, and cost. The objective is to minimize the sum of costs of the investments over the study period while satisfying reliability constraints at each stage. To solve the problem, a genetic algorithm is used as an optimization tool. The solution encoding technique allows the genetic algorithm to manipulate integer strings representing multistage expansion planes. A solution quality index comprises both reliability and cost estimations. The procedure based on the universal generating function is used for evaluating the availability of multistate series-parallel systems. An example illustrates finding the optimal expansion plan for a coal-transportation system of a power station

Published in:

Reliability, IEEE Transactions on  (Volume:49 ,  Issue: 1 )