{"title":"增强型非支配排序哈里斯鹰多目标优化器","authors":"S. Yasear, K. Ku-Mahamud","doi":"10.1109/ICACS47775.2020.9055941","DOIUrl":null,"url":null,"abstract":"This paper proposes an enhanced non-dominated sorting Harris's hawk multi-objective optimizer (ENDSHHMO) algorithm. In the original non-dominated sorting Harris's hawk multi-objective optimizer (NDSHHMO) algorithm, the convergence parameter is used to control the diversification and intensification during the search process. The parameter value decreases linearly as the number of iterations of the algorithm increases. This adjustment strategy of the parameter cannot fully reflect the actual optimization search process. Therefore, an improved adjustment strategy has been proposed and integrated with the NDSHHMO algorithm. This strategy can ensure that the proposed algorithm has a better diversification and intensification ability during the optimization process and improves the convergence to the Pareto front. The performance of the proposed enhanced NDSHHMO algorithm has been evaluated using a set of well-known multi-objective optimization problems. The results of the ENDSHHMO are compared with the NDSHHMO algorithm, which shows that the proposed algorithm is superior.","PeriodicalId":268675,"journal":{"name":"2020 3rd International Conference on Advancements in Computational Sciences (ICACS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced Non-dominated Sorting Harris's Hawk Multi-objective Optimizer\",\"authors\":\"S. Yasear, K. Ku-Mahamud\",\"doi\":\"10.1109/ICACS47775.2020.9055941\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an enhanced non-dominated sorting Harris's hawk multi-objective optimizer (ENDSHHMO) algorithm. In the original non-dominated sorting Harris's hawk multi-objective optimizer (NDSHHMO) algorithm, the convergence parameter is used to control the diversification and intensification during the search process. The parameter value decreases linearly as the number of iterations of the algorithm increases. This adjustment strategy of the parameter cannot fully reflect the actual optimization search process. Therefore, an improved adjustment strategy has been proposed and integrated with the NDSHHMO algorithm. This strategy can ensure that the proposed algorithm has a better diversification and intensification ability during the optimization process and improves the convergence to the Pareto front. The performance of the proposed enhanced NDSHHMO algorithm has been evaluated using a set of well-known multi-objective optimization problems. The results of the ENDSHHMO are compared with the NDSHHMO algorithm, which shows that the proposed algorithm is superior.\",\"PeriodicalId\":268675,\"journal\":{\"name\":\"2020 3rd International Conference on Advancements in Computational Sciences (ICACS)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 3rd International Conference on Advancements in Computational Sciences (ICACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACS47775.2020.9055941\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 3rd International Conference on Advancements in Computational Sciences (ICACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACS47775.2020.9055941","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes an enhanced non-dominated sorting Harris's hawk multi-objective optimizer (ENDSHHMO) algorithm. In the original non-dominated sorting Harris's hawk multi-objective optimizer (NDSHHMO) algorithm, the convergence parameter is used to control the diversification and intensification during the search process. The parameter value decreases linearly as the number of iterations of the algorithm increases. This adjustment strategy of the parameter cannot fully reflect the actual optimization search process. Therefore, an improved adjustment strategy has been proposed and integrated with the NDSHHMO algorithm. This strategy can ensure that the proposed algorithm has a better diversification and intensification ability during the optimization process and improves the convergence to the Pareto front. The performance of the proposed enhanced NDSHHMO algorithm has been evaluated using a set of well-known multi-objective optimization problems. The results of the ENDSHHMO are compared with the NDSHHMO algorithm, which shows that the proposed algorithm is superior.