Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm

Joint Authors

Nguyen, Thang Trung
Vo, Dieu Ngoc
Van Tran, Hai
Van Dai, Le

Source

Complexity

Issue

Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-28, 28 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2019-05-28

Country of Publication

Egypt

No. of Pages

28

Main Subjects

Philosophy

Abstract EN

This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization.

The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS).

The first modification is to keep only one formula and abandon one formula in the diffusion process while the second modification and the third modification are used in the first update and the second update.

In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated.

This manner results in the fact that some promising solutions around the high quality solutions can be missed.

In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update.

In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates.

Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability.

Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system.

The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed.

Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods.

Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters.

As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem.

American Psychological Association (APA)

Nguyen, Thang Trung& Vo, Dieu Ngoc& Van Tran, Hai& Van Dai, Le. 2019. Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm. Complexity،Vol. 2019, no. 2019, pp.1-28.
https://search.emarefa.net/detail/BIM-1131869

Modern Language Association (MLA)

Nguyen, Thang Trung…[et al.]. Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm. Complexity No. 2019 (2019), pp.1-28.
https://search.emarefa.net/detail/BIM-1131869

American Medical Association (AMA)

Nguyen, Thang Trung& Vo, Dieu Ngoc& Van Tran, Hai& Van Dai, Le. Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm. Complexity. 2019. Vol. 2019, no. 2019, pp.1-28.
https://search.emarefa.net/detail/BIM-1131869

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-1131869