节点文献

一种求解冰壶比赛对阵多约束问题的逐层优化算法

An Hierarchic Optimization Algorithm for Curling-Match Multi-constrained Problem

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 丁蕊董红斌邢薇刘文杰孔飞

【Author】 DING Rui;DONG Hong-bin;XING Wei;LIU Wen-jie;KONG Fei;College of Computer Science and Technology,Harbin Engineering University;School of Computer and Information Technology,Mudanjiang Normal University;

【机构】 哈尔滨工程大学计算机科学与技术学院牡丹江师范学院计算机与信息技术学院

【摘要】 冰壶比赛对阵编排问题是一个难于收敛的多约束优化问题.为此提出一种求解此类问题的逐层优化的单亲遗传算法.首先将待求解问题的多个约束进行分层;其次设计了靶向自交叉算子进行第一层优化以提高搜索效率,设计了定点-随机自交叉算子进行第二层优化以保持种群的多样性;最后,将改进的算法用于解决冰壶比赛对阵编排的多约束优化问题,构建了该问题的适应度函数.仿真实验表明,与粒子群算法和经典遗传算法相比,所提算法能够有效求解冰壶比赛对阵编排的多约束优化问题.

【Abstract】 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.

【基金】 国家自然科学基金资助项目(No.61472095,No.61272186);黑龙江省教育厅智能教育与信息工程重点实验室开放基金支持;牡丹江师范学院青年项目(No.QY2014003,No.QN201603)
  • 【文献出处】 电子学报 ,Acta Electronica Sinica , 编辑部邮箱 ,2017年03期
  • 【分类号】TP18
  • 【被引频次】3
  • 【下载频次】300
节点文献中: 

本文链接的文献网络图示:

本文的引文网络