Affiliations: [a] Institute of Information Technology, Cz\k{e}stochowa
University of Technology, Częstochowa, Poland | [b] Institute of Information Technology, Technical
University of Łódź, Łódź,
Poland
Correspondence:
[*]
Corresponding author: łukasz Piątek, Institute of
Information Technology, Częstochowa University of Technology, Armii
Krajowej 17 Str., 42-200, Częstochowa, Poland. E-mail:
[email protected]
Abstract: A hierarchical fair competition algorithm to optimize structures of
complex electric power networks is presented. The algorithm implements an
evolutionary algorithm on a population divided into several demes. A migration
mechanism which moves the best fitting individuals between populations is
presented. Coding of the system structure is done as a sequence of bits where
each bit codes a single edge joining a pair of vertices. The algorithm finds
such electric power network's structures that have maximum reliability and
minimum network cost. The network reliability estimation is considered as the
s-t reliability problem and computed with the cut set method. Efficiency of the
algorithm is demonstrated on an example of transmission network.
Keywords: Evolutionary algorithm, unavailability, minimum cut, cut set
