{"title":"一种具有相对距离的多目标遗传算法:方法、性能度量和约束处理","authors":"P. Tripathi, S. Bandyopadhyay, S. Pal","doi":"10.1109/ICCTA.2007.13","DOIUrl":null,"url":null,"abstract":"A novel multi-objective evolutionary algorithm (MOEA), called multi-objective genetic algorithm with relative distance (MOGARD) is described. A novel relative distance parameter that ensures convergence to the Pareto optimal front and a nearest neighbour based method for maintaining diversity in the non-dominated set is used. Two novel performance measures are formulated to estimate the performance of the MOEAs. A penalty based constraint handling concept is introduced in MOGARD, for handling constraints. Experimental results demonstrate the superiority of MOGARD on several test problems, as compared to other recent and well known algorithms","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"729 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Multi-objective Genetic Algorithm with Relative Distance: Method, Performance Measures and Constraint Handling\",\"authors\":\"P. Tripathi, S. Bandyopadhyay, S. Pal\",\"doi\":\"10.1109/ICCTA.2007.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel multi-objective evolutionary algorithm (MOEA), called multi-objective genetic algorithm with relative distance (MOGARD) is described. A novel relative distance parameter that ensures convergence to the Pareto optimal front and a nearest neighbour based method for maintaining diversity in the non-dominated set is used. Two novel performance measures are formulated to estimate the performance of the MOEAs. A penalty based constraint handling concept is introduced in MOGARD, for handling constraints. Experimental results demonstrate the superiority of MOGARD on several test problems, as compared to other recent and well known algorithms\",\"PeriodicalId\":308247,\"journal\":{\"name\":\"2007 International Conference on Computing: Theory and Applications (ICCTA'07)\",\"volume\":\"729 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computing: Theory and Applications (ICCTA'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTA.2007.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA.2007.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Multi-objective Genetic Algorithm with Relative Distance: Method, Performance Measures and Constraint Handling
A novel multi-objective evolutionary algorithm (MOEA), called multi-objective genetic algorithm with relative distance (MOGARD) is described. A novel relative distance parameter that ensures convergence to the Pareto optimal front and a nearest neighbour based method for maintaining diversity in the non-dominated set is used. Two novel performance measures are formulated to estimate the performance of the MOEAs. A penalty based constraint handling concept is introduced in MOGARD, for handling constraints. Experimental results demonstrate the superiority of MOGARD on several test problems, as compared to other recent and well known algorithms