当前位置: X-MOL 学术arXiv.cs.NE › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dominance Move calculation using a MIP approach for comparison of multi and many-objective optimization solution sets
arXiv - CS - Neural and Evolutionary Computing Pub Date : 2020-01-10 , DOI: arxiv-2001.03657
Claudio Lucio do Val Lopes, Fl\'avio Vin\'icius Cruzeiro Martins, and Elizabeth Fialho Wanner

Dominance move (DoM) is a binary quality indicator that can be used in multiobjective optimization. It can compare solution sets while representing some important features such as convergence, spread, uniformity, and cardinality. DoM has an intuitive concept and considers the minimum move of one set needed to weakly Pareto dominate the other set. Despite the aforementioned properties, DoM is hard to calculate. The original formulation presents an efficient and exact method to calculate it in a biobjective case only. This work presents a new approach to calculate and extend DoM to deal with three or more objectives. The idea is to use a mixed integer programming (MIP) approach to calculate DoM. Some initial experiments, in the biobjective space, were done to verify the model correctness. Furthermore, other experiments, using three, five, and ten objective functions were done to show how the model behaves in higher dimensional cases. Algorithms such as IBEA, MOEAD, NSGAIII, NSGAII, and SPEA2 were used to generate the solution sets, however any other algorithms could be used with DoM indicator. The results have confirmed the effectiveness of the MIP DoM in problems with more than three objective functions. Final notes, considerations, and future research are discussed to exploit some solution sets particularities and improve the model and its use for other situations.

中文翻译:

使用 MIP 方法计算 Dominance Move 以比较多目标和多目标优化解决方案集

优势移动 (DoM) 是一种二元质量指标,可用于多目标优化。它可以比较解集,同时表示一些重要的特征,如收敛、扩散、均匀性和基数。DoM 有一个直观的概念,它考虑一个集合的最小移动,以弱帕累托支配另一个集合。尽管有上述属性,但 DoM 很难计算。原始公式提供了一种仅在双目标情况下计算它的有效且准确的方法。这项工作提出了一种计算和扩展 DoM 以处理三个或更多目标的新方法。这个想法是使用混合整数规划 (MIP) 方法来计算 DoM。在双目标空间中进行了一些初始实验以验证模型的正确性。此外,其他实验,使用三、五、并完成了十个目标函数来展示模型在高维情况下的表现。IBEA、MOEAD、NSGAIII、NSGAII 和 SPEA2 等算法用于生成解集,但是任何其他算法都可以与 DoM 指标一起使用。结果证实了 MIP DoM 在具有三个以上目标函数的问题中的有效性。讨论了最后的注释、注意事项和未来的研究,以利用一些解决方案集的特殊性并改进模型及其在其他情况下的使用。结果证实了 MIP DoM 在具有三个以上目标函数的问题中的有效性。讨论了最后的注释、注意事项和未来的研究,以利用一些解决方案集的特殊性并改进模型及其在其他情况下的使用。结果证实了 MIP DoM 在具有三个以上目标函数的问题中的有效性。讨论了最后的注释、注意事项和未来的研究,以利用一些解决方案集的特殊性并改进模型及其在其他情况下的使用。
更新日期:2020-01-14
down
wechat
bug