{"title":"Comparison of novel multi-objective self organizing migrating algorithm with conventional methods","authors":"P. Kadlec, Z. Raida","doi":"10.1109/RADIOELEK.2011.5936395","DOIUrl":null,"url":null,"abstract":"In the paper, three algorithms for the multi-objective optimization based on the strategy of a self-organized migration are compared. The first two algorithms — Weighted Sum Method and Rotated Weighted Metric Method — transform multiple objectives into a single fitness function. The third method — a novel MOSOMA — combines the principle of the non-dominated sorting of population in the objective space and the survey of the decision space of input variables based on the self-organized migration. All three algorithms are compared on the test problem with the Pareto front, which contains both convex and non-convex parts. Monitored parameters are generational distance, spread of solutions and CPU time.","PeriodicalId":267447,"journal":{"name":"Proceedings of 21st International Conference Radioelektronika 2011","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 21st International Conference Radioelektronika 2011","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RADIOELEK.2011.5936395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
In the paper, three algorithms for the multi-objective optimization based on the strategy of a self-organized migration are compared. The first two algorithms — Weighted Sum Method and Rotated Weighted Metric Method — transform multiple objectives into a single fitness function. The third method — a novel MOSOMA — combines the principle of the non-dominated sorting of population in the objective space and the survey of the decision space of input variables based on the self-organized migration. All three algorithms are compared on the test problem with the Pareto front, which contains both convex and non-convex parts. Monitored parameters are generational distance, spread of solutions and CPU time.