Visualizing the optimization process for multi-objective optimization problems

No Thumbnail Available
File version
Author(s)
Chakuma, Bayanda
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

Visualization techniques used to visualize the optimization process of multi-objective evolutionary algorithms (MOEAs) have been discussed in the literature, predominantly in the context of aiding domain experts in decision making and in improving the effectiveness of the design optimization process. These techniques provide the decision maker with the ability to directly observe the performance of individual solutions, as well as their distribution in the approximated Pareto-optimal front. In this paper a visualization technique to study the mechanics of a MOEA, as it is solving multi-objective optimization problems (MOOPs), is discussed. The visualization technique uses a scatterplot animation to visualize the evolutionary process of the algorithms search, focusing on the changes in the population of non-dominated solutions obtained for each generation. The ability to visualize the optimization process of the algorithm provides the means to evaluate the performance of the algorithm, as well as visually observing the trade-offs between objectives.

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

Visualization

Persistent link to this record
Citation

Chakuma, B; Helbig, M, Visualizing the optimization process for multi-objective optimization problems, Lecture Notes in Computer Science, 2018, 10841, pp. 333-344