Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Electronica Sinica》 2017-03
Add to Favorite Get Latest Update

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

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;  
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.
【Fund】: 国家自然科学基金资助项目(No.61472095 No.61272186);; 黑龙江省教育厅智能教育与信息工程重点实验室开放基金支持;; 牡丹江师范学院青年项目(No.QY2014003 No.QN201603)
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved