| A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on average capacity knapsack (CPCI-S收录) | |
| He, Jun[1]; Zhou, Yuren[2] | |
| 会议名称 | ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS |
| 关键词 | genetic algorithms constrained optimization knapsack problem computation time performance analysis |
| URL标识 | 查看原文 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2101461 |
| 专题 | 华南理工大学 |
| 作者单位 | 1.[1]Univ Birmingham, Sch Comp Sci, CERCIA, Birmingham B15 2TT, W Midlands, England 2.[2]South China Univ Technol, Guangzhou, Guangdong, Peoples R China |
| 推荐引用方式 GB/T 7714 | He, Jun[1],Zhou, Yuren[2]. A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on average capacity knapsack (CPCI-S收录)[C]. 见:ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论