{"title":"减少实际功率损失的定制花授粉算法","authors":"Dr.Lenin Kanagasabai","doi":"10.11591/IJICT.V8I2.PP%P","DOIUrl":null,"url":null,"abstract":"In this paper, Tailored Flower Pollination (TFP) algorithm is proposed to solve the optimal reactive power problem. Comprising of the elements of chaos theory, Shuffled frog leaping search and Levy Flight, the performance of the flower pollination algorithm has been improved. Proposed TFP algorithm has been tested in standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss.","PeriodicalId":245958,"journal":{"name":"International Journal of Informatics and Communication Technology (IJ-ICT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Tailored flower pollination (TFP) algorithm for diminution of real power loss\",\"authors\":\"Dr.Lenin Kanagasabai\",\"doi\":\"10.11591/IJICT.V8I2.PP%P\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, Tailored Flower Pollination (TFP) algorithm is proposed to solve the optimal reactive power problem. Comprising of the elements of chaos theory, Shuffled frog leaping search and Levy Flight, the performance of the flower pollination algorithm has been improved. Proposed TFP algorithm has been tested in standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss.\",\"PeriodicalId\":245958,\"journal\":{\"name\":\"International Journal of Informatics and Communication Technology (IJ-ICT)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Informatics and Communication Technology (IJ-ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11591/IJICT.V8I2.PP%P\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Informatics and Communication Technology (IJ-ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/IJICT.V8I2.PP%P","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tailored flower pollination (TFP) algorithm for diminution of real power loss
In this paper, Tailored Flower Pollination (TFP) algorithm is proposed to solve the optimal reactive power problem. Comprising of the elements of chaos theory, Shuffled frog leaping search and Levy Flight, the performance of the flower pollination algorithm has been improved. Proposed TFP algorithm has been tested in standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
