Performance of Dynamic Algorithms on the Dynamic Distance Minimization Problem
File version
Author(s)
Zille, Heiner
Javadi, Mahrokh
Mostaghim, Sanaz
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Prague, Czech Republic
License
Abstract
In the area of multi-objective optimization, a special challenge is dynamic optimization problems. These problems change their optimal values or optimal configurations of input variables over time, making it harder for metaheuristic algorithms to track these changes and find the new optima. To test the search ability of such dynamic multi-objective algorithms, a dynamic benchmark called the Dynamic Distance Minimization Problem (dDMP) was proposed in the literature. The dDMP implements multiple changes, not only in location and fitness values of the Pareto-optimal sets, but also in the complexity of the problem. This work aims to test the performance of two well-known dynamic multi-objective algorithms on different instances of the dDMP with varying complexity. This involves changes in the number of objectives and changes of the distance metric at runtime, which has not been done before with this problem in the literature. The results show that both algorithms struggled to recover after the number of objectives was reduced and then increased again. When the distance metric was changed over time both algorithms performed reasonable well. However, there were gaps in the found Pareto fronts when switching between the Euclidean and the Manhattan distance metrics.
Journal Title
Conference Title
GECCO' 19 Companion: Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion
Book Title
Edition
Volume
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
Evolutionary computation
Satisfiability and optimisation
Planning and decision making
Science & Technology
Physical Sciences
Mathematics, Interdisciplinary Applications
Dynamic optimization
Persistent link to this record
Citation
Helbig, M; Zille, H; Javadi, M; Mostaghim, S, Performance of Dynamic Algorithms on the Dynamic Distance Minimization Problem, GECCO' 19 Companion: Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion, 2019, pp. 205-206