dc.contributor.author | Maree, Armand | |
dc.contributor.author | Riekert, Marius | |
dc.contributor.author | Helbig, Mardé | |
dc.contributor.editor | Rutkowski, Leszek | |
dc.contributor.editor | Scherer, Rafa L | |
dc.contributor.editor | Korytkowski, Marcin | |
dc.contributor.editor | Pedrycz, Witold | |
dc.contributor.editor | Tadeusiewicz, Ryszard | |
dc.contributor.editor | Zurada, Jacek M | |
dc.date.accessioned | 2021-01-29T03:00:57Z | |
dc.date.available | 2021-01-29T03:00:57Z | |
dc.date.issued | 2018 | |
dc.identifier.isbn | 978-3-319-91252-3 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.doi | 10.1007/978-3-319-91253-0_43 | |
dc.identifier.uri | http://hdl.handle.net/10072/401556 | |
dc.description.abstract | Genetic Programming is a specialized form of genetic algorithms which evolve trees. This paper proposes an approach to evolve an expression tree, which is an N-Ary tree that represents a mathematical equation and that describes a given set of points in some space. The points are a set of trade-off solutions of a multi-objective optimization problem (MOOP), referred to as the Pareto Optimal Front (POF). The POF is a curve in a multi-dimensional space that describes the boundary where a single objective in a set of objectives cannot improve more without sacrificing the optimal value of the other objectives. The algorithm, proposed in this paper, will thus find the mathematical function that describes a POF after a multi-objective optimization algorithm (MOA) has solved a MOOP. Obtaining the equation will assist in finding other points on the POF that was not discovered by the MOA. Results indicate that the proposed algorithm matches the general curve of the points, although the algorithm sometimes struggles to match the points perfectly. | |
dc.description.peerreviewed | Yes | |
dc.language | English | |
dc.publisher | Springer | |
dc.relation.ispartofconferencename | 17th International Conference on Artificial Intelligence and Soft Computing (ICAISC 2018) | |
dc.relation.ispartofconferencetitle | Lecture Notes in Computer Science | |
dc.relation.ispartofdatefrom | 2018-06-03 | |
dc.relation.ispartofdateto | 2018-06-07 | |
dc.relation.ispartoflocation | Zakopane, Poland | |
dc.relation.ispartofpagefrom | 462 | |
dc.relation.ispartofpageto | 473 | |
dc.relation.ispartofvolume | 10841 | |
dc.subject.fieldofresearch | Artificial intelligence | |
dc.subject.fieldofresearchcode | 4602 | |
dc.subject.keywords | Science & Technology | |
dc.subject.keywords | Computer Science, Artificial Intelligence | |
dc.subject.keywords | Multi-objective optimization | |
dc.title | Deriving Functions for Pareto Optimal Fronts Using Genetic Programming | |
dc.type | Conference output | |
dc.type.description | E1 - Conferences | |
dcterms.bibliographicCitation | Maree, A; Riekert, M; Helbig, M, Deriving Functions for Pareto Optimal Fronts Using Genetic Programming, Lecture Notes in Computer Science, 2018, 10841, pp. 462-473 | |
dc.date.updated | 2021-01-29T02:59:25Z | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Helbig, Mardé | |