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.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:240999 |
Date | January 2016 |
Creators | Marek, Martin |
Contributors | Hurák,, Zdeněk, Kadlec, Petr |
Publisher | Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.002 seconds