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

• Published in: IEEE transactions on reliability Vol. 49; no. 1; pp. 71 - 79
• Main Author: Levitin, G.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2000; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Availability; Constraint optimization; Costs; Demand; Demand curves; Encoding; Expansion; Genetic algorithms; Investments; Marketing; Multistage; Optimization; Power generation; Power system reliability; Productivity; Redundancy; Strings; Studies
• ISSN: 0018-9529; 1558-1721
• DOI: 10.1109/24.855538

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.