Application of BPSO with GA in model-based fault diagnosis of traction substation

Gao, Song; Dai, Chenxi; Liu, Zhigang; Geng, Xiao

doi:10.1109/cec.2014.6900379

Cited by 5 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Genetic algorithms and their variations [14], particle swarm optimization [15] and improved differential evaluation algorithm [16] were initially proposed to compute the minimum hitting set using a fitness function. The hybrid versions of these algorithms [17] and parallel hybrid algorithms are also proposed [18]. However, all of these algorithms have a major drawback in the sense that they may not guarantee exact minimum hitting sets.…”

Section: Introductionmentioning

confidence: 99%

A Progressive Search Algorithm for the Minimum Hitting Set Problem

Arslan¹,

Uğurlu²,

Akram³

et al. 2021

Deu Muhendislik Fakultesi Fen Ve Muhendislik

View full text Add to dashboard Cite

Given a finite universe and a collection of the subsets of the universe, the minimum hitting set of the collection is the smallest subset of the universe that has non-empty intersection with each set in the collection. Finding the minimum hitting set is an NP-Hard problem that has many real world applications. In this study, we propose a progressive search-based approach to find the minimum hitting set of a given collection. The algorithm starts searching for the hitting sets of size 1 and increase the expected size of the minimum hitting set by a factor of d. After each unsuccessful search, it increases the expected size by d and generate the candidate sets with the expected size. After each successful search, the algorithm takes the average of last unsuccessful and successful searches and continue the searching with the new expected size. The algorithm terminates when the detected upper bound coincides with the detected lower bound. The effect of different values for d on the performance of the algorithm has been experimented on various data sets. Experimental results reveal that the proposed method effectively computes the minimum hitting set on real-world data and random dataset.

show abstract

Section: Introductionmentioning

confidence: 99%

A Progressive Search Algorithm for the Minimum Hitting Set Problem

Arslan¹,

Uğurlu²,

Akram³

et al. 2021

Deu Muhendislik Fakultesi Fen Ve Muhendislik

View full text Add to dashboard Cite

show abstract

“…Hence, the calculating time of these algorithms is unacceptable in the case of calculating MHS on a large scale of conflict sets. Therefore, the intelligent algorithms have been used to calculate the MHS, such as genetic algorithm (GA) [29], binary particle swarm optimization (BPSO) [30], improved differential evolution algorithm (IDEA) [31], immune genetic algorithm (IGA) [32] and series hybrid algorithm for BPSO and GA (BPSO-GA) [33]. These algorithms have the advantages of low difficulty, low complexity, fast convergence and global search capability.…”

Section: Introductionmentioning

confidence: 99%

An Innovative Minimum Hitting Set Algorithm for Model-Based Fault Diagnosis in Power Distribution Network

Wang¹,

Jin²,

Mohamed

2019

IEEE Access

View full text Add to dashboard Cite

The distribution network plays a great role in the power system, and any fault in it may threaten the safe and stable operation of the power system. Hence, fault diagnosis has an important role in protecting the distribution network and maintaining power system stability. The model-based diagnosis (MBD) is one of the diagnostic methods that have some advantages compared with the common diagnosis methods. The latter, such as expert diagnosis systems depend on the professional experience and fault information. However, the inefficiency and incomplete calculation of the minimum hitting set (MHS) limits the performance of the MBD. In this paper, to overcome these limitations, an innovative MHS algorithm which considers the nature and characteristics of the distribution network is proposed. In the proposed algorithm, a new fitness function is constructed by a weighted combination method, which allows particles to move directly toward the MHS without the effect of non-hitting set particles. Finally, three cases studies and discussion on the distribution network are introduced to validate the advantages of the proposed algorithm, in terms of the computation efficiency and accuracy. INDEX TERMS Distribution network, fault diagnosis, model based diagnosis, minimum hitting set algorithm, power system stability.

show abstract

A Study on the Application of a Genetic Algorithm for the Fault Recovery of Substations

Lee

Park

2022

J. Electr. Eng. Technol.

View full text Add to dashboard Cite

Application of BPSO with GA in model-based fault diagnosis of traction substation

Cited by 5 publications

References 14 publications

A Progressive Search Algorithm for the Minimum Hitting Set Problem

A Progressive Search Algorithm for the Minimum Hitting Set Problem

An Innovative Minimum Hitting Set Algorithm for Model-Based Fault Diagnosis in Power Distribution Network

A Study on the Application of a Genetic Algorithm for the Fault Recovery of Substations

Contact Info

Product

Resources

About