一种基于新约束处理方法的遗传算法

针对目前的约束处理方法中存在的问题,提出一种新的约束处理方法。该方法通过可行解和不可行解混合交叉的方法对问题的解空间进行搜索,对可行种群和不可行种群分别进行选择操作。避免了惩罚策略中选取惩罚因子的困难,使得约束处理问题简单化。实例测试结果表明,该约束处理方法的有效性。     

一种新的约束优化遗传算法及其工程应用

提出一种新的用于求解约束优化问题的遗传算法,该算法利用佳点集方法初始化个体以维持种群的多样性.在进化过程中,通过可行解与不可行解算术交叉对问题的决策空间进行搜索;对可行种群与不可行种群分别采用高斯变异和柯西变异,从而协调算法的勘探和开采能力.几个标准测试问题的实验结果表明该算法的有效性;应用新算法求解两个工程优化设计问题,结果表明该算法的可行性.     

一种从目标空间反向引导种群进化的进化算法

目前进化算法大多是通过解从决策空间到目标空间的映射，来判断解的质量。针对约束多目标优化问题，将极限学习机代理模型与不可行解存档方法相结合，提出一种通过目标向量反向预测来引导决策空间种群进化的算法。在CTP和TYPE系列的测试问题上进行了HV度量、IGD度量的性能测试。与几种经典的算法比较，该算法在大多情况下都表现出具有竞争力的性能，且在高难度问题下比其他算法表现更好。     

改进果蝇算法在净化除钴过程锌粉量优化设定中的应用

本文提出一种基于细菌迁徙的自适应果蝇算法(CAFOABM),用于求解净化除钴过程锌粉添加量优化设定问题.首先从净化除钴的反应机理出发,通过引入除钴率建立锌粉添加量与氧化还原电位值、出口钴离子浓度间带约束的非线性优化设定模型;为了避免果蝇算法在迭代寻优过程中出现停滞现象,CAFOABM引入多种群并行搜索策略和改进搜索算子对搜索状态的转移规则进行改进;并采用区分可行解与不可行解法进行约束处理,保留一定比例的不可行解个体,有效避免了有用解信息的丢失.实际生产数据验证结果表明,CAFOABM算法优化设定的锌粉添加量与人工操作的经验数据相比减少7.83%,出口钴离子浓度满足实际生产要求且趋于平稳.     

Job Shop 排序问题解空间定量分析

讨论Job shop排序问题不可行解的构造情况,给出了不可行解的一个充要条件以及2台机器n个加工工件的Job shop问题不可行解和可行解的计算公式,并由此得到一种概率模型的计算方法。通过计算发现,Job shop排序问题的不可行解所占比例非常大。     

蚁群算法解决CSAHLP问题时的修正因子的研究

优化蚁群算法是一种基于种群的模拟进化算法,其高效的仿生过程在各类组合问题中有了广泛的应用。CSAHLP经常被用来描述物流在大范围运输时所产生的问题。在CSAHLP问题中,枢流点和节点都是未知参变量,这使得此问题归类于典型的NP问题。ACO作为高效解决NP问题的算法之一,在CSAHLP上有了越来越多的研究应用。但是,蚁群算法也有其自身缺点,受容量约束的条件作为外部约束使得蚁群有时无法得出正确的解。文中详细讨论了蚁群产生非可行解的原因及其处理方法,并通过实验证明方法的有效性。     

蚁群算法解决 CSAHLP 问题时的修正因子的研究

优化蚁群算法是一种基于种群的模拟进化算法,其高效的仿生过程在各类组合问题中有了广泛的应用. CSAHLP经常被用来描述物流在大范围运输时所产生的问题.在 CSAHLP 问题中,枢流点和节点都是未知参变量,这使得此问题归类于典型的 NP 问题. ACO 作为高效解决 NP 问题的算法之一,在 CSAHLP 上有了越来越多的研究应用.但是,蚁群算法也有其自身缺点,受容量约束的条件作为外部约束使得蚁群有时无法得出正确的解.文中详细讨论了蚁群产生非可行解的原因及其处理方法,并通过实验证明方法的有效性     

基于种群个体可行性的约束优化进化算法

提出一种新的求解约束优化问题的进化算法.该算法在处理约束时不引入惩罚因子,使约束处理问题简单化.基于种群中个体的可行性,分别采用3种不同的交叉方式和混合变异机制用于指导算法快速搜索过程.为了求解位于边界附近的全局最优解,引入一种不可行解保存和替换机制,允许一定比例的最好不可行解进入下一代种群.标准测试问题的实验结果表明了该算法的可行性和有效性.     

解决约束优化问题的改进粒子群算法

针对约束优化问题的求解,提出一种改进的粒子群算法（CMPSO）。在CMPSO算法中,为了增加种群多样性,提升种群跳出局部最优解的能力,引入种群多样性阈值,当种群多样性低于给定阈值时,对全局最优粒子位置和粒子自身最优位置进行多项式变异;并根据粒子违背约束条件的程度,提出一种新的粒子间比较准则来比较粒子间的优劣,该准则可以保留一部分性能较优的不可行解;为提升种群向全局最优解飞行的概率,采取一种广义学习策略。对经典测试函数的仿真结果表明,所提出的算法是一种可行的约束优化问题的求解方法。     

求解约束优化问题的ε-DE 算法

差分进化(differential evolution,简称DE)算法解决约束优化问题(constrained optimization problems,简称COPs)时通常采用可行解优先的比较规则,但是该方法不能利用种群中不可行解的信息.设计了可以利用不可行解信息的ε-DE算法.该算法通过构造一种比较准则,使得进化过程可以充分利用种群中优秀不可行解的信息.该准则通过引入种群约束允许放松程度的概念,在进化初始阶段使可行域边界上且拥有较优目标函数的不可行解进入种群;随着进化代数增加,种群约束允许放松程度不断减小,使得种群中不可行解数量减少,直到种群约束允许放松程度为0,种群完全由可行解组成.此外,还选择了一种改进的DE算法作为搜索算法,使得进化过程具有较快的收敛性.13个标准Benchmark函数实验仿真的结果表明:ε-DE算法是目前利用DE算法解决COPs问题中效果最好的.     

一种非参数惩罚函数的优化演化算法

对约束优化问题的处理通常使用惩罚函数法，使用普通惩罚函数法的困难存在于参数的选取。该文提出一种基于演化算法的非参数罚函数算法，对违反约束条件动态地进行惩罚，由适应值的设定来平衡群体中可行解和不可行解的比例，使群体较好地向最优解逼近，使用实数编码的多父体单形杂交演化策略来实现新算法，通过对测试函数的检验，该算法具有稳健、高效、简洁易于实现等特点。     

An evolutionary algorithm with directed weights for constrained multi-objective optimization

When solving constrained multi-objective optimization problems (CMOPs), keeping infeasible individuals with good objective values and small constraint violations in the population can improve the performance of the algorithms, since they provide the information about the optimal direction towards Pareto front. By taking the constraint violation as an objective, we propose a novel constraint-handling technique based on directed weights to deal with CMOPs. This paper adopts two types of weights, i.e. feasible and infeasible weights distributing on feasible and infeasible regions respectively, to guide the search to the promising region. To utilize the useful information contained in infeasible individuals, this paper uses infeasible weights to maintain a number of well-diversified infeasible individuals. Meanwhile, they are dynamically changed along with the evolution to prefer infeasible individuals with better objective values and smaller constraint violations. Furthermore, 18 test instances and 2 engineering design problems are used to evaluate the effectiveness of the proposed algorithm. Several numerical experiments indicate that the proposed algorithm outperforms four compared algorithms in terms of finding a set of well-distributed non-domination solutions.     

数据仓库中用于视图选择的增强遗传算法

物化视图选择问题是数据仓库设计中最重要的问题之一,为了高效地解决这一问题.提出了一个如何选择物化视图集的增强遗传算法,以便在存储空间约束的条件下,取得较好的查询性能和较低的视图维护代价.这一算法的核心思想在于,首先,运用一个基于单位空间最大收益值的预处理算法来生成初始解,然后,该初始解经采用了多种优化策略的遗传算法进行提高,这些优化策略包括:基于改进的锦标赛和精英选择相结合的选择算子、基于半均匀交叉算子及自适应变异算子.并且,在进化过程中产生的无效解用损失函数加以修补.试验结果表明,该算法在寻优性能上优于启发式算法和经典遗传算法.     

An Adaptive Tradeoff Model for Constrained Evolutionary Optimization

In this paper, an adaptive tradeoff model (ATM) is proposed for constrained evolutionary optimization. In this model, three main issues are considered: (1) the evaluation of infeasible solutions when the population contains only infeasible individuals; (2) balancing feasible and infeasible solutions when the population consists of a combination of feasible and infeasible individuals; and (3) the selection of feasible solutions when the population is composed of feasible individuals only. These issues are addressed in this paper by designing different tradeoff schemes during different stages of a search process to obtain an appropriate tradeoff between objective function and constraint violations. In addition, a simple evolutionary strategy (ES) is used as the search engine. By integrating ATM with ES, a generic constrained optimization evolutionary algorithm (ATMES) is derived. The new method is tested on 13 well-known benchmark test functions, and the empirical results suggest that it outperforms or performs similarly to other state-of-the-art techniques referred to in this paper in terms of the quality of the resulting solutions.     

An angle based evolutionary algorithm with infeasibility information for constrained many-objective optimization

Recently, angle-based approaches have shown promising for unconstrained many-objective optimization problems (MaOPs), but few of them are extended to solve constrained MaOPs (CMaOPs). Moreover, due to the difficulty in searching for feasible solutions in high-dimensional objective space, the use of infeasible solutions comes to be more important in solving CMaOPs. In this paper, an angle based evolutionary algorithm with infeasibility information is proposed for constrained many-objective optimization, where different kinds of infeasible solutions are utilized in environmental selection and mating selection. To be specific, an angle-based constrained dominance relation is proposed for non-dominated sorting, which gives infeasible solutions with good diversity the same priority to feasible solutions for escaping from the locally feasible regions. As for diversity maintenance, an angle-based density estimation is developed to give the infeasible solutions with good convergence a chance to survive for next generation, which is helpful to get across the large infeasible barrier. In addition, in order to utilize the potential of infeasible solutions in creating high-quality offspring, a modified mating selection is designed by considering the convergence, diversity and feasibility of solutions simultaneously. Experimental results on two constrained many-objective optimization test suites demonstrate the competitiveness of the proposed algorithm in comparison with five existing constrained many-objective evolutionary algorithms for CMaOPs. Moreover, the effectiveness of the proposed algorithm on a real-world problem is showcased.     

Self-adaptive fitness formulation for constrained optimization

A self-adaptive fitness formulation is presented for solving constrained optimization problems. In this method, the dimensionality of the problem is reduced by representing the constraint violations by a single infeasibility measure. The infeasibility measure is used to form a two-stage penalty that is applied to the infeasible solutions. The performance of the method has been examined by its application to a set of eleven test cases from the specialized literature. The results have been compared with previously published results from the literature. It is shown that the method is able to find the optimum solutions. The proposed method requires no parameter tuning and can be used as a fitness evaluator with any evolutionary algorithm. The approach is also robust in its handling of both linear and nonlinear equality and inequality constraint functions. Furthermore, the method does not require an initial feasible solution.