期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Input Data Dependency of a Genetic Algorithm to Solve the Set Covering Problem 认领 引用
1
作者 Kakuzo Iwamura Makoto Horiike Tomoya Sibahara 《Tsinghua Science and Technology》 EI CAS 2003年第1期14-18,共5页
A genetic algorithm to solve the set covering problem proposed in the literature had some improvements which gave better solutions, i.e., better chromosomes in the first starting population, taking full account of dom... A genetic algorithm to solve the set covering problem proposed in the literature had some improvements which gave better solutions, i.e., better chromosomes in the first starting population, taking full account of domain specific knowledge with sound programming skill. We have further investigated the input data dependency of their genetic algorithm, i.e., the dependency on costs and density. We have found that for input problem data sets with densities greater than or equal to 3%, our genetic algorithm is still practical both in computing time and approximation ratio. 展开更多
关键词 input data dependency set covering problem genetic algorithm
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈