4.6 Article

Long-Term Memory Harris Hawk Optimization for High Dimensional and Optimal Power Flow Problems

期刊

IEEE ACCESS
卷 7, 期 -, 页码 147596-147616

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2946664

关键词

Search problems; Linear programming; Power systems; Fuels; Power generation; Optimization methods; Diversity measurement; exploration-exploitation; long-term memory; Harris' hawk optimization; optimal power flow

资金

  1. University of Electronic Science and Technology of China (UESTC)
  2. National Natural Science Foundation of China (NSFC) [61772120]

向作者/读者索取更多资源

Harris hawk optimization (HHO) is a recent addition to population-based metaheuristic paradigm, inspired from hunting behavior of Harris hawks. It has demonstrated promising search behavior while employed on various optimization problems, however the diversity of search agents can be further enhanced. This paper represents a novel modified variant with a long-term memory concept, hence called long-term memory HHO (LMHHO), which provides information about multiple promising regions in problem landscape, for improvised search results. With this information, LMHHO maintains exploration up to a certain level even until search termination, thus produces better results than the original method. Moreover, the study proves that appropriate tools for in-depth performance analysis can help improve search efficiency of existing metaheuristic algorithms by making simple yet effective modification in search strategy. The diversity measurement and exploration-exploitation investigations prove that the proposed LMHHO maintains trade-off balance between exploration and exploitation. The proposed approach is investigated on high-dimensional numerical optimization problems, including classic benchmark and CEC17 functions; also, on optimal power flow problem in power generation system. The experimental study suggests that LMHHO not only outperforms the original HHO but also various other established and recently introduced metaheuristic algorithms. Although, the research can be extended by implementing more efficient memory archive and retrieval approaches for enhanced results.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据