averaged Hausdorff distance, generational distance, inverted generational distance, multiobjective optimization, Pareto optimality, performance indicator
 Coello C A C, Cortés N C. Solving multiobjective optimization problems using an artificial immune system. Genetic Programming and Evolvable Machines, 6(2):163–190,2005.
 Hansen M, Jaszkiewicz A. Evaluating the quality of approximations to the non-dominated set. IMM, Department of Mathematical Modelling, Technical University of Denmark,1998.
 Heinonen J. Lectures on analysis on metric spaces. Universitext. Springer-Verlag,NewYork,2001.
 Hillermeier C. Non linear Multiobjective Optimization. A Generalized Homotopy Approach. Birkhäuser, 2001.
 Ishibuchi H, Masuda H,Tanigaki Y,Nojima Y. Modified Distance Calculation in Generational Distance and Inverted Generational Distance. In:Gaspar-Cunha A, Antunes CH, Coello Coello CA (eds.), Evolutionary Multi-Criterion Optimization 8th International Conference EMO 2015, Guimarães, Portugal. Lecture Notes in Computer Science vol.9019, pp.110–125, Springer, 2015.
 ParetoV. Manual of Political Economy: A Critical and Variorum Edition. Edited by Montesano A, Zanni A, Bruni L, Chipman J S, McLureet M. Oxford University Press, 2014.
 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. Computational Optimization and Applications, 64:589–618,2016.
 Schütze O, Esquivel X, Lara A, Coello C A. Using the averaged Hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Transactionson Evolutionary Computation, 16(4):504–522,2012.
 Siwel J, Yew-Soon O, Jie Z, Liang F. Consistencies and contradictions of performance metrics in multi objective optimization. IEEE Transactions on Evolutionary Computation, 44(12):2329–2404,2014.
 Sun J Q, Xiong F R, Schütze O,Hernández C. Cell Mapping Methods - Algorithmic Approaches and Applications. Nonlinear Systems and Complexity 99, Springer,2019.
 Vargas A, Bogoya J. A generalization of the averaged Hausdorff distance. Computación y Sistemas, 22(2):331–345,2018.
 Veldhuizen D. Multi objective evolutionary algorithms: classifications, analyses, and new innovations.1999. Air Force Institute of Technology, page249,1999.
 Zitzler E,Thiele L. Multi objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactionson Evolutionary Computation, 3(4):257–271,1999.
 Zitzler E,Thiele L, Laumanns M, Fonseca CM, Da Fonseca V G. Performance assessment of multi objective optimizers: Ananalysis and review. IEEE Transactions on Evolutionary Computation, 7(2):117–132, 2003.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Univ. Sci. is registered under a Creative Commons Attribution 4.0 International Public License. Thus, this work may be reproduced, distributed, and publicly shared in digital format, as long as the names of the authors and Pontificia Universidad Javeriana are acknowledged. Others are allowed to quote, adapt, transform, auto-archive, republish, and create based on this material, for any purpose (even commercial ones), provided the authorship is duly acknowledged, a link to the original work is provided, and it is specified if changes have been made. Pontificia Universidad Javeriana does not hold the rights of published works and the authors are solely responsible for the contents of their works; they keep the moral, intellectual, privacy, and publicity rights. Approving the intervention of the work (review, copy-editing, translation, layout) and the following outreach, are granted through an use license and not through an assignment of rights. This means the journal and Pontificia Universidad Javeriana cannot be held responsible for any ethical malpractice by the authors. As a consequence of the protection granted by the use license, the journal is not required to publish recantations or modify information already published, unless the errata stems from the editorial management process. Publishing contents in this journal does not generate royalties for contributors.