首页 | 本学科首页   官方微博 | 高级检索  
     

一种求解冰壶比赛对阵多约束问题的逐层优化算法
引用本文:丁蕊,董红斌,邢薇,刘文杰,孔飞.一种求解冰壶比赛对阵多约束问题的逐层优化算法[J].电子学报,2017,45(3):632.
作者姓名:丁蕊  董红斌  邢薇  刘文杰  孔飞
作者单位:1. 哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨150001;牡丹江师范学院计算机与信息技术学院,黑龙江牡丹江157012;2. 哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨,150001
基金项目:国家自然科学基金资助项目,黑龙江省教育厅智能教育与信息工程重点实验室开放基金支持,牡丹江师范学院青年项目
摘    要:冰壶比赛对阵编排问题是一个难于收敛的多约束优化问题.为此提出一种求解此类问题的逐层优化的单亲遗传算法.首先将待求解问题的多个约束进行分层;其次设计了靶向自交叉算子进行第一层优化以提高搜索效率,设计了定点-随机自交叉算子进行第二层优化以保持种群的多样性;最后,将改进的算法用于解决冰壶比赛对阵编排的多约束优化问题,构建了该问题的适应度函数.仿真实验表明,与粒子群算法和经典遗传算法相比,所提算法能够有效求解冰壶比赛对阵编排的多约束优化问题.

关 键 词:冰壶对阵多约束优化  单亲遗传算法  逐层优化  靶向自交叉  定点-随机自交叉
收稿时间:2015-08-03

An Hierarchic Optimization Algorithm for Curling-Match Multi-constrained Problem
DING Rui,DONG Hong-bin,XING Wei,LIU Wen-jie,KONG Fei.An Hierarchic Optimization Algorithm for Curling-Match Multi-constrained Problem[J].Acta Electronica Sinica,2017,45(3):632.
Authors:DING Rui  DONG Hong-bin  XING Wei  LIU Wen-jie  KONG Fei
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.
Keywords:curling-match multi-constrained optimization  partheno-genetic algorithm  hierarchic optimization  targeted self-crossover  fixed-random self-crossover
本文献已被 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号