Sequential approximation optimization assisted particle swarm optimization for expensive problems

In this paper, an efficient sequential approximation optimization assisted particle swarm optimization algorithm is proposed for optimization of expensive problems. This algorithm makes a good balance between the search ability of particle swarm optimization and sequential approximation optimization. Specifically, the proposed algorithm uses the optima obtained by sequential approximation optimization in local regions to replace the personal historical best particles and then runs the basic particle swarm optimization procedures. Compared with particle swarm optimization, the proposed algorithm is more efficient because the optima provided by sequential approximation optimization can direct swarm particles to search in a more accurate way. In addition, a space partition strategy is proposed to constraint sequential approximation optimization in local regions. This strategy can enhance the swarm diversity and prevent the preconvergence of the proposed algorithm. In order to validate the proposed algorithm, a lot of numerical benchmark problems are tested. An overall comparison between the proposed algorithm and several other optimization algorithms has been made. Finally, the proposed algorithm is applied to an optimal design of bearings in an all-direction propeller. The results show that the proposed algorithm is efficient and promising for optimization of the expensive problems.     

一种随机粒子群算法及应用

为提高粒子群算法的优化效率,在分析量子粒子群优化算法的基础上,提出了一种随机粒子群优化算法。该算法只有一个控制参数,搜索步长由一个随机变量的取值动态决定,通过合理设计控制参数的取值,实现对目标位置的跟踪。标准测试函数极值优化和聚类优化的实验结果表明,与量子粒子群和普通粒子群算法相比,该算法在优化能力和优化效率两方面都有改进。     

基于云免疫算法的认知无线网络参数优化

为了提高认知无线网络的参数优化效果,提出了一种基于免疫优化的认知引擎参数调整算法。免疫克隆优化是一种有效的智能优化算法,适合求解认知无线网络的引擎参数调整问题。免疫优化中,变异概率影响着算法的搜索能力;利用正态云模型云滴的随机性和稳定倾向性特点,提出了一种基于云模型的自适应变异概率调整方法,并用于认知无线网络的参数优化。在多载波环境下对算法进行了仿真实验。结果表明,所提算法收敛速度较快,参数调整结果与对目标函数的偏好一致,能够实现认知引擎参数优化。     

基于遗传算法的低功耗有限状态机状态分配

提出一种通过状态分配来实现有限状态机的功耗和面积同时优化的方法．在分析现有成本函数的基础上，提出了一个新的成本函数，并利用遗传算法能进行多目标优化的能力来实现功耗和面积的同时优化．该算法用C语言实现，并对17个MCNC有限状态机标准电路进行测试．测试结果表明，与已有的功耗优化算法相比，文中算法在功耗和面积方面有一定的优势．     

混合型蛙跳算法及其应用研究*

为了提高蛙跳算法求解无约束连续优化问题的能力,提出了一种改进型混合蛙跳算法。为验证该算法求解函数优化问题的高效性,将其与基本蛙跳算法进行比较实验,结果表明该算法的解精度及收敛速度均优于基本蛙跳算法,更适用于求解复杂的无约束连续优化问题。     

利用Alopex改进的动力学演化算法

通过将动力学演化算法(Dynamical Evolutionary Algorithm,DEA)与一种随机优化方法——Alopex算法相结合,提出一种改进的动力学演化算法。改进的算法改善了动力学演化算法摆脱局部极小点的能力,对典型函数的测试表明:改进算法的全局搜索能力有了显著提高,特别是对多峰函数能够有效地避免早熟收敛问题。     

基于混沌搜索的粒子群优化算法

粒子群优化算法(PSO)是一种有效的随机全局优化技术。文章把混沌优化搜索技术引入到PSO算法中,提出了基于混沌搜索的粒子群优化算法。该算法保持了PSO算法结构简单的特点,改善了PSO算法的全局寻优能力,提高的算法的收敛速度和计算精度。仿真计算表明,该算法的性能优于基本PSO算法。     

Bee colony optimization for combined heat and power economic dispatch

This paper presents a novel optimization approach to the combined heat and power economic dispatch problem by using bee colony optimization algorithm. The algorithm is a swarm-based algorithm inspired by the food foraging behavior of honey bees. The performance of the proposed algorithm is validated by illustration with a test system. The results of the proposed approach are compared with those of particle swarm optimization, real-coded genetic algorithm and evolutionary programing techniques. From numerical results, it is seen that bee colony optimization based approach is able to provide a better solution at a lesser computational effort.     

An efficient metamodel-based multi-objective multidisciplinary design optimization framework

This paper presents an efficient metamodel-based multi-objective multidisciplinary design optimization (MDO) architecture for solving multi-objective high fidelity MDO problems. One of the important features of the proposed method is the development of an efficient surrogate model-based multi-objective particle swarm optimization (EMOPSO) algorithm, which is integrated with a computationally efficient metamodel-based MDO architecture. The proposed EMOPSO algorithm is based on sorted Pareto front crowding distance, utilizing star topology. In addition, a constraint-handling mechanism in non-domination appointment and fuzzy logic is also introduced to overcome feasibility complexity and rapid identification of optimum design point on the Pareto front. The proposed algorithm is implemented on a metamodel-based collaborative optimization architecture. The proposed method is evaluated and compared with existing multi-objective optimization algorithms such as multi-objective particle swarm optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGA-II), using a number of well-known benchmark problems. One of the important results observed is that the proposed EMOPSO algorithm provides high diversity with fast convergence speed as compared to other algorithms. The proposed method is also applied to a multi-objective collaborative optimization of unmanned aerial vehicle wing based on high fidelity models involving structures and aerodynamics disciplines. The results obtained show that the proposed method provides an effective way of solving multi-objective multidisciplinary design optimization problem using high fidelity models.     

基于多目标飞蛾算法的电力系统无功优化研究

鉴于电力需求的日益增长与传统无功优化方法的桎梏,如何更加合理有效地解决电力系统的无功优化问题逐渐成为了研究的热点。提出一种多目标飞蛾扑火算法来解决电力系统多目标无功优化的问题,算法引入固定大小的外部储存机制、自适应的网格和筛选机制来有效存储和提升无功优化问题的帕累托最优解集,算法采用CEC2009标准多目标测试函数来进行仿真实验,并与两种经典算法进行性能的对比分析。此外,在电力系统IEEE 30节点上将该算法与MOPSO,NGSGA-II算法的求解结果进行比较分析的结果表明,多目标飞蛾算法具有良好的性能,并在解决电力系统多目标无功优化问题上具有良好的潜力。     

基于改进混沌粒子群优化算法的聚丙烯生产调优

通过算法混合提出了一种改进混沌粒子群优化算法。将混沌搜索融入到粒子群优化算法中,建立了早熟收敛判断和处理机制,显著提高了优化算法的局部搜索效率和全局搜索性能。将改进混沌粒子群优化算法应用于聚丙烯生产调优中,首先建立了聚丙烯最优牌号切换模型,然后采用改进混沌粒子群优化算法求解该最优牌号切换模型。优化结果:表明,与常规混沌粒子群优化算法相比,改进混沌粒子群优化算法具有更佳的优化效率和全局性能。     

基于磷虾群算法的无线传感器网络QoS任播路由算法

无线传感器网络多约束QoS任播路由问题是一个NP难题,提出一种基于磷虾群算法的优化策略来解决该路由问题.该算法采用适应度函数和全局最优个体位置更新方法来寻找无线传感器网络中满足多QoS约束的最优任播路由,并加入遗传繁殖机制中的交叉与变异操作以加快优化速度.实验验证了该算法的有效性,实验数据表明相比较粒子群优化算法,该算法在算法效率和可扩展性性能上具有较好的性能;具有较快的收敛速度,从而适用于对路由选择有时延敏感的网络.     

基于自主学习和精英群的多子群粒子群算法

为了提高动态多子群粒子群算法中粒子学习的自主性,提出一种基于自主学习和精英群的粒子群算法.该算法借鉴教育心理学自主学习的理念,用基础群中粒子自主选择学习对象的操作代替子群的重组操作,并通过精英群局部搜索的配合来达到寻优的目的.将所提出的算法应用于6个测试函数,并与动态多子群PSO等算法进行了比较,比较结果表明,新算法在提高收敛速度、精度和寻优时间等方面具有良好的性能。     

基于K-均值聚类的协同进化粒子群优化算法

针对粒子群优化（PSO）算法优化高维问题时,易陷入局部最优,提出一种基于K-均值聚类的协同进化粒子群优化（KMS-CCPSO）算法。该算法通过引入K-均值算法扩大种群的局部搜索范围,采用柯西分布和高斯分布相结合的方法更新粒子的位置。实验结果表明,该算法具有较好的优化性能,其优势在处理高维问题上更为明显。     

Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations

Hybridizing of the optimization algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to develop a novel hybrid optimization algorithm entitled hybrid robust differential evolution (HRDE) by adding positive properties of the Taguchi's method to the differential evolution algorithm for minimizing the production cost associated with multi-pass turning problems. The proposed optimization approach is applied to two case studies for multi-pass turning operations to illustrate the effectiveness and robustness of the proposed algorithm in machining operations. The results reveal that the proposed hybrid algorithm is more effective than particle swarm optimization algorithm, immune algorithm, hybrid harmony search algorithm, hybrid genetic algorithm, scatter search algorithm, genetic algorithm and integration of simulated annealing and Hooke-Jeevespatter search.     

Comparison of evolutionary-based optimization algorithms for structural design optimization

In this paper, a comparison of evolutionary-based optimization techniques for structural design optimization problems is presented. Furthermore, a hybrid optimization technique based on differential evolution algorithm is introduced for structural design optimization problems. In order to evaluate the proposed optimization approach a welded beam design problem taken from the literature is solved. The proposed approach is applied to a welded beam design problem and the optimal design of a vehicle component to illustrate how the present approach can be applied for solving structural design optimization problems. A comparative study of six population-based optimization algorithms for optimal design of the structures is presented. The volume reduction of the vehicle component is 28.4% using the proposed hybrid approach. The results show that the proposed approach gives better solutions compared to genetic algorithm, particle swarm, immune algorithm, artificial bee colony algorithm and differential evolution algorithm that are representative of the state-of-the-art in the evolutionary optimization literature.     

Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization

Many real-life optimization problems often face an increased rank of nonsmoothness (many local minima) which could prevent a search algorithm from moving toward the global solution. Evolution-based algorithms try to deal with this issue. The algorithm proposed in this paper is called GAAPI and is a hybridization between two optimization techniques: a special class of ant colony optimization for continuous domains entitled API and a genetic algorithm (GA). The algorithm adopts the downhill behavior of API (a key characteristic of optimization algorithms) and the good spreading in the solution space of the GA. A probabilistic approach and an empirical comparison study are presented to prove the convergence of the proposed method in solving different classes of complex global continuous optimization problems. Numerical results are reported and compared to the existing results in the literature to validate the feasibility and the effectiveness of the proposed method. The proposed algorithm is shown to be effective and efficient for most of the test functions.     

生化系统稳态优化的一种新算法

针对一类生化系统的稳态优化问题, 在已有间接优化方法(IOM)的线性优化问题中引入一个反映S–系统解和原模型解一致性的等式约束, 应用Lagrangian乘子法将修正后的非线性优化问题转化为一个等价的线性优化问题, 提出了一种改进的稳态优化新算法. 该优化算法不仅可以收敛到正确的系统最优解, 而且可用现有的线性规划算法去计算. 最后将算法应用于几个生化系统的稳态优化中, 结果表明, 本文提出的优化算法是有效的.     

基于Bloch 球面坐标编码的量子粒子群算法及应用

为提高粒子群算法的优化效率,在分析粒子群优化算法的基础上,提出了一种基于Bloch球面坐标编码的量子粒子群优化算法。该算法每个粒子占据空间三个位置,每个位置代表一个优化解。采用传统粒子群优化方法的搜索机制调整量子位的两个参数,可以实现量子位在Bloch球面上的旋转,从而使每个粒子代表的三个优化解同时得到更新,并快速逼近全局最优解。标准测试函数极值优化和模糊控制其参数优化的实验结果表明,与同类算法相比,该算法在优化能力和优化效率两方面都有改进。     

基于改进人工蜂鸟算法的VRV空调需求响应功率削减策略

针对夏季用电高峰时期用户对空调设定温度随意调节造成能源浪费以及需求侧对电网控制指令响应不够精确的问题，提出了一种基于功率削减的空调温度分档需求响应调控策略；以某办公建筑VRV空调为研究对象，分别建立该办公建筑空调物理仿真模型以及功耗数学模型，并对模型的准确性进行验证；提出基于不同舒适度和激励电价的VRV空调温度控制档位，构建室内机温度分档调控多目标优化模型，优化目标为调控时期空调实际功率与调控目标值的平均偏差以及负荷聚合商对用户的激励补偿费用同时最小；选取人工蜂鸟算法作为优化算法，针对该算法存在搜索速度慢、寻优精度低、易早熟收敛等缺点，在种群初始化阶段采用Hammersley序列生成更加均匀的初始种群以提高算法的收敛速度与精度，在搜索阶段采用高斯变异算子对蜂鸟位置进行扰动以进一步提升算法的探索能力。运用改进人工蜂鸟算法对模型进行求解，并与人工蜂鸟算法、粒子群算法、灰狼优化算法和鲸鱼优化算法的求解结果进行对比，以证明所提策略的有效性；实验结果表明，应用改进人工蜂鸟算法求解后的结果在保证用户舒适度的条件下最多可将功率调控精度提高83.1%并且将激励费用减小8.36%。