Zhi Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhi Yuan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jie Wang
Engineering Research Center of Education Ministry for Renewable Energy Power Generation and Grid-connected Control, Xinjiang University, Urumqi, Xinjiang 830047, China
2 shared publications - Weiqing Wang
Engineering Research Center of Ministry of Education for Renewable Energy Generation and Grid Connection Technology, Xinjiang University, Urumqi 830047, China
2 shared publications - Haiyun Wang
Engineering Research Center of Education Ministry for Renewable Energy Power Generation and Grid-connected Control, Xinjiang University, Urumqi, Xinjiang 830047, China
1 shared publication - Jiahui Wu
Engineering Research Center of Education Ministry for Renewable Energy Power Generation and Grid-connected Control, Xinjiang University, Urumqi 830047, China
1 shared publication
Latest Publications
- 29 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4324-4335
Operation Optimization Adapting to Active Distribution Networks Under Three-Phase Unbalanced Conditions: Parametric Linear Relaxation Programming
Asymmetric phase distributed generation, which is widely used in distribution systems, aggravates the severity of the intrinsic three-phase unbalanced condition of distribution systems. To overcome these problems, operation optimization formulas of the three-phase unbalanced active distribution network (ADN) are established considering soft open point (SOP) and belong to a nonconvex quadratic programming (NQP) problem. However, in conventional methods, either approximations that are not valid for an unbalanced distribution system are used or convex relaxation methods are applied to primitive nonlinear optimization models. However, these methods do not guarantee a feasible optimization solution. Therefore, determining the solution to the NQP problem is challenging. In this article, we propose a parametric linear relaxation algorithm to obtain the optimal feasible solution by solving the operation optimization problem of the three-phase unbalanced ADN with the SOP. The parametric linear relaxation technique is constructed based on the properties of quadratic functions and the mean value theorem, and the NQP is converted to a series of parametric linear relaxation programming problems. The results revealed that the proposed algorithm can achieve the optimal and feasible solution and considerably reduce the computation time compared with an equivalent NLP optimization model for the same distribution system.
- 29 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (3) , 4324-4335
Operation Optimization Adapting to Active Distribution Networks Under Three-Phase Unbalanced Conditions: Parametric Linear Relaxation Programming
Asymmetric phase distributed generation, which is widely used in distribution systems, aggravates the severity of the intrinsic three-phase unbalanced condition of distribution systems. To overcome these problems, operation optimization formulas of the three-phase unbalanced active distribution network (ADN) are established considering soft open point (SOP) and belong to a nonconvex quadratic programming (NQP) problem. However, in conventional methods, either approximations that are not valid for an unbalanced distribution system are used or convex relaxation methods are applied to primitive nonlinear optimization models. However, these methods do not guarantee a feasible optimization solution. Therefore, determining the solution to the NQP problem is challenging. In this article, we propose a parametric linear relaxation algorithm to obtain the optimal feasible solution by solving the operation optimization problem of the three-phase unbalanced ADN with the SOP. The parametric linear relaxation technique is constructed based on the properties of quadratic functions and the mean value theorem, and the NQP is converted to a series of parametric linear relaxation programming problems. The results revealed that the proposed algorithm can achieve the optimal and feasible solution and considerably reduce the computation time compared with an equivalent NLP optimization model for the same distribution system.
- Open Access
- 25 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 97392-97407
A Chaos Disturbed Beetle Antennae Search Algorithm for a Multiobjective Distribution Network Reconfiguration Considering the Variation of Load and DG
As the distributed generation (DG) in a power supply and the user load demand constantly change in an actual distribution network, multiobjective optimal network reconfiguration considering variations in load and DG has become a major concern, which is important and required to make system operations safe and economical. The aim is to minimize the sum of the active power loss, the sum of the load balancing index and the sum of the maximum node voltage deviation index simultaneously during the reconfiguration period. Here, this article proposes a new Chaos Disturbed Beetle Antennae Search (CDBAS) algorithm to reduce the computational time and solve the multiobjective optimal problem of network reconfiguration. To adopt the Chaos Disturbed Beetle Antennae Search algorithm for solving this multiobjective problem, grey target decision-making technology is used to rank the beetles. Additionally, to the enhance the system static voltage stability and voltage quality, a grey target decision-making model is established to achieve a layer relationship between each index and the switching operation index. The plausibility and effectiveness of the presented methodology is verified on the modified IEEE 33, 69 and 118-Bus Test Radial Distribution Network. Finally, compared with other research methods in the literature, the CDBAS algorithm outperforms other algorithms and produces a quality decision solution.
- 25 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 97392-97407
Open AccessA Chaos Disturbed Beetle Antennae Search Algorithm for a Multiobjective Distribution Network Reconfiguration Considering the Variation of Load and DG
As the distributed generation (DG) in a power supply and the user load demand constantly change in an actual distribution network, multiobjective optimal network reconfiguration considering variations in load and DG has become a major concern, which is important and required to make system operations safe and economical. The aim is to minimize the sum of the active power loss, the sum of the load balancing index and the sum of the maximum node voltage deviation index simultaneously during the reconfiguration period. Here, this article proposes a new Chaos Disturbed Beetle Antennae Search (CDBAS) algorithm to reduce the computational time and solve the multiobjective optimal problem of network reconfiguration. To adopt the Chaos Disturbed Beetle Antennae Search algorithm for solving this multiobjective problem, grey target decision-making technology is used to rank the beetles. Additionally, to the enhance the system static voltage stability and voltage quality, a grey target decision-making model is established to achieve a layer relationship between each index and the switching operation index. The plausibility and effectiveness of the presented methodology is verified on the modified IEEE 33, 69 and 118-Bus Test Radial Distribution Network. Finally, compared with other research methods in the literature, the CDBAS algorithm outperforms other algorithms and produces a quality decision solution.