On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front
The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced.
Here, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation.
KeywordsMulti-objective optimization Averaged hausdorff distance Convex front Optimal archives
Support from CONACYT project no. 207403 and DAAD project no. 57065955 is gratefully acknowledged. Additionally, Heike Trautmann acknowledges support by the European Center of Information Systems (ERCIS).
- 2.van Veldhuizen, D.A.: Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. PhD thesis, Department of Electrical and Computer Engineering. Graduate School of Engineering. Air Force Institute of Technology, Wright-Patterson AFB, Ohio, May 1999Google Scholar
- 5.Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations of the non-dominated set. IMM Technical Report IMM-REP-1998-7, Institute of Mathematical Modeling, Technical University of Denmark, Lyngby, March 1998Google Scholar
- 7.Gerstl, K., Rudolph, G., Schütze, O., Trautmann, H.: Finding evenly spaced fronts for multiobjective control via averaging Hausdorff-measure. In: Proceedings of 8th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), pp. 1–6. IEEE Press (2011)Google Scholar
- 9.Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: Optimal \(\mu \)-distributions and the choice of the reference point. In: Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms FOGA 2009, pp. 87–102. ACM, New York (2009)Google Scholar
- 11.Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., Trautmann, H.: Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. Comput. Optim. Appl. (2015). doi: 10.1007/s10589-015-9815-8, online 23 December 2015
- 12.Rudolph, G., Schütze, O., Grimme, C., Trautmann, H.: An aspiration set EMOA based on averaged Hausdorff distances. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 8. LNCS, vol. 8246, pp. 153–156. Springer, Heidelberg (2014)Google Scholar