基于迁移学习灰支持向量回归机的交互式进化计算

针对机器感知评价和种群进化,提出基于迁移学习灰支持向量回归机的个体适应值预测方法和聚类进化策略.通过共享用户已评价个体适应值学习模型与部分未评价个体适应值学习模型,实现知识模型差异最小化.建立具有迁移学习能力的灰支持向量回归机模型,预测未评价个体适应值.基于聚类子集计算个体平均距离,并设计选择算子和交叉算子,扩大子代搜索区域,增强种群多样性.基于上述策略,采用NSGA-II范式实现交互式进化计算.最后,分析算法时间复杂度,表明算法可提高评价精度,并克服局部收敛问题.将该算法应用于室内灯光调色问题,验证所提出方法的有效性.     

基于个体适应值灰模型的交互式遗传算法

为将交互式遗传算法应用于复杂的优化问题中,提出一种基于进化个体适应值灰模型预测的交互式遗传算法,为每代适应值序列建立灰模型,以衡量个体适应值评价的不确定性,通过对灰模型的灰预测,提取进化个体评价的可信度,在此基础上,给出进化个体适应值修正公式,将该算法应用于服装进化设计系统中。实验结果表明,该算法在每代都能获取更多的满意解。     

改进粒子群算法优化支持向量机的短期负荷预测

针对支持向量回归机在预测建模中的参数选取问题,提出一种基于混沌自适应策略的粒子群优化支持向量回归机参数的方法.采用混沌映射算法和聚合度自适应判断策略,增强种群的全局寻优性能,提升粒子的多样性,从而避免种群过早收敛.充分考虑天气、节假日、居民消费等因素的影响,提出一种改进的支持向量回归机预测模型并与粒子群算法的支持向量回...     

融合协同进化人工鱼群算法和SVM的雾霾预测方法

针对日益严重的雾霾污染问题,提出融合协同进化人工鱼群算法和支持向量机的雾霾预测方法.首先,运用佳点集构造均匀分布的种群,并引入自适应视野范围策略、自适应步长策略、种群间协同策略,提出协同进化人工鱼群算法.然后,使用协同进化人工鱼群算法,优化支持向量机的主要参数.最后,构建基于支持向量机的雾霾预测模型,预测雾霾天气.在10个测试函数上的实验证明协同进化人工鱼群算法的性能,在6个UCI数据集上的实验验证预测模型的稳定性和有效性.     

基于进化个体适应值灰度的自适应交互式遗传算法

为将交互式遗传算法成功应用于复杂优化问题,有必要提高交互式遗传算法的性能。提出基于进化个体适应值灰度的交互式遗传算法,该算法采用灰度衡量进化个体的适应值评价不确定性;通过适应值区间的分析,提取反映进化种群分布的信息;基于此,给出了进化个体的交叉和变异概率。将该算法应用于服装进化设计系统,结果表明该算法在每代可以获取更多的满意解。     

基于差分进化算法的支持向量回归机参数优化

支持向量机是结构风险最小化原理的一种新型学习技术,被广泛应用到很多工业控制领域中,良好的泛化能力和预测精度在很大程度上受到参数选取的影响.传统参数选择方法易陷入局部最优,为提高优化识别参数的精度和效率,提出基于差分进化算法的支持向量回归机参数优化算法.以均方误差最小为优化准则,差分进化算法的全局寻优能力,搜索支持向量回归机的最优参数组合,达到对参数的最优选择.通过Matlab进行仿真实验,结果表明改进的算法不仅加快参数搜索和优化的速度,而且选择的最优参数能大大提高支持向量机预测精度和泛化能力,并具有良好的鲁棒性和较强的全局寻优能力.     

基于进化个体模糊适应值估计的交互式遗传算法

采用大规模种群进化优化策略,根据用户评价时间和单一数值适应值估计个体模糊适应值;根据个体表现型属性和参照个体模糊适应值宽度计算个体表现型相似度;利用个体表现型相似度对种群聚类并估计未评价个体的模糊适应值;基于个体模糊适应值和表现型相似性构造个体选择适应值,实现个体相似性选择.将所提出方法应用于室内挂钟进化设计,并与已有典型方法进行比较.结果表明,所提出方法在提高优化质量、减轻用户疲劳、提高搜索效率等方面均具有优越性.     

基于改进灰狼算法优化多核支持向量回归机及其应用

为更好发现数据中的复杂规律,避免核函数选择的盲目性和局部最优等非线性优化问题,本文提出一种基于改进灰狼算法优化多核支持向量回归机算法.首先,基于全局核函数和局部核函数构建多核支持向量机采油速度预测模型;其次,利用基于云模型和二次插值算法改进灰狼优化算法对核函数权值和参数的选取进行优化;最后,应用灰色关联分析理论确定采油速度影响因素集,并作为多核支持向量回归机预测模型的输入.与6种采油速度预测方法进行对比,所提方法具有较好的全局寻优能力和较高的预测率的优点.     

基于离散适应值灰度的交互式遗传算法

针对交互式遗传算法缺乏衡量评价不确定性的问题,采用离散适应值评价进化个体,利用灰度衡量评价的不确定性。通过确定离散适应值的灰度,获得反映种群进化分布的信息;基于此,给出了进化个体的自适应交叉和变异概率。将该算法应用于服装进化设计系统,仿真实例与分析结果表明,所提出的算法可以有效缓解人的疲劳,提高优化效率。     

混合性能指标优化问题的大种群规模进化算法

混合性能指标优化问题可结合传统遗传算法和交互式遗传算法求解, 而种群规模和人机评价任务分配是影响算法性能的关键. 针对该问题, 本文提出一种新的进化优化算法. 首先, 采用大规模种群, 扩大搜索范围, 以增强算法的探索能力; 然后, 根据计算机和用户完成任务耗时的比值, 确定每代用户评价的个体数, 以提高计算机的使用效率; 接着, 采用K–均值聚类方法和基于相似度的估计策略, 以减轻用户疲劳; 最后, 采用Pareto占优比较不同个体的优劣, 使得最优解有较好的显式性能指标值和隐式性能指标值. 将本文算法应用于室内布局这一混合性能指标优化问题, 结果验证了所提算法的有效性.     

Interactive Evolutionary Multiobjective Search and Optimization of Set-Based Concepts

This paper deals with interactive concept-based multiobjective problems (IC-MOPs) and their solution by an evolutionary computation approach. The presented methodology is motivated by the need to support engineers during the conceptual design stage. IC-MOPs are based on a nontraditional concept-based approach to search and optimization. It involves conceptual solutions, which are represented by sets of particular solutions, with each concept having a one-to-many relation with the objective space. Such a set-based concept representation is most suitable for human–computer interaction. Here, a fundamental type of IC-MOPs, namely, the Pareto-directed one, is formally defined, and its solution is presented. Next, a new interactive concept-based multiobjective evolutionary algorithm is introduced, and measures to assess its resulting fronts are devised. Finally, the proposed approach and the suggested search algorithm are studied using both academic test functions and an engineering problem.      

A self-adaptive linear evolutionary algorithm for solving constrained optimization problems

In many real-world applications of evolutionary algorithms, the fitness of an individual requires a quantitative measure. This paper proposes a self-adaptive linear evolutionary algorithm (ALEA) in which we introduce a novel strategy for evaluating individual’s relative strengths and weaknesses. Based on this strategy, searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify ‘good’ individuals of the performance for a multiobjective optimization application, regardless of original space complexity. This is considered as our main contribution. In addition, the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase, namely, crossover and mutation. Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective, and provides good performance in terms of uniformity and diversity of solutions.     

面向多目标优化的适应度共享免疫克隆算法

多目标优化的日标在于使得解集能够快速的逼近真实Pareto前沿.针对解的分布性问题,以免疫克隆算法为框架,引入适应度共享策略,提出了一种新的具有良好分布性保持的多目标优化进化算法;算法建立外部群体以保存非支配解,以Pareto优和共亨适应度作为外部群体更新与激活抗体选择的双重标准.为了增强算法对决策空间的开发能力,引入...     

A fast evaluation strategy for evolutionary algorithms

Evolutionary algorithms (EAs) are a popular and robust strategy for optimization problems. However, these algorithms may require huge computation power for solving real problems. This paper introduces a “fast evolutionary algorithm” (FEA) that does not evaluate all new individuals, thus operating faster. A fitness and associated reliability value are assigned to each new individual that is only evaluated using the true fitness function if the reliability value is below a threshold. Moreover, applying random evaluation and error compensation strategies to the FEA further enhances the performance of the algorithm. Simulation results show that for six optimization functions an average reduction of 40% in the number of evaluations was observed while obtaining similar solutions to those found using a traditional evolutionary algorithm. For these same functions, by completion, the algorithm also finds a 4% better fitness value on average for the same number of evaluations. For an image compression system, the algorithm found on average 3% (12%) better fitness values or compression ratios using only 58% (65%) number of evaluations needed by an EA in lossless (lossy) compression mode.     

Interactive evolutionary solution synthesis in fuzzy set-based preliminary engineering design

This paper describes an interactive evolutionary approach to synthesize component-based preliminary engineering design problems. This approach is intended to address preliminary engineering design as an evolutionary synthesis process, with the needs for human-computer interaction in a changing environment caused by uncertainty and imprecision inherent in the early design stages. It combines an agent-based hierarchical design representation, set-based design generation, fuzzy design trade-off strategy and interactive design adaptation into evolutionary synthesis to gradually refine and reduce the search space while maintaining solution diversity to accommodate future changes. The fitness function of solutions employed is not fixed but adapted according to elicited human value judgment and constraint change. It incorporates multi-criteria evaluation as well as constraint satisfaction. This new approach takes advantage of the different roles of computers and humans play in design and optimization. The methodology will be applicable to general multi-domain applications, with emphasis on physical modeling of dynamic systems. An automotive speedometer design case study is included to demonstrate the methodology.     

双精英协同进化遗传算法

针对传统遗传算法早熟收敛和收敛速度慢的问题,提出一种双精英协同进化遗传算法(double elite coevolutionary genetic algorithm,简称DECGA).该算法借鉴了精英策略和协同进化的思想,选择两个相异的、高适应度的个体(精英个体)作为进化操作的核心,两个精英个体分别按照不同的评价函数来选择个体,组成各自的进化子种群.两个子种群分别采用不同的进化策略,以平衡算法的勘探和搜索能力.理论分析证明,该算法具有全局收敛性.通过对测试函数的实验,其结果表明,该算法能搜索到几乎所有测试函数的最优解,同时能够有效地保持种群的多样性.与已有算法相比,该算法在收敛速度和搜索全局最优解上都有了较大的改进和提高.     

基于生态策略的动态多目标优化算法

动态多目标优化问题(dynamic multi-objective optimization problems, DMOP)的目标函数、约束条件或者问题的相关参数随时间变化,是多目标优化领域非常重要的研究难题,传统方法难以很好地追踪其变化的Pareto前沿.针对动态多目标优化问题特点,提出了一种基于生态策略的动态多目标优化算法(dynamic multi-objective optimization algorithm based on ecological strategy, ESDMO).各种群可以采取不同的进化策略应对外部环境变化,捕食种群与被捕食群体间的竞争也促进种群不断提高生存力.受此启发,采用了一种多种群协同进化机制与强化学习策略相结合的协同进化计算模型.该算法定义了一种环境自检算子用于检测环境的变化,不同的种群采取不同的生态策略来应对动态环境变化.经过各种类型的动态多目标优化问题测试,实验结果表明所提出的算法具有更好的解集多样性、均匀性和分布性,验证了该算法对于解决动态多目标优化问题是有效的.