Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya
{"title":"优化DG分配,使有功功率损耗最小,计算速度更快,精度更高","authors":"Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya","doi":"10.1109/RAIT.2018.8389009","DOIUrl":null,"url":null,"abstract":"This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"434 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Optimal DG allocation for minimizing active power loss with better computational speed and high accuracy\",\"authors\":\"Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya\",\"doi\":\"10.1109/RAIT.2018.8389009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.\",\"PeriodicalId\":219972,\"journal\":{\"name\":\"2018 4th International Conference on Recent Advances in Information Technology (RAIT)\",\"volume\":\"434 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 4th International Conference on Recent Advances in Information Technology (RAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAIT.2018.8389009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAIT.2018.8389009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal DG allocation for minimizing active power loss with better computational speed and high accuracy
This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.