

浏览全部资源
扫码关注微信
1. 哈尔滨工程大学计算机科学与技术学院,黑龙江,哈尔滨,150001
2. 牡丹江师范学院计算机与信息技术学院,黑龙江,牡丹江,157012
3. 哈尔滨工程大学计算机科学与技术学院,黑龙江,哈尔滨,150001
4. 牡丹江师范学院计算机与信息技术学院,黑龙江,牡丹江,157012
Published:2017
移动端阅览
DING Rui, DONG Hong-bin, XING Wei, et al. An Hierarchic Optimization Algorithm for Curling-Match Multi-constrained Problem[J]. Acta Electronica Sinica, 2017, 45(3): 632-637.
DING Rui, DONG Hong-bin, XING Wei, et al. An Hierarchic Optimization Algorithm for Curling-Match Multi-constrained Problem[J]. Acta Electronica Sinica, 2017, 45(3): 632-637. DOI: 10.3969/j.issn.0372-2112.2017.03.019.
冰壶比赛对阵编排问题是一个难于收敛的多约束优化问题.为此提出一种求解此类问题的逐层优化的单亲遗传算法.首先将待求解问题的多个约束进行分层;其次设计了靶向自交叉算子进行第一层优化以提高搜索效率,设计了定点-随机自交叉算子进行第二层优化以保持种群的多样性;最后,将改进的算法用于解决冰壶比赛对阵编排的多约束优化问题,构建了该问题的适应度函数.仿真实验表明,与粒子群算法和经典遗传算法相比,所提算法能够有效求解冰壶比赛对阵编排的多约束优化问题.
Curling-match design is a multi-constraint optimization problem which is hard to be converged.Therefore
a hierarchic optimization partheno-genetic algorithm is proposed.First
multiple constraint of the problem is layered;then
the targeted self-crossover operator is designed in the first layer optimization to ensure the convergence of the algorithm
while the fixed-random self-crossover operator is designed in the second layer optimization to maintain diversity of the population appropriately;finally
the proposed algorithm is used to solve the problem of curling-match design after building its fitness functions.Compared with the particle swarm algorithm and genetic algorithm
the simulation results demonstrate that the designed algorithm can solve the problem more efficiently.
0
Views
2
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621