Por favor, use este identificador para citar o enlazar este ítem: http://cimat.repositorioinstitucional.mx/jspui/handle/1008/620
On the Possibility to Create a Compatible-Complete Unary Comparison Method for Evolutionary Multiojective Algorithms
ARTURO HERNANDEZ AGUIRRE
Acceso Abierto
Atribución-NoComercial
Algorítmos - Multilenguaje
There are several studies on the desirable properties that a compari- son method for evolutionary multiobjective algorithms must have. One of these properties is called compatibility and completeness . There is a theo- rem that states that, in the general case (inØnite size sets), it is not pos- sible to create a unary comparison method with the property mentioned before. As a consequence, unary performance measures are considered to be less reliable than binary performance measures. In this paper we provide a further analysis for practical conditions (Ønite size sets). We prove, for these conditions, that the impossibility to create a compatible and complete unary comparison method, is no longer valid. Our result opens the door for future research to establish whether or not is possible to create such a comparison method.
Centro de Investigación en Matemáticas AC
15-04-2008
Reporte
Inglés
Investigadores
LENGUAJES ALGORÍTMICOS
Versión publicada
publishedVersion - Versión publicada
Aparece en las colecciones: Reportes Técnicos - Ciencias de la Computación

Cargar archivos:


Fichero Tamaño Formato  
I-08-09.pdf401.69 kBAdobe PDFVisualizar/Abrir