In this study, a multi-stage long-term expansion planning model for an active distribution network (ADN) is presented, with the aim of minimising the investment and operation cost in a coordinated manner over an estab...
详细信息
In this study, a multi-stage long-term expansion planning model for an active distribution network (ADN) is presented, with the aim of minimising the investment and operation cost in a coordinated manner over an established horizon. The planning model optimises the following alternatives: upgrading the capacities of substations, reinforcing and/or constructing cable circuits, placing voltage regulators (VRs) and/or static VAR generators, and determining the connection points for distributed generators (DGs). The investment decisions are optimised over the entire planning horizon which can be further divided into multiple periods, and the operation strategies, e.g. active management of DG as well as ADN topology reconfiguration, are determined according to the profiles of representative scenarios. To relieve the computational burden, the original model is properly simplified as a mixed-integer quadratic constrained programming problem through linearisation and approximation techniques, and the solution optimality is guaranteed after invoking the off-the-shell solver. A 24-node test system is employed to validate the effectiveness of the proposed model.
The problem of optimised design of diversely polarised sparse array for joint synthesis of spatial and polarisation beampattern is addressed in this Letter. Two kinds of polarised array configurations, cocentred and n...
详细信息
The problem of optimised design of diversely polarised sparse array for joint synthesis of spatial and polarisation beampattern is addressed in this Letter. Two kinds of polarised array configurations, cocentred and non-cocentred crossed-dipole arrays, are considered. Minimum interelement spacing constraint along with non-cocentred constraint are involved in the design methods by using two discrete linear operators. The optimisation process can be formulated as a mixed-integerquadratically constrainedprogrammingproblem which guarantees the optimal solution of the sparse array configuration. Comparison examples with state-of-the-art method validate the advantages of the proposed method in terms of the reduction of required element number and the enlargement of adjacent element spacing.
暂无评论