z-logo
open-access-imgOpen Access
Decomposition method for coordinated planning of distributed generation and distribution network
Author(s) -
Wu Zhi,
Liu Yafei,
Gu Wei,
Zhou Jingjing,
Li Junjie,
Liu Pengxiang
Publication year - 2018
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2017.2050
Subject(s) - mathematical optimization , conic section , time horizon , decomposition , integer programming , decomposition method (queueing theory) , computer science , node (physics) , benders' decomposition , mathematics , engineering , ecology , geometry , structural engineering , discrete mathematics , biology
With recent development on renewable energy and distributed generation (DG), distribution system expansion planning (DSEP) problem is facing more challenges. This study proposed a multistage coordinate planning model to minimise the present value of construction cost and operating cost over the planning horizon. Installation of DGs, static var generators, and expansion of distribution network were considered simultaneously. The proposed model is a large‐scale mixed‐integer second‐order conic programming (MISOCP) problem containing large amounts of constraints and variables. The MISOCP can be decomposed into: (i) the master problem which determines the construction plan, (ii) and many subproblems which optimise the operating states under different network configurations and different load levels. A modified Benders decomposition method was applied to generate valid cuts from subproblems with integer variables. Results of the proposed decomposition method were compared with those obtained by commercial software on a 24‐node distribution system. Numerical experiments showed that the proposed method can solve the integrated DSEP problem efficiently.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here