{"title":"求解多目标问题的有限持续球遗传算法","authors":"K. Kamil, Chong Kok Hen, T. S. Kiong, Yeap Kim Ho","doi":"10.1109/SCORED.2010.5703998","DOIUrl":null,"url":null,"abstract":"This paper analyzes the performance of Genetic Algorithm using a new concept, namely Finite Persisting Sphere Genetic Algorithm (FPSGA). This algorithm shows the unique method in achieving fast convergence and great diversity for the multiobjective problem. These special characteristics of FPSGA are very useful in order to improve Genetic Algorithm (GA) performance to have great individuals mingling in the area of solution. Besides can help a system to solve a GA problem in a short duration, it can also prevent the solutions from trapped in the local optimum.","PeriodicalId":277771,"journal":{"name":"2010 IEEE Student Conference on Research and Development (SCOReD)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Finite persisting sphere Genetic Algorithm in solving multiobjectives problem\",\"authors\":\"K. Kamil, Chong Kok Hen, T. S. Kiong, Yeap Kim Ho\",\"doi\":\"10.1109/SCORED.2010.5703998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyzes the performance of Genetic Algorithm using a new concept, namely Finite Persisting Sphere Genetic Algorithm (FPSGA). This algorithm shows the unique method in achieving fast convergence and great diversity for the multiobjective problem. These special characteristics of FPSGA are very useful in order to improve Genetic Algorithm (GA) performance to have great individuals mingling in the area of solution. Besides can help a system to solve a GA problem in a short duration, it can also prevent the solutions from trapped in the local optimum.\",\"PeriodicalId\":277771,\"journal\":{\"name\":\"2010 IEEE Student Conference on Research and Development (SCOReD)\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Student Conference on Research and Development (SCOReD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCORED.2010.5703998\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Student Conference on Research and Development (SCOReD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCORED.2010.5703998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finite persisting sphere Genetic Algorithm in solving multiobjectives problem
This paper analyzes the performance of Genetic Algorithm using a new concept, namely Finite Persisting Sphere Genetic Algorithm (FPSGA). This algorithm shows the unique method in achieving fast convergence and great diversity for the multiobjective problem. These special characteristics of FPSGA are very useful in order to improve Genetic Algorithm (GA) performance to have great individuals mingling in the area of solution. Besides can help a system to solve a GA problem in a short duration, it can also prevent the solutions from trapped in the local optimum.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
