求解非线性方程组的社会认知算法

将非线性方程组的求解问题转化为函数优化问题,应用一种新的智能优化算法——社会认知算法求解此优化问题,实验结果表明了社会认知算法在求解非线性方程组时的可行性和有效性。     

求解分式规划的社会认知算法

对分式规划问题进行了研究,由于此类问题目标函数为分式,传统的梯度类算法求解此类问题很困难.结合近年来出现的一类新的智能算法——社会认知算法,给出了该类问题的一种有效求解方法.该算法是基于社会认知理论,通过一系列的学习代理来模拟人类的社会性以及智能性从而完成对目标的优化.该算法对目标函数的解析性质没有要求,具有易实现、高效以及普适性.数值结果表明了该方法在求解分式规划问题中的有效性.     

非线性约束优化的算法分析

针对非线性约束优化问题,运用了一种新的智能优化算法——社会认知优化算法。社会认知优化算法是一种基于社会认知理论的集群智能优化算法,它对目标函数的解析性质没有要求,适合于大规模约束问题处理的优点,使搜索不容易陷入局部最优。将该算法引入非线性约束问题,解决优化问题。通过实例和其他算法进行比较,对比数值实验结果表明,即使只有一个学习主体,该算法能够高效、稳定地得到解决方案,便于求解非线性约束优化问题。     

求解互补问题的极大熵社会认知算法

针对传统算法无法获得互补问题的多个最优解的困难,提出了求解互补问题的社会认知优化算法.通过利用NCP函数,将互补问题的求解转化为一个非光滑方程组问题,然后用凝聚函数对其进行光滑化,进而把互补问题的求解转化为无约束优化问题,利用社会认知算法对其进行求解.该算法是基于社会认知理论,通过一系列的学习代理来模拟人类的社会性以及智能性从而完成对目标的优化.该算法对目标函数的解析性质没有要求且容易实现,数值实验结果表明了该方法是有效的.     

基于新型粒子群优化的粒子滤波雷达目标跟踪算法

针对基于粒子群优化算法的粒子滤波精度不高,容易陷入局部最优,难以满足目标跟踪的问题,提出了一种新的粒子群优化粒子滤波算法,该算法利用社会个体对群体的认知规律优化了粒子更新的方法,并且完善了粒子速度的更新策略,使优势速度有较小概率变异,从而提高了寻优能力,同时将劣势速度随机初始化,保证了样本的多样性.实验结果表明,该算法精度高,鲁棒性强,可以有效地应用于雷达机动目标跟踪.     

求解一类不可微多目标优化问题的社会认知算法*

针对一类不可微多目标优化问题,给出了一个新的算法——极大熵社会认知算法。利用极大熵方法将带有约束的不可微多目标优化问题转化为无约束单目标优化问题,然后利用社会认知算法对其进行求解。该算法是基于社会认知理论,通过一系列的学习代理来模拟人类的社会性和智能性从而完成对目标的优化。利用两个测试算例对其进行测试并与其他算法进行比较,计算结果表明,该算法在求解的准确性和有效性方面均优于其他算法。     

一类非线性极大极小问题的极大熵社会认知算法

针对一类非线性极大极小问题目标函数非光滑的特点给求解带来的困难,利用社会认知算法并结合极大熵函数法给出了此类问题的一种新的有效算法。首先利用极大熵函数将原问题转化为一个光滑无约束优化问题,然后利用社会认知算法对其进行求解。该算法是基于社会认知理论,通过一系列的学习代理来模拟人类的社会性以及智能性从而完成对目标的优化。数值结果表明,该算法收敛快,数值稳定性好,是求解非线性极大极小问题的一种有效算法。     

基于社会认知算法的软件可靠性分配问题研究

针对软件可靠性分配问题中求解全局最优解的困难,在保证系统开发费用最低的前提条件下,将可靠性指标分配到每个模块中,并利用一种新的智能优化算法——社会认知算法来搜索模型的最优解。实验结果表明了社会认知算法在求解软件可靠性分配问题中的有效性。     

基于时变系数与社会认知模拟的粒子群优化

粒子群优化算法利用一群在可行区域内飞行的粒子来搜索最优解,具有易实现、收敛速度快的特点,然而也面临"早熟"的问题.提出了一种基于时变系数与社会认知模拟的粒子群优化算法.实验结果显示,在5种不同的标准化测试函数下,新算法较另外3种常用的算法优越.     

粒子群优化的速度方程改进与自适应变异策略

对基本粒子群优化算法的速度方程进行了改进,减少了控制参数,引入随机调节因子,使得粒子的自我认知能力和社会认知能力在一定范围内随机产生,同时对个体最优粒子进行自适应随机变异,由此构造出一种改进的粒子群优化算法。数值结果表明新算法能够克服早熟收敛,具有更好的性能和全局搜索能力。     

Multiobjective optimization using population-based extremal optimization

In recent years, a general-purpose local-search heuristic method called Extremal Optimization (EO) has been successfully applied in some NP-hard combinatorial optimization problems. In this paper, we present a novel Pareto-based algorithm, which can be regarded as an extension of EO, to solve multiobjective optimization problems. The proposed method, called Multiobjective Population-based Extremal Optimization (MOPEO), is validated by using five benchmark functions and metrics taken from the standard literature on multiobjective evolutionary optimization. The experimental results demonstrate that MOPEO is competitive with the state-of-the-art multiobjective evolutionary algorithms. Thus MOPEO can be considered as a viable alternative to solve multiobjective optimization problems.     

Blended biogeography-based optimization for constrained optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method that is based on the science of biogeography. We propose two extensions to BBO. First, we propose a blended migration operator. Benchmark results show that blended BBO outperforms standard BBO. Second, we employ blended BBO to solve constrained optimization problems. Constraints are handled by modifying the BBO immigration and emigration procedures. The approach that we use does not require any additional tuning parameters beyond those that are required for unconstrained problems. The constrained blended BBO algorithm is compared with solutions based on a stud genetic algorithm (SGA) and standard particle swarm optimization 2007 (SPSO 07). The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems.     

Biogeography-based optimization for constrained optimization problems

Biogeography-based optimization (BBO) has been recently proposed as a viable stochastic optimization algorithm and it has so far been successfully applied in a variety of fields, especially for unconstrained optimization problems. The present paper shows how BBO can be applied for constrained optimization problems, where the objective is to find a solution for a given objective function, subject to both inequality and equality constraints.     

Multi-objective optimization using teaching-learning-based optimization algorithm

Two major goals in multi-objective optimization are to obtain a set of nondominated solutions as closely as possible to the true Pareto front (PF) and maintain a well-distributed solution set along the Pareto front. In this paper, we propose a teaching-learning-based optimization (TLBO) algorithm for multi-objective optimization problems (MOPs). In our algorithm, we adopt the nondominated sorting concept and the mechanism of crowding distance computation. The teacher of the learners is selected from among current nondominated solutions with the highest crowding distance values and the centroid of the nondominated solutions from current archive is selected as the Mean of the learners. The performance of proposed algorithm is investigated on a set of some benchmark problems and real life application problems and the results show that the proposed algorithm is a challenging method for multi-objective algorithms.     

全局优化的蝴蝶优化算法

针对基本蝴蝶优化算法中存在的易陷入局部最优值、收敛速度慢等问题,提出一种全局优化的蝴蝶算法,引入limit阈值来限定蝴蝶优化算法陷入局部最优解的次数,从而改变算法易陷入早熟的问题,结合单纯形策略优化迭代后期位置较差的蝴蝶使种群能够较快地找到全局最优解;将正弦余弦算法作为局部算子融入BOA中,改善迭代后期种群多样性下降的缺陷,加快算法跳出局部最优。在仿真模拟实验中与多个算法进行对比,结果表明改进算法的寻优性能更好。     

Combining Bayesian optimization and Lipschitz optimization

Machine Learning - Bayesian optimization and Lipschitz optimization have developed alternative techniques for optimizing black-box functions. They each exploit a different form of prior about the...     

Multi-verse optimization algorithm- and salp swarm optimization algorithm-based optimization of multilevel inverters

Neural Computing and Applications - Renewable energy sources are installed into both distribution and transmission grids more and more with the introduction of smart grid concept. Hence, efficient...     

Non-parametric particle swarm optimization for global optimization

In recent years, particle swarm optimization (PSO) has extensively applied in various optimization problems because of its simple structure. Although the PSO may find local optima or exhibit slow convergence speed when solving complex multimodal problems. Also, the algorithm requires setting several parameters, and tuning the parameters is a challenging for some optimization problems. To address these issues, an improved PSO scheme is proposed in this study. The algorithm, called non-parametric particle swarm optimization (NP-PSO) enhances the global exploration and the local exploitation in PSO without tuning any algorithmic parameter. NP-PSO combines local and global topologies with two quadratic interpolation operations to increase the search ability. Nineteen (19) unimodal and multimodal nonlinear benchmark functions are selected to compare the performance of NP-PSO with several well-known PSO algorithms. The experimental results showed that the proposed method considerably enhances the efficiency of PSO algorithm in terms of solution accuracy, convergence speed, global optimality, and algorithm reliability.     

Variable mesh optimization for continuous optimization problems

Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search algorithms use a population of solutions to maintain an acceptable diversity level during the process, thus their correct distribution is crucial for the search. This paper introduces a new population meta-heuristic called “variable mesh optimization” (VMO), in which the set of nodes (potential solutions) are distributed as a mesh. This mesh is variable, because it evolves to maintain a controlled diversity (avoiding solutions too close to each other) and to guide it to the best solutions (by a mechanism of resampling from current nodes to its best neighbour). This proposal is compared with basic population-based meta-heuristics using a benchmark of multimodal continuous functions, showing that VMO is a competitive algorithm.     

Benchmarking optimization solvers for structural topology optimization

The purpose of this article is to benchmark different optimization solvers when applied to various finite element based structural topology optimization problems. An extensive and representative library of minimum compliance, minimum volume, and mechanism design problem instances for different sizes is developed for this benchmarking. The problems are based on a material interpolation scheme combined with a density filter. Different optimization solvers including Optimality Criteria (OC), the Method of Moving Asymptotes (MMA) and its globally convergent version GCMMA, the interior point solvers in IPOPT and FMINCON, and the sequential quadratic programming method in SNOPT, are benchmarked on the library using performance profiles. Whenever possible the methods are applied to both the nested and the Simultaneous Analysis and Design (SAND) formulations of the problem. The performance profiles conclude that general solvers are as efficient and reliable as classical structural topology optimization solvers. Moreover, the use of the exact Hessians in SAND formulations, generally produce designs with better objective function values. However, with the benchmarked implementations solving SAND formulations consumes more computational time than solving the corresponding nested formulations.