{"title":"多目标最优潮流的非支配排序蜻蜓算法","authors":"Sundaram B. Pandya, H. Jariwala","doi":"10.1109/i-PACT44901.2019.8960065","DOIUrl":null,"url":null,"abstract":"This paper shows the single and multi-objective edition of the newly projected Dragonfly Algorithm (DA) known as Non-Dominated Sorting Dragonfly Algorithm (NSDA) for the solution of multi-objectives optimal power flow problem. This projected NSDA algorithm is working in such a manner that, it primary finds all non-dominated Pareto optimal results at last end iteration number. Then crowding distance approach and fuzzy decision making technique are applied for finding the best compromise solutions among all the Pareto fronts in the dominated regions of multi-objective search spaces. The results are validated through the IEEE 30-bus test system and compared with the other latest optimization algorithms.","PeriodicalId":214890,"journal":{"name":"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Non Dominated Sorting Dragonfly Algorithm For Multi-Objectives Optimal Power Flow\",\"authors\":\"Sundaram B. Pandya, H. Jariwala\",\"doi\":\"10.1109/i-PACT44901.2019.8960065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows the single and multi-objective edition of the newly projected Dragonfly Algorithm (DA) known as Non-Dominated Sorting Dragonfly Algorithm (NSDA) for the solution of multi-objectives optimal power flow problem. This projected NSDA algorithm is working in such a manner that, it primary finds all non-dominated Pareto optimal results at last end iteration number. Then crowding distance approach and fuzzy decision making technique are applied for finding the best compromise solutions among all the Pareto fronts in the dominated regions of multi-objective search spaces. The results are validated through the IEEE 30-bus test system and compared with the other latest optimization algorithms.\",\"PeriodicalId\":214890,\"journal\":{\"name\":\"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/i-PACT44901.2019.8960065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/i-PACT44901.2019.8960065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Non Dominated Sorting Dragonfly Algorithm For Multi-Objectives Optimal Power Flow
This paper shows the single and multi-objective edition of the newly projected Dragonfly Algorithm (DA) known as Non-Dominated Sorting Dragonfly Algorithm (NSDA) for the solution of multi-objectives optimal power flow problem. This projected NSDA algorithm is working in such a manner that, it primary finds all non-dominated Pareto optimal results at last end iteration number. Then crowding distance approach and fuzzy decision making technique are applied for finding the best compromise solutions among all the Pareto fronts in the dominated regions of multi-objective search spaces. The results are validated through the IEEE 30-bus test system and compared with the other latest optimization algorithms.