共查询到19条相似文献,搜索用时 109 毫秒
1.
2.
为了改善人工神经网络在优化计算中的一些缺陷和提高遗传算法的局部搜索能力及收敛性能,提出了一种混合智能学习算法,采用遗传算法和误差反向传播算法(BP算法)相结合,将BP算法以一个算子的形式插入到遗传算法中,以提高利用人工神经网络和遗传算法进行优化计算的搜索能力和收敛性能;通过对实例函数的优化计算,对插入BP算子的遗传算法和传统遗传算法的优化结果进行了比较分析,结果表明BP算子的插入对遗传算法的优化性能、收敛速度和收敛精度有较大改善. 相似文献
3.
一种基于遗传算法的无线传感器网络节点优化方法 总被引:5,自引:1,他引:4
针对基于无线传感器网络的测控系统的特殊性,提出了在满足测控节点连通约束条件下使节点数量最少的模型,并采用遗传算法进行优化计算.为了提高节点多时的收敛速度,提出了基于二分法的遗传算法,结果表明该算法可以大大减少染色体长度.提高优化收敛速度,最后给出了实例. 相似文献
4.
为了更有效地抑制标准遗传算法 (SGA)中的早熟收敛现象和提高收敛速度 ,提出了一种基于有性繁殖的遗传算法 .该算法借鉴了自然界最常见的有性繁殖现象 ,首先将每个个体编码为配对的双染色体码串 ,并增加性别染色体编码 ,以建立遗传个体的性别特征 ;然后 ,通过建立有性遗传进化算子来对不同性别的个体赋予不同的进化控制参数 ,以使得雄性个体具有较强的全局探索能力 ,而使雌性个体具有较强的局部快速寻优能力 ,最后通过建立对应的有性遗传交叉、变异算子 ,使得这种基于有性繁殖的遗传算法具有更强的全局寻优能力和快速收敛能力 .用该算法对一系列典型函数和其他优化问题进行了优化计算试验 ,结果证明 ,该算法不易陷入早熟收敛 ,且全局搜索能力和局部搜索能力平衡较好 ,收敛速度快 ,同时也验证了这种基于有性繁殖的遗传算法的有效性和优良性能 . 相似文献
5.
K-means算法是聚类分析中的一种经典算法,但是K-means算法是一种局部搜索技术,受初始聚类中心的影响可能会过早收敛于最优解.而遗传算法具有良好的全局优化的能力,将遗传算法与K-means算法结合起来,能很好解决这一问题.在结合的过程中,又在最传统的遗传算法中改进染色体编码与适应度函数,从而优化k个中心点的选取,... 相似文献
6.
改进的量子遗传算法及应用 总被引:5,自引:1,他引:4
针对量子遗传算法在函数优化中迭代次数多,容易陷入局部最优解等缺点,提出新的量子遗传算法.该算法的核心是采用新的量子旋转门调整策略对种群进行更新操作,有效保证了种群的多样性,可以避免算法陷入局部最优解,提高了算法的全局寻优能力.同时能以更快的速度收敛于全局最优解.通过对典型复杂函数测试,计算结果表明,提出的算法优化质量和效率都要优于传统遗传算法和一般量子遗传算法. 相似文献
7.
使用遗传算法求解作业车间调度问题时,为了获得最优解,提高算法的收敛速度,提出了改进遗传算法.算法以最小化最大完工时间为优化目标,初始化时将种群规模扩大为原来的两倍以增加种群多样性;迭代时使用新的适应度函数让染色体间更易区分;通过轮盘赌法完成染色体选择;用POX(Precedence Operation Crossover)交叉算子完成交叉操作;用互换法完成变异操作;通过具有自我调节能力的交叉和变异概率不断地调整概率值来提高算法寻优能力和收敛速度.仿真结果表明,改进后的遗传算法收敛速度快,寻优能力强,获得的最优解优于标准遗传算法,更适用于作业车间的加工生产. 相似文献
8.
9.
10.
传统遗传算法很早就在列车运行优化研究中得到了应用,但是由于种群中染色体进化方向的不确定性和局部搜索能力不足,导致收敛速度缓慢和求解质量低下。针对以上问题,本文提出一种改进型遗传算法,对列车运行曲线的生成进行研究。以列车运行能耗最小为优化目标,将行车安全、准点和精确停车等约束条件转化为惩罚函数,同时以工况序列为遗传个体进行求解,为加快种群收敛速度和提高解的质量,设计包含准点调整和局部搜索的种群进化方向引导机制。仿真结果表明,改进后的算法适用于多约束的列车运行优化问题,有效提升了收敛速度,优化结果相比于简单遗传算法和自适应遗传算法更加节能。 相似文献
11.
一种改进的最优保存遗传算法 总被引:5,自引:0,他引:5
在已有的研究工作基础上,给出了一种改进的最优保存遗传算法,研究了算法的全局收敛性和收敛速度,并给出了收敛性证明.数值实验表明.该算法能够有效的求解全局优化问题. 相似文献
12.
The commonly used genetic algorithm (GA)-based methods have some shortcomings in applications such as time-consuming and slow convergence. A novel enhanced genetic algorithm (EGA) technique is developed in this paper to overcome these problems in classical GA methods so as to provide a more efficient technique for system training and optimization. Two approaches are proposed in the EGA technique: Firstly, a novel group-based branch crossover operator is suggested to thoroughly explore local space and speed up convergence. Secondly, an enhanced MPT (Makinen-Periaux-Toivanen) mutation operator is proposed to promote global search capability. The effectiveness of the developed EGA is verified by simulations based on a series of benchmark test problems. The EGA technique is also implemented to train a neural-fuzzy predictor for real-time gear system monitoring. Test results show that the branch crossover operator and enhanced MPT mutation operator can effectively improve the convergence speed and global search capability. The EGA technique outperforms other related GA methods with respect to convergence speed and global search capability. 相似文献
13.
保留精英遗传算法收敛性和收敛速度的鞅方法分析 总被引:1,自引:0,他引:1
论文引入鞅方法取代传统的马尔科夫链理论,研究保留精英遗传算法(EGA)的收敛条件和收敛速度.通过把EGA的最大适应值函数过程描述为下鞅,基于下鞅收敛定理构造使算法满足几乎处处收敛的充分条件,分析了概率1收敛充分条件与算法操作参数的关系,并计算了EGA获得全局最优解所需的最大进化代数.使用鞅方法分析遗传算法收敛性具有独特的优势,成为分析遗传算法收敛性及其性能的新方法. 相似文献
14.
Mahdi Saadatmand-Tarzjan Hamid Abrishami Moghaddam 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2007,37(1):139-153
Optimization of content-based image indexing and retrieval (CBIR) algorithms is a complicated and time-consuming task since each time a parameter of the indexing algorithm is changed, all images in the database should be indexed again. In this paper, a novel evolutionary method called evolutionary group algorithm (EGA) is proposed for complicated time-consuming optimization problems such as finding optimal parameters of content-based image indexing algorithms. In the new evolutionary algorithm, the image database is partitioned into several smaller subsets, and each subset is used by an updating process as training patterns for each chromosome during evolution. This is in contrast to genetic algorithms that use the whole database as training patterns for evolution. Additionally, for each chromosome, a parameter called age is defined that implies the progress of the updating process. Similarly, the genes of the proposed chromosomes are divided into two categories: evolutionary genes that participate to evolution and history genes that save previous states of the updating process. Furthermore, a new fitness function is defined which evaluates the fitness of the chromosomes of the current population with different ages in each generation. We used EGA to optimize the quantization thresholds of the wavelet-correlogram algorithm for CBIR. The optimal quantization thresholds computed by EGA improved significantly all the evaluation measures including average precision, average weighted precision, average recall, and average rank for the wavelet-correlogram method. 相似文献
15.
16.
17.
18.
《Advanced Engineering Informatics》2005,19(4):255-262
Application of genetic algorithms to optimization of complex problems can lead to a substantial computational effort as a result of the repeated evaluation of the objective function(s) and the population-based nature of the search. This is often the case where the objective function evaluation is costly, for example, when the value is obtained following computationally expensive system simulations. Sometimes a substantially large number of generations might be required to find optimum value of the objective function. Furthermore, in some cases, genetic algorithm can face convergence problems. In this paper, a hybrid optimization algorithm is presented which is based on a combination of the neural network and the genetic algorithm. In the proposed algorithm, a back-propagation neural network is used to improve the convergence of the genetic algorithm in search for global optimum. The efficiency of the proposed computational methodology is illustrated by application to a number of test cases. The results show that, in the proposed hybrid method, the integration of the neural network in the genetic algorithm procedure can accelerate the convergence of the genetic algorithm significantly and improve the quality of solution. 相似文献