Genetic-entropic algorithm in NK-model

Chang-Yong Lee, S. Han
{"title":"Genetic-entropic algorithm in NK-model","authors":"Chang-Yong Lee, S. Han","doi":"10.1109/ICEC.1997.592263","DOIUrl":null,"url":null,"abstract":"A new combinatorial optimization algorithm, genetic entropic algorithm, is proposed. To test the algorithm, we adopt the NK model and compare the performances of the genetic entropic algorithm with those of the conventional genetic algorithm. The higher the K value, the better this algorithm performs. The characteristics of this algorithm together with the difference between two algorithms are discussed.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A new combinatorial optimization algorithm, genetic entropic algorithm, is proposed. To test the algorithm, we adopt the NK model and compare the performances of the genetic entropic algorithm with those of the conventional genetic algorithm. The higher the K value, the better this algorithm performs. The characteristics of this algorithm together with the difference between two algorithms are discussed.
nk模型中的遗传熵算法
提出了一种新的组合优化算法——遗传熵算法。为了验证该算法,我们采用NK模型,并将遗传熵算法与传统遗传算法的性能进行了比较。K值越高,该算法的性能越好。讨论了该算法的特点以及两种算法的区别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信