| 适应度平均选择的离散差分演化算法 |
| |
| 引用本文： | 周雅兰,朱耀辉.适应度平均选择的离散差分演化算法[J].小型微型计算机系统,2012,33(1):151-154. |
| |
| 作者姓名： | 周雅兰 朱耀辉 |
| |
| 作者单位： | 1. 广东商学院信息学院,广州,510320
2. 中山大学信息科学与技术学院,广州,510006 |
| |
| 基金项目： | 国家自然科学基金项目(60905038,60873198)资助;广东高校优秀青年创新人才培养计划(育苗工程)项目(LYM09085)资助;广东商学院科研创新团队建设计划项目资助;广东商学院校级科研项目(08BS52001)资助 |
| |
| 摘 要： | 如何将差分演化算法用于离散领域是该领域的一个重要问题.提出一种适应度平均选择的离散差分演化算法,提出的算法中每个个体有均等的机会被选择用于引导算法的进化,这种选择方式有助于克服贪婪选择操作导致的种群多样性下降过快而使算法易陷入局部最优的问题.最后在多维背包问题上的实验结果表明提出的算法具有良好性能.
|
| 关 键 词： | 离散差分演化算法 适应度平均选择 多维背包问题 组合优化问题 |
Discrete Differential Evolution with Fitness Uniform Selection Scheme |
| |
| ZHOU Ya-lan
,
ZHU Yao-hui.Discrete Differential Evolution with Fitness Uniform Selection Scheme[J].Mini-micro Systems,2012,33(1):151-154. |
| |
| Authors: | ZHOU Ya-lan ZHU Yao-hui |
| |
| Affiliation: | 1(School of Information,Guangdong University of Business Studies,Guangzhou 510320,China) 2(School of Information Science and Technology,Sun Yat-sen University,Guangzhou 510006,China) |
| |
| Abstract: | How to apply differential evolution to the discrete field is an important problem.A discrete differential evolution with fitness uniform selection scheme is proposed.In the proposed algorithm,each individual has an equal chance of being selected to guide the algorithm evolve.The selection scheme helps avoid the local optimum problem which is led to by the population diversity rapidly decrease of the greedy selection.Simulation results on multidimensional knack problem show that the proposed algorithm has good performance. |
| |
| Keywords: | discrete differential evolution fitness uniform selection scheme multidimensional knack problem combinatorial optimization problems |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
