基于模拟退火的并行粒子群优化研究

针对粒子群优化(PSO)容易陷入局部极小，提出将模拟退火(SA)引入并行PSO算法．这种模拟退火并行粒子群算法，结合了并行粒子群算法的快速寻优能力和SA的概率突跳特性，保持了群体多样性，从而避免了种群退化．针对转炉提钒过程是一个复杂非线性反应过程而难以建立终点控制模型的问题，提出了基于模拟退火的并行粒子群RBF网络的辨识模型，优化了RBF核中心个数，从而克服了随机性选择．将该模型用于预测提钒吹氧时间，仿真结果表明预测误差不超过真实值的20％．     

基于模拟退火技术的QDPSO算法

提出了一种基于模拟退火技术的量子空间模型粒子群优化(QDPSO)改进算法，利用模拟退火算法(SA)的搜索能力克服QDPSO算法在寻优过程中早熟的缺点，通过标准测试函数进行性能测试，验证了算法的收敛性和快速性，并和标准PSO及QDPSO进行了比较。仿真结果表明，该算法具有更好的稳定性和收敛性，是一种良好的全局优化方法。     

用粒子群优化改进算法求解混合整数非线性规划问题

针对混合整数非线性规划(MINLP)问题，改进了粒子群优化算法(PSO)，提出了一种粒子迁移策略，改进了粒子速度更新策略，使之成为一种解决MINLP问题的新算法．实验表明，新算法精确度好、收敛快．     

多策略并行学习的异构粒子群优化算法

针对标准粒子群优化(PSO)算法在复杂问题上收敛速度慢和早熟收敛的缺点,提出了一种多策略并行学习的异构PSO算法(MHPSO).该算法首先从种群多样性和跳出局部极值的角度提出了两种新学习策略(局部扰动学习策略和高斯子空间学习策略),并将这两种策略与MBB-PSO策略融合组成高效稳定的策略池.其次提出了一种简单有效的策略更换机制,指导粒子迭代寻优中何时更换学习策略.基准测试函数的实验结果表明,改进的粒子群优化算法在求解精度和收敛速度上得到极大的提高.与一些改进PSO算法(如自适应的粒子群优化(APSO)算法等)相比,所提算法具有更优良的寻优性能.     

基于自适应驱散机制的粒子群优化算法

为克服粒子群优化算法(PSO)易陷入局部最优导致早熟收敛的问题,提出了一种新型的基于自适应驱散机制的粒子群优化(ADMPSO)算法。基本的粒子群优化算法易陷入局部最优,一般的改进算法在搜索过程之中对个体最优和全局最优结果进行调整,虽然避免了粒子群陷入局部最优,但会很大程度减慢收敛速度。提出的改进算法只有在种群快要陷入局部最优时,才会对粒子群进行有效驱散,这样不仅保证了收敛速度,又不会使粒子群陷入局部最优。对维度30的12个标准测试函数进行测试的结果表明ADMPSO算法相较于经典粒子群(General PSO,GPSO)算法、综合学习粒子群优化算法(Comprehensive Learning PSO,CLPSO)算法和动态多粒子群协调搜索优化算法(Dynamic Multi-Swarm PSO with sub-regional Harmony Search,DMS-PSO-HS),可以更有效避免陷入局部最优,稳定地找到最优值,同时又能保证一定的收敛速度。ADMPSO算法不容易陷入局部最优和迭代次数更少的特点使得PSO算法更加实用化。     

基于空间缩放和吸引子的粒子群优化算法

为解决粒子群优化(Particle Swarm Optimization,PSO)算法中粒子越界、算法进化后期收敛速度慢和早熟收敛的问题,通过分析PSO算法中粒子运动行为和算法稳定性,提出了一种基于空间缩放和吸引子的粒子群优化(PSO with search space zoomed factor and attrac...     

IPSO算法用于确定型单机场地面等待问题

针对单机场地面等待问题,已有人采用遗传算法进行了求解,但其搜索最优解的能力差,且搜索效率低。粒子群优化(PSO)算法对该问题解空间及粒子编码设计难度较大,因而还未曾用于解决地面等待问题。针对确定型单机场地面等待数学模型,分别采用基本PSO、线性递减惯性权重加收缩因子PSO、随机惯性权重加收缩因子PSO、模拟退火PSO算法四种方法对该模型进行优化求解,并和采用遗传算法的结果进行了对比,仿真实验表明这四种方法在寻优能力和寻优效率方面显著提高,其中模拟退火PSO方法最好。     

面向产品优化配置的粒子群优化算法

针对产品配置大规模、多约束、多目标及组合优化等特性,建立一种有效的配置模型,将复杂的产品优化配置问题转化为图的路径寻优问题。针对基本粒子群算法(PSO)的缺陷,将遗传原理、蚁群机制和模拟退火理论引入PSO算法,提出一种改进的PSO算法。根据产品优化配置问题的离散特点,对PSO算法进行离散化处理,重新定义粒子的位置和速度表示,确立这些量的运算规律和粒子运动方程。典型产品配置实例验证了提出的模型和算法的可行性。     

基于交叉因子和模拟退火的群搜索优化算法

针对目前标准群搜索优化(GSO)算法存在的一些缺点,提出一种基于交叉因子和模拟退火群搜索优化(CMG-SO)算法,通过与模拟退火算法的结合来改善算法的收敛性能,并借鉴遗传算法中的选择交叉操作增加粒子多样性,通过引入交叉因子增强群体成员优良特性,减小了算法陷入局部极值的可能.经过4个常用测试函数测试及与粒子群优化(PSO)算法、群搜索优化(GSO)算法对比,表明了该算法有较好的全局搜索能力和收敛速度,提高了优化性能.     

基于Kalman滤波器原理的PSO算法

粒子群优化(PSO)算法是一种新兴的基于群智能方法的优化技术,该算法简单而且功能强大,但也存在易陷入局部极值的缺点。文章分析了PSO算法的特征,利用卡尔曼(Kalm an)滤波器原理对PSO算法作了改进,得到了一种新的改进粒子群优化KPSO(Kalm an PSO)算法。实验结果表明,KPSO算法取得了较好的应用,其收敛精度和速度都有了一定程度的提高。     

Formulation and parameter selection of multi-objective deterministic particle swarm for simulation-based optimization

Global derivative-free deterministic algorithms are particularly suitable for simulation-based optimization, where often the existence of multiple local optima cannot be excluded a priori, the derivatives of the objective functions are not available, and the evaluation of the objectives is computationally expensive, thus a statistical analysis of the optimization outcomes is not practicable. Among these algorithms, particle swarm optimization (PSO) is advantageous for the ease of implementation and the capability of providing good approximate solutions to the optimization problem at a reasonable computational cost. PSO has been introduced for single-objective problems and several extension to multi-objective optimization are available in the literature. The objective of the present work is the systematic assessment and selection of the most promising formulation and setup parameters of multi-objective deterministic particle swarm optimization (MODPSO) for simulation-based problems. A comparative study of six formulations (varying the definition of cognitive and social attractors) and three setting parameters (number of particles, initialization method, and coefficient set) is performed using 66 analytical test problems. The number of objective functions range from two to three and the number of variables from two to eight, as often encountered in simulation-based engineering problems. The desired Pareto fronts are convex, concave, continuous, and discontinuous. A full-factorial combination of formulations and parameters is investigated, leading to more than 60,000 optimization runs, and assessed by three performance metrics. The most promising MODPSO formulation/parameter is identified and applied to the hull-form optimization of a high-speed catamaran in realistic ocean conditions. Its performance is finally compared with four stochastic algorithms, namely three versions of multi-objective PSO and the genetic algorithm NSGA-II.     

Real-time dynamic optimization of batch systems

In this paper a methodology for designing and implementing a real-time optimizing controller for batch processes is proposed. The controller is used to optimize a user-defined cost function subject to a parameterization of the input trajectories, a nominal model of the process and general state and input constraints. An interior point method with penalty function is used to incorporate constraints into a modified cost functional, and a Lyapunov based extremum seeking approach is used to compute the trajectory parameters. The technique is applicable to general nonlinear systems. A precise statement of the numerical implementation of the optimization routine is provided. It is shown how one can take into account the effect of sampling and discretization of the parameter update law in practical situations. A simulation example demonstrates the applicability of the technique.     

Multiobjective optimization of trusses using genetic algorithms

In this paper we propose the use of the genetic algorithm (GA) as a tool to solve multiobjective optimization problems in structures. Using the concept of min–max optimum, a new GA-based multiobjective optimization technique is proposed and two truss design problems are solved using it. The results produced by this new approach are compared to those produced by other mathematical programming techniques and GA-based approaches, proving that this technique generates better trade-offs and that the genetic algorithm can be used as a reliable numerical optimization tool.     

多元插值全局优化算法及其应用

本文介绍一种多元插值逼近和动态搜索轨迹相结合的全局优化算法.该算法大大减少了目标函数计算次数,寻优收敛速度快,算法稳定,且可获得全局极小,有效地解决了大规模非线性复杂动态系统的参数优化问题.一个具有8个控制参数的电力系统优化控制问题,采用该算法仅访问目标函数78次,便可求得最优控制器参数。     

Effects of dominant wolves in grey wolf optimization algorithm

Bio-inspired computation is one of the emerging soft computing techniques of the past decade. Although they do not guarantee optimality, the underlying reasons that make such algorithms become popular are indeed simplicity in implementation and being open to various improvements. Grey Wolf Optimizer (GWO), which derives inspiration from the hierarchical order and hunting behaviours of grey wolves in nature, is one of the new generation bio-inspired metaheuristics. GWO is first introduced to solve global optimization and mechanical design problems. Next, it has been applied to a variety of problems. As reported in numerous publications, GWO is shown to be a promising algorithm, however, the effects of characteristic mechanisms of GWO on solution quality has not been sufficiently discussed in the related literature. Accordingly, the present study analyses the effects of dominant wolves, which clearly have crucial effects on search capability of GWO and introduces new extensions, which are based on the variations of dominant wolves. In the first extension, three dominant wolves in GWO are evaluated first. Thus, an implicit local search without an additional computational cost is conducted at the beginning of each iteration. Only after repositioning of wolf council of higher-ranks, the rest of the pack is allowed to reposition. Secondarily, dominant wolves are exposed to learning curves so that the hierarchy amongst the leading wolves is established throughout generations. In the final modification, the procedures of the previous extensions are adopted simultaneously. The performances of all developed algorithms are tested on both constrained and unconstrained optimization problems including combinatorial problems such as uncapacitated facility location problem and 0-1 knapsack problem, which have numerous possible real-life applications. The proposed modifications are compared to the standard GWO, some other metaheuristic algorithms taken from the literature and Particle Swarm Optimization, which can be considered as a fundamental algorithm commonly employed in comparative studies. Finally, proposed algorithms are implemented on real-life cases of which the data are taken from the related publications. Statistically verified results point out significant improvements achieved by proposed modifications. In this regard, the results of the present study demonstrate that the dominant wolves have crucial effects on the performance of GWO.     

An integrated approach to topology,sizing, and shape optimization

Topology optimization has become very popular in industrial applications, and most FEM codes have implemented certain capabilities of topology optimization. However, most codes do not allow simultaneous treatment of sizing and shape optimization during the topology optimization phase. This poses a limitation on the design space and therefore prevents finding possible better designs since the interaction of sizing and shape variables with topology modification is excluded. In this paper, an integrated approach is developed to provide the user with the freedom of combining sizing, shape, and topology optimization in a single process.     

云搜索优化算法

本文将云的生成、动态运动、降雨和再生成等自然现象与智能优化算法的思想融合,建立了一种新的智能优化算法-云搜索优化算法(CSO)。生成与移动的云可以弥漫于整个搜索空间,这使得新算法具有较强的全局搜索能力;收缩与扩张的云团在形态上会有千奇百态的变化,这使得算法具有较强的局部搜索能力;降雨后产生新的云团可以保持云团的多样性,这也是使搜索避免陷入局优的有效手段。实验表明,基于这三点建立的新算法具有优异的性能,benchmark函数最优值的计算结果以及与已有智能优化算法的比较展现了新算法精确的、稳定的全局求解能力。     

粒子群算法在组合优化问题上的研究与发展

粒子群优化算法是一种新兴的基于群智能搜索的优化技术。该算法简单、易实现、参数少,具有较强的全局优化能力,可有效应用于科学与工程实践中。介绍了算法的基本原理和算法在组合优化上一些改进方法的主要应用形式。最后,对粒子群算法作了一些深入分析并在此基础上对粒子群算法应用于组合优化问题做了一些总结。     

Value Creation in a Network: The Role of Pricing and Revenue Optimization and Enterprise Profit OptimizationTM

The Internet has created a virtual upheaval in the structural features of the supply and demand chains for most businesses. New agents and marketplaces have surfaced. The potential to create value and enhance profitable opportunities has attracted both buyers and sellers to the Internet. Yet, the Internet has proven to be more complex than originally thought. With information comes complexity: the more the information in real time, the greater the difficulty in interpretation and absorption. How can the value-creating potential of the Internet still be realized, its complexity notwithstanding? This paper argues that with the emergence of innovative tools, the expectations of the Internet as a medium for enhanced profit opportunities can still be realized. Creating value on a continuing basis is central to sustaining profitable opportunities. This paper provides an overview of the value creation process in electronic networks, the emergence of the Internet as a viable business communication and collaboration medium, the proclamation by many that the future of the Internet resides in “embedded intelligence”, and the perspectives of pragmatists who point out the other facet of the Internet—its complexity. The paper then reviews some recent new tools that have emerged to address this complexity. In particular, the promise of Pricing and Revenue Optimization (PRO) and Enterprise Profit Optimization^TM (EPO) tools is discussed. The paper suggests that as buyers and sellers adopt EPO, the market will see the emergence of a truly intelligent network—a virtual network—of private and semi-public profitable communities.     

SEO技术研究

为了利用搜索引擎优化SEO（Search Engine Optimization）技术给网站带来高质量的流量并将其转化为商业利益,理解搜索引擎的算法和排名原理十分必要。通过对网站的结构优化、关键词优化、单页优化、防止被搜索引擎惩罚和挽救被惩罚网站等技术的研究,达到提高网站排名,实现网站的价值目的。