.png){kind=icon}
返回
Guided Moth-Flame optimiser for multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-019-03407-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a novel version of Moth-Flame optimiser for solving multi-objective problems (MOMFO). The main idea of this algorithm is that the Moth's swarm explores the search space around the Flames set (leader solutions). To implement our approach, we integrate the unlimited external archive to guide the Moth's swarm during the exploration search to find the Pareto solutions set. To ensure a good compromise between convergence and diversity when exploring the search space, we use the epsilon dominance principle to update the external archive. In addition, we use the non-dominated sort and crowding distance in updating the Flame solutions to ensure rapid convergence towards the Pareto solutions set. We validate the proposed algorithm on twelve test functions and compare our results with two well-known meta-heuristics. The results of the proposed algorithm show better convergence behavior with a better diversity of solutions.
Keyword:
Moth-Flame optimiser
Multi-objective optimization
Pareto solutions set
Swarm intelligence
Epsilon dominance relation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm蛾焰优化算法: 一种新的自然启发启发式范式
PREAI
分享收藏Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case混合0-1线性规划的多目标分支和界限: 对双目标情况的修正和改进
PREAI
分享收藏
查看更多内容