Population-based metaheuristics for continuous boundary-constrained dynamic multi-objective optimisation problems

Most real-world optimisation problems are dynamic in nature with more than one objective, where at least two of these objectives are in conflict with one another. This kind of problems is referred to as dynamic multi-objective optimisation problems (DMOOPs). Most research in multi-objective optimisa...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Swarm and evolutionary computation Ročník 14; s. 31 - 47
Hlavní autoři:	Helbig, Mardé, Engelbrecht, Andries P.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.02.2014
Témata:	Dynamic multi-objective optimization Dynamic multi-objective optimization algorithms Population-based algorithms Dynamic multi-objective optimization Population-based algorithms Dynamic multi-objective optimization algorithms
ISSN:	2210-6502
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Most real-world optimisation problems are dynamic in nature with more than one objective, where at least two of these objectives are in conflict with one another. This kind of problems is referred to as dynamic multi-objective optimisation problems (DMOOPs). Most research in multi-objective optimisation (MOO) have focussed on static MOO (SMOO) and dynamic single-objective optimisation. However, in recent years, algorithms were proposed to solve dynamic MOO (DMOO). This paper provides an overview of the algorithms that were proposed in the literature to solve DMOOPs. In addition, challenges, practical aspects and possible future research directions of DMOO are discussed.
ISSN:	2210-6502
DOI:	10.1016/j.swevo.2013.08.004