Locate Multiple Pareto Optima Using a Species-Based Multi-objective Genetic Algorithm.

Communications in Computer and Information Science(2014)

引用 1|浏览5
暂无评分
摘要
In many real-world multi-objective optimization problems (MOOPs), the decision maker may only concern partial, rather than all, Pareto optima. This requires the solution algorithm to search and locate multiple Pareto optimal solutions simultaneously with higher accuracy and faster speed. To address this requirement, a species-based multi-objective GA (speMOGA) is designed in this paper, where multiple sub-populations would be constructed to search for multiple nondomiated solutions in parallel via decomposing a MOOP into a set of subproblems using the Tchebycheff approach. Based on a series of benchmark test problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with two classical multi-objective GAs: MOEA/D and NSGA-II. The experimental results show the validity of the proposed algorithm on locating multiple Pareto optima.
更多
查看译文
关键词
Multi-objective optimization problem,Genetic algorithm,Species,Tchebycheff approach
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要