Return to search

Toolbox pro vícekriteriální optimalizační problémy / Toolbox for multi-objective optimization

This paper deals with multi-objective optimization problems (MOOP). It is explained, what solutions in multi-objetive search space are optimal and how are optimal (non-dominated) solutions found in the set of feasible solutions. Afterwards, principles of NSGA-II, MOPSO and GDE3 algorithms are described. In the following chapters, benchmark metrics and problems are introduced. In the last part of this paper, all the three algorithms are compared based on several benchmark metrics.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:240999
Date January 2016
CreatorsMarek, Martin
ContributorsHurák,, Zdeněk, Kadlec, Petr
PublisherVysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0016 seconds