期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
基于改进自监督学习群体智能(ISLCI)的高性能聚类算法 被引量:7
1
作者 曾令伟 伍振兴 杜文才 《重庆邮电大学学报(自然科学版)》 CSCD 北大核心 2016年第1期131-137,共7页
针对现有数据聚类算法(如K-means)易陷入局部最优和聚类质量不佳的问题,提出一种结合改进自监督学习群体智能(improved self supervised learning collection intelligence,ISLCI)和K均值(K-means)的高性能聚类算法。已有的自监督学习... 针对现有数据聚类算法(如K-means)易陷入局部最优和聚类质量不佳的问题,提出一种结合改进自监督学习群体智能(improved self supervised learning collection intelligence,ISLCI)和K均值(K-means)的高性能聚类算法。已有的自监督学习群体智能演化方案具有计算效率和聚类质量高的优点,但当应用于数据聚类时,收敛速度较慢且极易陷入局部最优。为ISLCI加入突变操作,增加其样本多样性来降低早熟的概率,提高最优解的求解质量;计算每个样本的行为方程,获得其行为结果;通过轮盘赌方案来选择群体智能学习的对象和群体中其他样本学习目标对象的属性来提高自己。同时,利用K-means操作提高其收敛速度,提高算法计算效率。对比试验结果表明,本算法具有收敛速度快、聚类质量高、不易陷入局部最优的特点。 展开更多
关键词 自监督学习群体智能 数据聚类 突变操作 簇内距离 函数评价次数
下载PDF
基于生物地理学优化算法的输电网络规划 被引量:17
2
作者 李翔硕 王淳 《电网技术》 EI CSCD 北大核心 2013年第2期477-481,共5页
随着栖息地居住条件的变化,生物物种在各个栖息地之间不断迁移。将根据自然界物种迁移规律构造的生物地理学优化算法(biogeography-based optimization,BBO)应用于求解输电网络规划问题。针对BBO算法开采能力较强而搜索能力偏弱的特点,... 随着栖息地居住条件的变化,生物物种在各个栖息地之间不断迁移。将根据自然界物种迁移规律构造的生物地理学优化算法(biogeography-based optimization,BBO)应用于求解输电网络规划问题。针对BBO算法开采能力较强而搜索能力偏弱的特点,采用排重操作对其进行改进。以18节点系统为算例,对各种机制作用下的BBO算法的寻优能力以及与遗传算法的性能差别进行了对比分析。结果显示包含排重操作的BBO算法为兼顾了开发能力和搜索能力、可与遗传算法比拟的寻优方法。 展开更多
关键词 输电网络规划 生物地理学优化算法 迁移模型 突变操作
下载PDF
基于生物地理学优化算法的电力系统无功优化
3
作者 孙佳 高元海 王淳 《南昌大学学报(工科版)》 CAS 2013年第4期380-384,391,共6页
将模拟物种迁移规律的生物地理学优化算法(BBO)应用于求解电力系统无功优化问题。区别于遗传算法中局限于染色体两两之间分享特征信息的模式,BBO独特的迁移模式使得好的栖息地特征信息得以在多个栖息地之间广泛传播,从而加快了优化进程... 将模拟物种迁移规律的生物地理学优化算法(BBO)应用于求解电力系统无功优化问题。区别于遗传算法中局限于染色体两两之间分享特征信息的模式,BBO独特的迁移模式使得好的栖息地特征信息得以在多个栖息地之间广泛传播,从而加快了优化进程。IEEE 14节点和IEEE 57节点的测试结果表明:BBO算法在与相关文献中的算法相当的迭代次数内能够得到更优的解,且算法对参数的依赖性不强,适用于求解电力系统无功优化这一类复杂的工程组合优化问题。 展开更多
关键词 生物地理学算法 迁移操作 突变操作 电力系统无功优化
下载PDF
Flow shop rescheduling problem under rush orders 被引量:2
4
作者 胡燕海 严隽琪 +1 位作者 叶飞帆 于军合 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2005年第10期1040-1046,共7页
In the environment of customization, disturbances such as rush orders and material shortages often occur in the manufacturing system, so rescheduling is necessary for the manufacturing system. The rescheduling methodo... In the environment of customization, disturbances such as rush orders and material shortages often occur in the manufacturing system, so rescheduling is necessary for the manufacturing system. The rescheduling methodology should be able to dispose of the disturbance efficiently so as to keep production going smoothly. This aims researching flow shop rescheduling problem (FSRP) necessitated by rush orders. Disjunctive graph is employed to demonstrate the FSRP. For a flow shop processing n jobs, after the original schedule has been made, and z out of n jobs have been processed in the flow shop, x rush orders come, so the original n jobs together with x rush orders should be rescheduled immediately so that the rush orders would be processed in the shortest time and the original jobs could be processed subject to some optimized criteria. The weighted mean flow time of both original jobs and rush orders is used as objective function. The weight for rush orders is much bigger than that of the original jobs, so the rush orders should be processed early in the new schedule. The ant colony optimization (ACO) algorithm used to solve the rescheduling problem has a weakness in that the search may fall into a local optimum. Mutation operation is employed to enhance the ACO performance. Numerical experiments demonstrated that the proposed algorithm has high computation repeatability and efficiency. 展开更多
关键词 Flow shop rescheduling Dynamic scheduling Rush order Ant colony optimization Mutation operation
下载PDF
Strategies used for genetically modifying bacterial genome: site-directed mutagenesis, gene inactivation, and gene over-expression
5
作者 Jian-zhong XU Wei-guo ZHANG 《Journal of Zhejiang University-Science B(Biomedicine & Biotechnology)》 SCIE CAS CSCD 2016年第2期83-99,共17页
With the availability of the whole genome sequence of Escherichia coli or Corynebacterium glutamicum, strategies for directed DNA manipulation have developed rapidly. DNA manipulation plays an important role in unders... With the availability of the whole genome sequence of Escherichia coli or Corynebacterium glutamicum, strategies for directed DNA manipulation have developed rapidly. DNA manipulation plays an important role in understanding the function of genes and in constructing novel engineering bacteria according to requirement. DNA manipulation involves modifying the autologous genes and expressing the heterogenous genes. Two alternative approaches, using electroporation linear DNA or recombinant suicide plasmid, allow a wide variety of DNA manipulation. However, the over-expression of the desired gene is generally executed via plasmid-mediation. The current review summarizes the common strategies used for genetically modifying E. coli and C. glutamicum genomes, and discusses the technical problem of multi-layered DNA manipulation. Strategies for gene over-expression via integrating into genome are proposed. This review is intended to be an accessible introduction to DNA manipulation within the bacterial genome for novices and a source of the latest experimental information for experienced investigators. 展开更多
关键词 Escherichia coli Corynebacterium glutamicum DNA manipulation Site-directed mutagenesis Gene inactivation Gene over-expression
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部