| 一种求解多目标组合优化的遗传局部搜索算法 |
| |
| 引用本文： | 杨开兵,刘晓冰.一种求解多目标组合优化的遗传局部搜索算法[J].计算机应用与软件,2009,26(8):16-17,119. |
| |
| 作者姓名： | 杨开兵 刘晓冰 |
| |
| 作者单位： | 1. 大连理工大学CIMS中心,辽宁,大连,116024;大连工业大学信息科学与工程学院,辽宁,大连,116034
2. 大连理工大学CIMS中心,辽宁,大连,116024 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 为改善遗传算法求解多目标组合优化问题的搜索效率,提出一种新的遗传局部搜索算法.算法采取非劣解并行局部搜索策略以及基于分散度的精英选择策略,并采用基于NSGA-Ⅱ的适应度赋值方式和二元赌轮选择操作,以提高算法收敛性,保持群体多样性.实验结果表明,新算法能够产生数量较多分布较广的近似Pareto最优解.
|
| 关 键 词： | 多目标组合优化 适应度赋值 局部搜索 |
A GENETIC LOCAL SEARCH ALGORITHM FOR MULTI-OBJECTIVE COMBINATORIAL OPTIMIZATION |
| |
| Yang Kaibing,Liu Xiaobing.A GENETIC LOCAL SEARCH ALGORITHM FOR MULTI-OBJECTIVE COMBINATORIAL OPTIMIZATION[J].Computer Applications and Software,2009,26(8):16-17,119. |
| |
| Authors: | Yang Kaibing Liu Xiaobing |
| |
| Affiliation: | CIMS Center;Dalian University of Technology;Dalian 116024;Liaoning;China;College of Information Science and Engineering;Dalian Polytechnic University;Dalian 116034;China |
| |
| Abstract: | In order to improve the search efficiency of genetic algorithms for solving multi-objective combinatorial optimization problems,a new genetic local search algorithm is proposed.The method uses a non-inferior solution parallel local search strategy and dispersity-based elitist selection strategy,and adopts NSGA-II based fitness assignment and binary roulette selection operation to improve the convergence of the algorithm and preserve the diversity in the population.The experimental results show that the prop... |
| |
| Keywords: | Multi-objective combinatorial optimization Fitness assignment Local search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
