Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm
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 optimiza...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/4670820 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832560596641382400 |
|---|---|
| author | Thang Trung Nguyen Dieu Ngoc Vo Hai Van Tran Le Van Dai |
| author_facet | Thang Trung Nguyen Dieu Ngoc Vo Hai Van Tran Le Van Dai |
| author_sort | Thang Trung Nguyen |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-55dcc1906e7048d7b29be665d1668de7 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-55dcc1906e7048d7b29be665d1668de72025-02-03T01:27:14ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/46708204670820Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search AlgorithmThang Trung Nguyen0Dieu Ngoc Vo1Hai Van Tran2Le Van Dai3Power System Optimization Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City, VietnamDepartment of Power Systems, Ho Chi Minh City University of Technology, VNU-HCM, Ho Chi Minh City, VietnamFaculty of Electrical and Electronic Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City, VietnamInstitute of Research and Development, Duy Tan University, Danang, VietnamThis 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.http://dx.doi.org/10.1155/2019/4670820 |
| spellingShingle | Thang Trung Nguyen Dieu Ngoc Vo Hai Van Tran Le Van Dai Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm Complexity |
| title | Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm |
| title_full | Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm |
| title_fullStr | Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm |
| title_full_unstemmed | Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm |
| title_short | Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm |
| title_sort | optimal dispatch of reactive power using modified stochastic fractal search algorithm |
| url | http://dx.doi.org/10.1155/2019/4670820 |
| work_keys_str_mv | AT thangtrungnguyen optimaldispatchofreactivepowerusingmodifiedstochasticfractalsearchalgorithm AT dieungocvo optimaldispatchofreactivepowerusingmodifiedstochasticfractalsearchalgorithm AT haivantran optimaldispatchofreactivepowerusingmodifiedstochasticfractalsearchalgorithm AT levandai optimaldispatchofreactivepowerusingmodifiedstochasticfractalsearchalgorithm |