基于混沌序列的粒子群算法

对标准PSO算法进行分析的基础上,针对PSO算法中的早熟收敛问题,提出了一种基于混沌序列的PSO算法（CPSO）。CPSO算法能够保证粒子种群的多样性,使粒子能够有效进行全局搜索;并以典型的基准优化问题进行了仿真实验,验证了CPSO的有效性。     

基于粒子群优化算法组卷的研究

研究了考试系统中一个关键的技术——组卷算法,提出了应用粒子群优化算法组卷。PSO算法源于蜜蜂群觅食,是一种智能寻优算法,它首先初始化一群随机粒子（随机解）,然后通过迭代找到最优解。PSO算法组卷是一个离散性求解问题,这是对PSO算法应用上的一个扩展。     

一种基于差分进化算法和粒子群算法的双进化方式的全局优化算法

差分进化算法(Differential Evolution Algorithms,DE)和粒子群算法(Particle Swarm Optimization,PSO)是一种基于种群的全局优化的通用的启发式算法,已经用来求解很多的问题。本文提出一种基于DE和PSO的双进化方式的种群进化策略。对于种群中的每个粒子可以随机选择按照差分进化或者按照粒子群进化。为了提高进化的收敛速度,对于每一代粒子选择一个最优的粒子提供给按照PSO算法进化的粒子使用。通过4个标准函数测试该算法并与PSO和DE算法进行比较,实验证明该算法是一种求解精度高,速度快,鲁棒性好的算法。     

排课系统中遗传算法的应用研究

高校的教务管理中,排课表工作非常复杂。针对这种情况,本文系统地讨论了排课问题中的影响因素、主要约束条件、求解目标和难点,给出了排课问题的数学模型,提出了组合优化的概念,改进了遗传算法的一般结构,形成了一套多目标协同优化的排课算法。结果表明,该改进算法能较有效地解决排课问题,易于学习和应用。     

几种自动排课算法的比较

排课问题是涉及班级、教师、教室等因素的决策优化问题,也是组合规划中的典型问题.在自动排课系统中,处理排课问题所用的算法处于核心地位,由于排课问题本身的复杂性,寻找这样一个有效算法还是有相当的难度.文章给出了高校排课中需要遵循的条件、因素,并且分析了几种当前比较常用的排课算法,对排课性能做了对比.为今后的各种排课需求提供指导.     

排课冲突检测的设计及实现

排课是高校一项重要而繁琐的教务工作,使用计算机排课是必然的选择,在排课系统中冲突检测算法的设计是关键,目前对于上课时段重叠、周次自由设置的排课冲突检测研究较少。结合宁波电大课表编排的特点,提出了降低问题空间纬度进行冲突检测的算法,该算法在实际使用中有较好的效果。     

基于改进粒子群算法的电网经济调度问题研究

在电力系统领域,粒子群优化算法(PSO)被广泛应用于实现电能优化、电压控制、以及电容器优化配置等问题。但现有的PSO算法在电力系统优化应用中容易过早收敛,不能得到精确解。文章根据电网最优潮流具有典型的有约束、非线性的特点,提出了一种应用于电网经济调度问题的快速有效的求解方法,即改进粒子群(PSO)算法。从模仿生物遗传进化的角度出发,在参考现有PSO算法的基础上设计一种可以随适应度变化而变化的PSO算法模型。通过该算法与标准PSO算法在IEEE30节点系统上进行算法检验比较,可以清楚地看到所改进的算法在求解电网系统经济调度问题方面所具有的优越性能。     

基于鱼群的PSO粒子滤波算法

粒子群优化(PSO)粒子滤波算法比较而言,容易陷入局部最优,因此算法的准确度就会降低。本文在解决该问题时引入了一种基于鱼群的PSO粒子滤波算法。此算法是通过鱼群优化在采样过程中找到全局最优的相对位置,使其能够向全局最优的位置逐渐接近,同时提高估计有效的粒子数目,从而能够更有效的减少粒子退化与枯竭问题。实验表明,此算法与PSO粒子滤波算法相比,在估计准确度方面有了较大的提升。     

基于多目标优化模型的创新人才教育微环境构建

我国建设创新型国家的关键时期,依托高校教育、科研资源搭建创新人才培养微环境是重中之重。目前,高校创新人才培养微环境的构建存在资源分配不恰当、重点不突出、适用性较差等问题。为解决上述问题,利用熵权法对创新型人才培养的各影响因素所占比重进行分析,基于分析结果构建创新人才微环境多目标优化模型,建立二级模糊综合评价体系以评价人才的初始创新能力,采用粒子群优化算法（Particle Swarm Optimization,简称PSO算法）对优化模型进行了求解,实现了不同创新因素对微环境构建影响效果的科学评估。同时,通过区分人才基础创新能力来确定微环境对创新的特异性导向作用,达到科学、精确地构建创新人才培养微环境的目的;并充分发挥思想政治教育的作用,在思想政治教育实践教学中达到对学生创造、创新能力的培养。     

基于WEB的高校分级排课系统设计与实现

排课是高校能否保证教学有序进行的一项重要工作,冲突检测算法复杂,任务繁重,目前多数排课系统的实现采用C/S结构。本文主要阐述运用.NET技术和高校排课的主要原则,设计并实现了基于WEB的校院分级排课系统,同时还提出了更高效的二进制占位排课冲突检测算法。系统在云南农业大学排课过程中得到实际运行,实践效果较好。     

Optimized scheduling of resource-constraints in projects for smart construction

In real-life applications, resources in construction projects are always limited. It is of great practical importance to shorten the project duration by using intelligent models (i.e., evolutionary computations such as genetic algorithm (GA) and particle swarm optimization (PSO) to make the construction process reasonable considering the limited resources. However, in the general EC-based model, for example, PSO easily falls into a local optimum when solving the problem of limited resources and the shortest period in scheduling a large network. This paper proposes two PSO-based models, which are resource-constrained adaptive particle swarm optimization (RC-APSO) and an input-adaptive particle swarm optimization (iRC-APSO) to respectively solve the static and dynamic situations of resource-constraint problems. The RC-APSO uses adaptive heuristic particle swarm optimization (AHPSO) to solve the limited resource and shortest duration problem based on the analysis of the constraints of process resources, time limits, and logic. The iRC-APSO method is a combination of AHPSO and network scheduling and is used to solve the proposed dynamic resource minimum duration problem model. From the experimental results, the probability of obtaining the shortest duration of the RC-APSO is higher than that of the genetic PSO and GA models, and the accuracy and stability of the algorithm are significantly improved compared with the other two algorithms, providing a new method for solving the resource-constrained shortest duration problem. In addition, the computational results show that iRC-APSO can obtain the shortest time constraint and the design scheme after each delay, which is more valuable than the static problem for practical project planning.     

Optimal location and controller design of STATCOM for power system stability improvement using PSO

The optimal location of a static synchronous compensator (STATCOM) and its coordinated design with power system stabilizers (PSSs) for power system stability improvement are presented in this paper. First, the location of STATCOM to improve transient stability is formulated as an optimization problem and particle swarm optimization (PSO) is employed to search for its optimal location. Then, coordinated design problem of STATCOM-based controller with multiple PSS is formulated as an optimization problem and optimal controller parameters are obtained using PSO. A two-area test system is used to show the effectiveness of the proposed approach for determining the optimal location and controller parameters for power system stability improvement. The nonlinear simulation results show that optimally located STATCOM improves the transient stability and coordinated design of STATCOM-based controller and PSSs improve greatly the system damping. Finally, the coordinated design problem is extended to a four-machine two-area system and the results show that the inter-area and local modes of oscillations are well damped with the proposed PSO-optimized controllers.     

Replicating web contents using a hybrid particle swarm optimization

We consider the problem of placing copies of objects in a distributed web server system to minimize the cost of serving read and write requests when the web servers have limited storage capacities. We formulate the problem as a 0–1 optimization problem and present a hybrid particle swarm optimization algorithm to solve it. The proposed hybrid algorithm makes use of the strong global search ability of particle swarm optimization (PSO) and the strong local search ability of tabu search to obtain high quality solutions. The effectiveness of the proposed algorithm is demonstrated by comparing it with the genetic algorithm (GA), simple PSO, tabu search, and random placement algorithm on a variety of test cases. The simulation results indicate that the proposed hybrid approach outperforms the GA, simple PSO, and tabu search.     

基于粒子群优化算法的结构系统辨识

针对一般智能理论辨识方法在结构系统辨识中存在的问题,提出一种基于粒子群优化算法(PSO)的辨识方法。用粒子群中的粒子表征结构物理参数,以最大似然准则为粒子群优化算法的适应度函数,建立了结构系统的辨识模型。数值仿真分析表明,粒子群优化算法可以精确辨识出结构系统的物理参数。     

基于PSO和滚动优化的不确定环境下移动机器人动态路径规划

针对全局环境未知且存在动态障碍物情况下的移动机器人路径规划问题,本文提出了一种结合粒子群算法(PSO)和滚动优化策略的动态路径规划方法。通过在一系列移动空间窗口中进行在线规划来充分利用机器人实时测得的局部环境信息,并用粒子群算法求解每一个移动窗口内的最优路径。为及时躲避动态障碍物,提出了一种适用于动态未知环境下的适应度函数。仿真试验表明,该方法克服了现有局部路径规划方法的高复杂性的缺点,算法操作简单、具有全局寻优能力、收敛速度快、鲁棒性好,可以满足机器人在复杂的未知动态环境下路径规划的实时性要求。     

应用新型量子粒子群优化算法求解PFSP问题

为了提高粒子群算法在求解调度问题时的搜索能力和优化效率以及避免早熟收敛。通过采用了一种新颖的量子粒子群算法,用量子位的概率幅对粒子位置编码,用量子旋转门实现粒子移动,完成粒子搜索;并采用量子非门来实现变异,从而提高种群多样性。由于每个量子都有两个概率幅,因此每个粒子实际占据两个粒子位置,所以在粒子数目相等的情况下,能加速粒子的搜索进程。仿真实验结果表明,在求解置换流水线生产调度问题时优于基本粒子群算法。     

Design and performance analysis of PID controller for an automatic voltage regulator system using simplified particle swarm optimization

This paper presents the design and performance analysis of Proportional Integral Derivate (PID) controller for an Automatic Voltage Regulator (AVR) system using recently proposed simplified Particle Swarm Optimization (PSO) also called Many Optimizing Liaisons (MOL) algorithm. MOL simplifies the original PSO by randomly choosing the particle to update, instead of iterating over the entire swarm thus eliminating the particles best known position and making it easier to tune the behavioral parameters. The design problem of the proposed PID controller is formulated as an optimization problem and MOL algorithm is employed to search for the optimal controller parameters. For the performance analysis, different analysis methods such as transient response analysis, root locus analysis and bode analysis are performed. The superiority of the proposed approach is shown by comparing the results with some recently published modern heuristic optimization algorithms such as Artificial Bee Colony (ABC) algorithm, Particle Swarm Optimization (PSO) algorithm and Differential Evolution (DE) algorithm. Further, robustness analysis of the AVR system tuned by MOL algorithm is performed by varying the time constants of amplifier, exciter, generator and sensor in the range of ?50% to +50% in steps of 25%. The analysis results reveal that the proposed MOL based PID controller for the AVR system performs better than the other similar recently reported population based optimization algorithms.     

Time-optimal control problem for a linear parameter varying system with nonlinear item

In this paper, we considered a time-optimal control problem for a new type of linear parameter varying (LPV) system which is obtained through data identification in the process of dealing with actual problems. The addition of non-linear terms is compensation for the method that does not require linear expansion at the equilibrium point. Since the objective function is the terminal time which is an implicit function concerning decision variables, it is a non-standard optimal control problem with uncertain terminal time. To find the global optimal solution to this problem, firstly, the control parameterization method is used to transform it into a nonlinear optimization problem of parameter selection, and then the modifed particle swarm optimization (PSO) algorithm is combined to solve the equivalent nonlinear programming problem. Numerical examples are used to illustrate the effectiveness of the proposed algorithm.     

电网故障诊断的二进制人工鱼群算法

电网故障诊断的基本思想是根据保护动作原理将故障诊断问题表示为0-1规划问题。为了保证电网故障诊断的准确性和实时性,提出了一种改进的人工鱼群算法——二进制人工鱼群算法。分析了人工鱼群群聚行为和追尾行为最优方向的前进速度。并在此基础上与遗传算法、粒子群算法和量子免疫算法作了对比分析。结果表明:追尾行为最优方向的前进速度优于群聚行为,二进制人工鱼群算法综合性能优于遗传算法、粒子群算法和量子免疫算法。研究表明二进制人工鱼群算法具有收敛速度快、种群规模小和搜索能力强的特点。     

A new design method based on artificial bee colony algorithm for digital IIR filters

Digital filters can be broadly classified into two groups: recursive (infinite impulse response (IIR)) and non-recursive (finite impulse response (FIR)). An IIR filter can provide a much better performance than the FIR filter having the same number of coefficients. However, IIR filters might have a multi-modal error surface. Therefore, a reliable design method proposed for IIR filters must be based on a global search procedure. Artificial bee colony (ABC) algorithm has been recently introduced for global optimization. The ABC algorithm simulating the intelligent foraging behaviour of honey bee swarm is a simple, robust, and very flexible algorithm. In this work, a new method based on ABC algorithm for designing digital IIR filters is described and its performance is compared with that of a conventional optimization algorithm (LSQ-nonlin) and particle swarm optimization (PSO) algorithm.