The AS-EMOA, short for aspiration set evolutionary multi-objective algorithm aims to incorporate expert knowledge into multi-objective optimization [1]. The algorithm expects an aspiration set, i.e., a set of reference points. It then creates an approximation of the pareto front close to the aspiration set utilizing the average Hausdorff distance.
asemoa(fitness.fun, n.objectives = NULL, minimize = NULL, n.dim = NULL, lower = NULL, upper = NULL, mu = 10L, aspiration.set = NULL, normalize.fun = NULL, dist.fun = ecr:::computeEuclideanDistance, p = 1, parent.selector = setup(selSimple), mutator = setup(mutPolynomial, eta = 25, p = 0.2, lower = lower, upper = upper), recombinator = setup(recSBX, eta = 15, p = 0.7, lower = lower, upper = upper), terminators = list(stopOnIters(100L)))
fitness.fun | [ |
---|---|
n.objectives | [ |
minimize | [ |
n.dim | [ |
lower | [ |
upper | [ |
mu | [ |
aspiration.set | [ |
normalize.fun | [ |
dist.fun | [ |
p | [ |
parent.selector | [ |
mutator | [ |
recombinator | [ |
terminators | [ |
[ecr_multi_objective_result
]
This is a pure R implementation of the AS-EMOA algorithm. It hides the regular ecr interface and offers a more R like interface while still being quite adaptable.
[1] Rudolph, G., Schuetze, S., Grimme, C., Trautmann, H: An Aspiration Set EMOA Based on Averaged Hausdorff Distances. LION 2014: 153-156. [2] G. Rudolph, O. Schuetze, C. Grimme, and H. Trautmann: A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets, pp. 261-273 in A.-A. Tantar et al. (eds.): Proceedings of EVOLVE - A bridge between Probability, Set Oriented Numerics and Evolutionary Computation V, Springer: Berlin Heidelberg 2014.