{"title":"合作伙伴选择中的多目标优化","authors":"Xuesen Ma, Jianghong Han, Zhengfeng Hou, Zhenchun Wei","doi":"10.1109/ICNC.2007.485","DOIUrl":null,"url":null,"abstract":"It is a typical multi-objective optimization problem for the scientific decision of bidding to seek cooperating partner in virtual enterprise. With the optimization model proposed, partner selection is solved by the improved genetic algorithm. In the evolution process, individual survive rate is dynamic according to queue of individuals 'fitness values before roulette wheel selection, avoiding premature convergence. Crossover and mutation operators are accordingly adaptive to fitness value and iterative degree, which endows individuals with self- adaptability with the variation of the environment. Finally, the example demonstrates the validity of the adaptive genetic algorithm.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"296 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective Optimization in Partner Selection\",\"authors\":\"Xuesen Ma, Jianghong Han, Zhengfeng Hou, Zhenchun Wei\",\"doi\":\"10.1109/ICNC.2007.485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is a typical multi-objective optimization problem for the scientific decision of bidding to seek cooperating partner in virtual enterprise. With the optimization model proposed, partner selection is solved by the improved genetic algorithm. In the evolution process, individual survive rate is dynamic according to queue of individuals 'fitness values before roulette wheel selection, avoiding premature convergence. Crossover and mutation operators are accordingly adaptive to fitness value and iterative degree, which endows individuals with self- adaptability with the variation of the environment. Finally, the example demonstrates the validity of the adaptive genetic algorithm.\",\"PeriodicalId\":250881,\"journal\":{\"name\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"volume\":\"296 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2007.485\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Natural Computation (ICNC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2007.485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
It is a typical multi-objective optimization problem for the scientific decision of bidding to seek cooperating partner in virtual enterprise. With the optimization model proposed, partner selection is solved by the improved genetic algorithm. In the evolution process, individual survive rate is dynamic according to queue of individuals 'fitness values before roulette wheel selection, avoiding premature convergence. Crossover and mutation operators are accordingly adaptive to fitness value and iterative degree, which endows individuals with self- adaptability with the variation of the environment. Finally, the example demonstrates the validity of the adaptive genetic algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
