- 1、本文档共8页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
字典序进化算法用于组合优化问题 - 控制理论与应用
27 4 Vol. 27 No. 4
2010 4 Control Theory Applications Apr. 2010
: 1000−8152(2010)04−0473−08
1,2 1 1
,
(1. , 410083; 2. , 411105)
: ,
, ,
. ,, ,
. , , .
, , ,
. 1.
.
: ; ; ;
: TP301 : A
Evolutionary strategy of lexicographic order for combinational problem
1,2 1 1
XIAO Chi-xin , CAI Zi-xing , WANG Yong
(1. School of Information Science and Engineering, Central South University, Changsha Hunan 410083, China;
2. Information Engineering College, Xiangtan University, Xiangtan Hunan 411105, China)
Abstract: In order to construct a fast and effective algorithm to solve large-scale combinational problems in desirable
computational time rather than be trapped in weakness as some existing algorithms, a novel encoding approach is proposed
in this paper which applies an one to one mapping from a discrete space to a continuous integer section. Assembled with
successful exploration and exploitation mechanism of evolutionary strategy, the performances of the algorithm are largely
promoted. Since the one to one mapping between codes and combinational vectors, the new scheme only provides feasible
solutions, which can help to avoid redundant computation existing in some algorithms effectively and the search space is
further reduced. Secondly, a queue of elites is added in evolutionary mechanism combined with some particular learning
strategy. The queue is refreshed frequently in evolution. This can help the algorithm to maintain better gene blocks.
文档评论(0)