共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
3.
4.
5.
进化策略是一类适用于非线性、不可微和多峰值复杂函数的优化方法。提出了基于混合进化策略的非线性系统辨识方法。方法的基本思想是将非线性系统辨识问题转化为参数空间上的函数优化问题,然后应用一种新的混合进化策略对整个参数空间进行搜索以获得系统参数的最优估计。仿真结果显示了该方法的有效性。 相似文献
6.
7.
思维进化计算的描述与研究成果综述 总被引:5,自引:0,他引:5
思维进化计算(Mind Evolutionary Computation,MEC)是孙承意于1998年提出的一种新的进化计算方法。它模仿人类思维申趋同、异化两种思维模式交互作用,推动思维进步的遏程。MEC多方面的性能优越,造是由于采用“趋同”和“异化”操作代替GA的选择、交叉和变异算子以及MEC与GA不同的运行机制:记忆机制、定向机制和探测与开采功能之间的协调机制。本文给出MEC迄今为止最完整的描述。由于篇幅所限,本文仅简单介绍MEC的主要研究成果。 相似文献
8.
9.
一种鲁棒BP算法及其在非线性动态系统辨识中的应用 总被引:4,自引:0,他引:4
利用多层前馈神经网络的非线性建模特性,基于动态BP网络的串并联和并联模型,提出了一种高鲁棒性BP算法,与传统的BP算法相比,鲁棒BP算法有5个优点:(1)适合于非线性动态系统辨识,(2)辨识精度高;(3)不必内插所有训练样本;(4)具有高鲁棒性,能抵制过失误差和量测误差;(5)收敛速度得到了改进,因为错误差样本的影响得到了适度的抑制,把该算法用于非线性动态系统辨识,仿真结果表明此方法是有效的。 相似文献
10.
11.
12.
进化算法在job-shop调度问题中的应用研究 总被引:3,自引:1,他引:2
研究了应用进化算法(遗传算法(GA)和进化规
划(EP))以及混合模拟退火进化算法(SAGA和SAEP)求解job-shop调度问题.仿真实验结果表
明这四种算法是可行的.文中最后对它们的优劣作了比较. 相似文献
13.
A single-point mutation evolutionary programming 总被引:9,自引:0,他引:9
In this paper, we propose an improved evolutionary programming based on single-point mutation, which is named Single-Point Mutation Evolutionary Programming (SPMEP). The distinctions between SPMEP and the classical evolutionary programming (EP) are the single-point mutation for each solution in each iteration and the fixed mutation scheme for deviation η. Simulation results show that SPMEP is obviously superior to the classical EP, fast EP and generalized EP for multimodal and high-dimensional functions. 相似文献
14.
Ensemble strategies with adaptive evolutionary programming 总被引:1,自引:0,他引:1
Mutation operators such as Gaussian, Lévy and Cauchy have been used with evolutionary programming (EP). According to the no free lunch theorem, it is impossible for EP with a single mutation operator to outperform always. For example, Classical EP (CEP) with Gaussian mutation is better at searching in a local neighborhood while the Fast EP (FEP) with the Cauchy mutation performs better over a larger neighborhood. Motivated by these observations, we propose an ensemble approach where each mutation operator has its associated population and every population benefits from every function call. This approach enables us to benefit from different mutation operators with different parameter values whenever they are effective during different stages of the search process. In addition, the recently proposed Adaptive EP (AEP) using Gaussian (ACEP) and Cauchy (AFEP) mutations is also evaluated. In the AEP, the strategy parameter values are adapted based on the search performance in the previous few generations. The performance of ensemble is compared with a mixed mutation strategy, which integrates several mutation operators into a single algorithm as well as against the AEP with a single mutation operator. Improved performance of the ensemble over the single mutation-based algorithms and mixed mutation algorithm is verified using statistical tests. 相似文献
15.
进化规划算法的时间复杂度分析 总被引:2,自引:0,他引:2
进化规划算法是求解连续优化问题的一类进化算法,是进化计算的一个重要分支.在进化规划算法的理论研究上,已有学者证明了其收敛性.然而,进化规划算法的时间复杂度分析是进化计算领域一大难题,目前相关的研究成果很少.基于吸收态Markov过程模型,以期望收敛时间作为研究进化规划算法时间复杂度的指标,提出了进化规划算法期望收敛时间的估算方法,并以此作为算法时间复杂度分析的理论依据.最后分析了Gauss变异进化规划算法的期望收敛时间,作为提出理论的应用举例. 相似文献
16.
《Computers & Operations Research》2002,29(12):1641-1659
Evolutionary algorithms (EAs) have been applied to many optimization problems successfully in recent years. The genetic algorithm (GAs) and evolutionary programming (EP) are two different types of EAs. GAs use crossover as the primary search operator and mutation as a background operator, while EP uses mutation as the primary search operator and does not employ any crossover. This paper proposes a novel EP algorithm for cutting stock problems with and without contiguity. Two new mutation operators are proposed. Experimental studies have been carried out to examine the effectiveness of the EP algorithm. They show that EP can provide a simple yet more effective alternative to GAs in solving cutting stock problems with and without contiguity. The solutions found by EP are significantly better (in most cases) than or comparable to those found by GAs.Scope and purposeThe one-dimensional cutting stock problem (CSP) is one of the classical combinatorial optimization problems. While most previous work only considered minimizing trim loss, this paper considers CSPs with two objectives. One is the minimization of trim loss (i.e., wastage). The other is the minimization of the number of stocks with wastage, or the number of partially finished items (pattern sequencing or contiguity problem). Although some traditional OR techniques (e.g., programming based approaches) can find the global optimum for small CSPs, they are impractical to find the exact global optimum for large problems due to combinatorial explosion. Heuristic techniques (such as various hill-climbing algorithms) need to be used for large CSPs. One of the heuristic algorithms which have been applied to CSPs recently with success is the genetic algorithm (GA). This paper proposes a much simpler evolutionary algorithm than the GA, based on evolutionary programming (EP). The EP algorithm has been shown to perform significantly better than the GA for most benchmark problems we used and to be comparable to the GA for other problems. 相似文献
17.
18.
Genetic Algorithms (GAs) and Evolutionary Programming (EP) are investigated here in both optimization and machine learning. Adaptive and standard versions of the two algorithms are used to solve novel applications in search and rule extraction. Simulations and analysis show that while both algorithms may look similar in many ways their performance may differ for some applications. Mathematical modeling helps in gaining better understanding for GA and EP applications. Proper tuning and loading is a key for acceptable results. The ability to instantly adapt within an unpredictable and unstable search or learning environment is the most important feature of evolution-based techniques such as GAs and EP. 相似文献
19.
前向神经网络参数估计中的进化规划 总被引:3,自引:1,他引:2
人工神经网络在很多领域有着成功的应用。神经网络参数估计有许多训练算法,BP算法是前向多层神经网络的典型算法,但BP算法有时会陷入局部最小解。进化规划是一种随机优化技术,它可以发现全局最优解。文章介绍了进化规划在前向多层神经网络参数估计中的应用,结合具体例子给出了算法实现的具体操作步骤和实验结果。实验数据表明采用进化规划得到的网络参数是最优的,神经网络的性能优于基于BP算法的神经网络性能。 相似文献