{"title":"GDE-MOEA:基于代距指标和ε-优势度的一种新的MOEA","authors":"A. Menchaca-Méndez, C. Coello","doi":"10.1109/CEC.2015.7256992","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new selection mechanism based on ε-dominance which is called “ε-selection”. An interesting feature of this selection scheme is that it does not require to set the value of o ahead of time. Our ε-selection is incorporated into the GD-MOEA algorithm, giving rise to the so-called “Generational Distance & ε-dominance Multi-Objective Evolutionary Algorithm (GDE-MOEA)”. Our proposed GDE-MOEA is validated using standard test functions taken from the specialized literature, having three to six objective functions. GDE-MOEA is compared with respect to the original GD-MOEA, which is based on the generational distance indicator and a technique based on Euclidean distances to improve the diversity in the population. Additionally, our proposed approach is compared with respect to MOEA/D using Penalty Boundary Intersection (PBI), which is based on decomposition, and SMS-EMOA-HYPE (a version of SMS-EMOA that uses a fitness assignment scheme based on the use of an approximation of the hypervolume indicator). Our preliminary results indicate that our proposed GDE-MOEA is a good alternative to solve multi-objective optimization problems having both low dimensionality and high dimensionality in objective function space because it obtains better results than GD-MOEA and MOEA/D in most cases and it is competitive with respect to SMS-EMOA-HYPE but at a much lower computational cost.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"397 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"GDE-MOEA: A new MOEA based on the generational distance indicator and ε-dominance\",\"authors\":\"A. Menchaca-Méndez, C. Coello\",\"doi\":\"10.1109/CEC.2015.7256992\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new selection mechanism based on ε-dominance which is called “ε-selection”. An interesting feature of this selection scheme is that it does not require to set the value of o ahead of time. Our ε-selection is incorporated into the GD-MOEA algorithm, giving rise to the so-called “Generational Distance & ε-dominance Multi-Objective Evolutionary Algorithm (GDE-MOEA)”. Our proposed GDE-MOEA is validated using standard test functions taken from the specialized literature, having three to six objective functions. GDE-MOEA is compared with respect to the original GD-MOEA, which is based on the generational distance indicator and a technique based on Euclidean distances to improve the diversity in the population. Additionally, our proposed approach is compared with respect to MOEA/D using Penalty Boundary Intersection (PBI), which is based on decomposition, and SMS-EMOA-HYPE (a version of SMS-EMOA that uses a fitness assignment scheme based on the use of an approximation of the hypervolume indicator). Our preliminary results indicate that our proposed GDE-MOEA is a good alternative to solve multi-objective optimization problems having both low dimensionality and high dimensionality in objective function space because it obtains better results than GD-MOEA and MOEA/D in most cases and it is competitive with respect to SMS-EMOA-HYPE but at a much lower computational cost.\",\"PeriodicalId\":403666,\"journal\":{\"name\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"397 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2015.7256992\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2015.7256992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
GDE-MOEA: A new MOEA based on the generational distance indicator and ε-dominance
In this paper, we propose a new selection mechanism based on ε-dominance which is called “ε-selection”. An interesting feature of this selection scheme is that it does not require to set the value of o ahead of time. Our ε-selection is incorporated into the GD-MOEA algorithm, giving rise to the so-called “Generational Distance & ε-dominance Multi-Objective Evolutionary Algorithm (GDE-MOEA)”. Our proposed GDE-MOEA is validated using standard test functions taken from the specialized literature, having three to six objective functions. GDE-MOEA is compared with respect to the original GD-MOEA, which is based on the generational distance indicator and a technique based on Euclidean distances to improve the diversity in the population. Additionally, our proposed approach is compared with respect to MOEA/D using Penalty Boundary Intersection (PBI), which is based on decomposition, and SMS-EMOA-HYPE (a version of SMS-EMOA that uses a fitness assignment scheme based on the use of an approximation of the hypervolume indicator). Our preliminary results indicate that our proposed GDE-MOEA is a good alternative to solve multi-objective optimization problems having both low dimensionality and high dimensionality in objective function space because it obtains better results than GD-MOEA and MOEA/D in most cases and it is competitive with respect to SMS-EMOA-HYPE but at a much lower computational cost.