Deriving Functions for Pareto Optimal Fronts Using Genetic Programming

No Thumbnail Available
File version
Author(s)
Maree, Armand
Riekert, Marius
Helbig, Mardé
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Rutkowski, Leszek

Scherer, Rafa L

Korytkowski, Marcin

Pedrycz, Witold

Tadeusiewicz, Ryszard

Zurada, Jacek M

Date
2018
Size
File type(s)
Location

Zakopane, Poland

License
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.

Journal Title
Conference Title

Lecture Notes in Computer Science

Book Title
Edition
Volume

10841

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Science & Technology

Computer Science, Artificial Intelligence

Multi-objective optimization

Persistent link to this record
Citation

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