Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Dynamics in the Multi-objective Subset Sum: Analysing the Behavior of Population Based Algorithms
verfasst von : Iulia Maria Comsa, Crina Grosan, Shengxiang Yang
Erschienen in: Evolutionary Computation for Dynamic Optimization Problems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Real-world problems often present two characteristics that are challenging to examine theoretically: 1) they are dynamic (they change over time), and 2) they have multiple objectives. However, current research in the field of dynamic multi-objective optimization (DMO) is relatively sparse. In this chapter, we review recent work in this field and present our analysis of the subset sum problem in the DMO variant. Our approach uses a genetic algorithm with an external archive and a combination of Pareto dominance and aggregated fitness function.We show that the algorithm performs better on a smaller number of objectives, on type III dynamicity problems, and sometimes, counter-intuitively, on a larger data set.