Please use this identifier to cite or link to this item:
|Title:||Multiple criteria performance analysis of non-dominated sets obtained by multi-objective genetic algorithms for optimisation||Authors:||JANSSENS, Gerrit
|Issue Date:||2010||Publisher:||Springer||Source:||Artificial Intelligence Applications and Innovations: vol. 339. p. 94-103.||Series/Report:||IFIP Advances in Information and Communication Technology||Series/Report no.:||339||Abstract:||The paper shows the importance of a multi-criteria performance analysis in evaluating the quality of non-dominated sets. The sets are generated by the use of evolutionary algorithms, more specifically through SPEA2 or NSGA-II. Problem examples from different problem domains are analyzed on four criteria of quality. These four criteria namely cardinality of the non-dominated set, spread of the solutions, hyper-volume , and set coverage do not favour any algorithm along the problem examples. In the Multiple Shortest Path Problem (MSPP) examples, the spread of solutions is the decisive factor for the 2S|1M configuration, and the cardinality and set coverage for the 3S configuration. The differences in set coverage values between SPEA2 and NSGA-II in the MSPP are small since both algorithms have almost identical non-dominated solutions. In the Decision Tree examples, the decisive factors are set coverage and hyper-volume . The computations show that the decisive criterion or criteria vary in all examples except for the set coverage criterion. This shows the importance of a binary measure in evaluating the quality of non-dominated sets, as the measure itself tests for dominance. The various criteria are confronted by means of a multi-criteria decision tool.||Document URI:||http://hdl.handle.net/1942/11901||ISBN:||978-3-642-16238-1||DOI:||10.1007/978-3-642-16239-8_15||Category:||C1||Type:||Proceedings Paper|
|Appears in Collections:||Research publications|
Show full item record
checked on Sep 2, 2020
checked on May 16, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.