Show simple item record

dc.contributor.authorHelbig, Mardé
dc.contributor.authorZille, Heiner
dc.contributor.authorJavadi, Mahrokh
dc.contributor.authorMostaghim, Sanaz
dc.date.accessioned2021-01-29T02:45:14Z
dc.date.available2021-01-29T02:45:14Z
dc.date.issued2019
dc.identifier.isbn978-1-4503-6748-6
dc.identifier.doi10.1145/3319619.3322005
dc.identifier.urihttp://hdl.handle.net/10072/401549
dc.description.abstractIn 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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.ispartofconferencenameGenetic and Evolutionary Computation Conference Companion (GECCO 2019)
dc.relation.ispartofconferencetitleGECCO' 19 Companion: Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion
dc.relation.ispartofdatefrom2019-07-13
dc.relation.ispartofdateto2019-07-17
dc.relation.ispartoflocationPrague, Czech Republic
dc.relation.ispartofpagefrom205
dc.relation.ispartofpageto206
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchArtificial Intelligence and Image Processing
dc.subject.fieldofresearchcode0802
dc.subject.fieldofresearchcode0801
dc.subject.keywordsScience & Technology
dc.subject.keywordsPhysical Sciences
dc.subject.keywordsMathematics, Interdisciplinary Applications
dc.subject.keywordsDynamic optimization
dc.titlePerformance of Dynamic Algorithms on the Dynamic Distance Minimization Problem
dc.typeConference output
dc.type.descriptionE1 - Conferences
dcterms.bibliographicCitationHelbig, 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
dc.date.updated2021-01-29T02:41:20Z
gro.hasfulltextNo Full Text
gro.griffith.authorHelbig, Mardé


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record