1-Neighbour knapsack problem and prospective greedy algorithm of intentional islanding in active distribution network
Source abstract
Abstract
A connected and undirected graph model of active distribution networks with considering the function of interconnecting switches is constructed in this paper. Based on this model, the island partition problem of active distribution networks can be described as a 1-neighbour knapsack problem. An effective heuristic algorithm named prospective greedy algorithm is then proposed to solve this problem. Case studies on PG&E 69-bus network show the validity of the proposed model and algorithm.
Source: openaire · Quality: candidate unverified · Source record ↗
Research context
OpenAlex topics: Optimal Power Flow Distribution · Islanding Detection in Power Systems · Microgrid Control and Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (15)
Show source-provided references
1. D’Adamoc C, Jupe S, Abbey C. Global survey on planning and operation of active distribution networks-update of CIGRE C6.11 working group activities. In: Proceedings of the 20th International Conference and Exhibition on Electricity Distribution: Part 1. Prague, Czech: CIRED, 2009
2. You Y, Liu D, Yu W P. Technology and its trends of active distribution network (in Chinese). Autom Elec Power Syst, 2012, 36: 10–16
3. Yi X, Lu Y P. Islanding algorithm of distribution network with distributed generators (in Chinese). Power Syst Tech, 2006, 30: 49–54
4. Wang X D, Lin J K. Island partition of the distribution system with distributed generation. Sci China Tech Sci, 2011, 41: 693–702
5. Wang X D, Lin J K. Island partition of the distribution system with distributed generation based on branch and bound algorithm (in Chinese). Proc CSEE, 2011, 31: 16–20
6. Thi T H P, Besanger Y, Hadjsaid N. New challenges in power system restoration with large scale of dispersed generation insertion. IEEE Trans Power Syst, 2009, 24: 398–406
7. Johnson, D S, Niemi K A. On knapsacks, partitions, and a new dynamic programming technique for trees. Math Oper Res, 1983, 8: 1–1410.1287/moor.8.1.1 ↗
8. Bellman R E. Dynamic Programming. Princeton, NJ: Princeton Univ Press, 1957
9. Borradaile G, Heeringa B, Wilfong G. The knapsack problem with neighbour constraints. J Discrete Algorithms, 2012, 16: 224–23510.1016/j.jda.2012.04.011 ↗
10. Wasserman S, Faust K, Iacobucci D. Social Network Analysis. Cambridge: Cambridge University Press. 199410.1017/CBO9780511815478 ↗
11. Tutte W T. Lectures on matroids. J Res Nat Bur Standards B, 1965, 69: 1–4710.6028/jres.069B.001 ↗
12. Mao Y, Miu K N. Switch placement to improve system reliability for radial distribution system with distributed generation. IEEE Trans Power Syst, 2003, 18: 1346–1352
13. Michael M. Data Structures and Algorithms Using C. Beijing: TUP, 2009: 145–155
14. Baran M E, Wu F F. Optimal capacitor placement on radial distribution systems. IEEE Trans on Power Del, 1989, 4: 725–73410.1109/61.19265 ↗
15. Civanlar S, Grainger J J, Yin H, et al. Distribution feeder reconfiguration for loss reduction. IEEE Trans Power Syst, 1988, 3: 1217–122.10.1109/61.193906 ↗