This algorithm is SMS-EMOA implementation on HL. The main structure and interfaces with HL are copied from MOEA/D on HL, which was written by Dr. Bogdan Burlacu. The S-metric (hypervolume contribution, HVC) selection operator was adapted from Kaifeng's MATLAB toolbox in SMS-EMOA. The computational complexity of HVC is AT LEAST $O (n^2 \log n)$ in 2-D and 3-D cases. HVC should definitely be reduced to $\Theta (n \times \log n)$.
This algorithm assumes:
minimization problems. For maximization problems, it is better to add "-" symbol.
This algorithm works on:
continuous, discrete, mixed-integer MOO problems. For different types of problems, the operators should be adjusted accordingly.
both multi-objective and many-objective problems. For many-objective problems, the bottleneck is the computational complexity of HV.
This algorithm is the basic implementation of SMS-EMOA, proposed by Michael Emmerich et. al. Some potential improvements can be:
Dynamic reference point strategy
Normalized fitness value strategy ---- desirability function. See, Yali, Longmei, Kaifeng, Michael Emmerich CEC paper.
HVC calculation should definitely be improved, at least in the 2D and 3D cases.
multiple point strategy when $\lambda>1$
multiple reference points strategy, in ICNC 2016, Zhiwei Yang et. al.
HVC approximation by R2 for MANY OBJECTIVE cases, by Ishibushi 2019, IEEE TEC
Maybe: See maps
Global parameters:
population
Many thanks for Bogdan Burlacu and Johannes Karder, especially Bogdan for his explanation, help, and supports.
Issue migrated from trac ticket # 3055
component: Algorithms | priority: medium | keywords: MOO, Hypervolume Contribution, indicator-based
2020-02-06 13:10:07: @kfyang created the issue