基于粒子群优化算法的钢铁企业铁路车辆调度

给出了求解铁路车辆调度问题的粒子群算法流程;分析了求解不同调度问题的3种粒子表示法,即基于粒子位置次序(Particle Position Sequence,PPS)的粒子表示法、基于粒子位置取整操作(Particle Position Rounding off,PPR)的粒子表示法和基于PPS PPR的混合粒子表示法;讨论了PPS PPR混合粒子表示法与调度解空间的映射关系和解码方法。将第3种方法应用于实际车辆调度系统中,求解出机车送货作业行驶的最短路径,建立了基于粒子群优化算法的企业铁路优化调度模型。     

改进的PSO算法在RFID网络调度中的应用

为在寻优过程中有效地保持算法的种群多样性,提出了一种改进的PSO(Particle Swarm Optimization) 算法--PSOPC(Particle Swarm Optimizer based on Predator-prey Coevolution).PSOPC算法将生态系统中捕食者和猎物的竞争协同进化机制嵌入到PSO算法中.基于PSOPC进行RFID(Radio Frequency IDentification)读写器网络调度模型的求解,根据读写器冲突关系的变化在线进行读写器的时隙分配求解与控制,在不影响读写器工作效率的同时,有效消除密集读写器环境下的读写器冲突问题,并优化整个读写器网络的工作效率.     

一类支持向量机中引导式量子粒子群优化机理及实现

通过分析量子粒子群在一类超球面支持向量机训练优化的应用机理,提出一种基于引导式量子粒子群(D-QDPSO)的一类超球面支持向量机训练优化算法,根据Zoutendijk最速下行策略确定全局最优gbest的优化方向,计算引导粒子位置;同时在初始化时根据序列最小优化算法(SMO)得到靠近最优解的近似位置,并以约束平面边界点作为初始化粒子,扩大了搜索范围.实验表明,D-QDPSO算法有较好的收敛性能和泛化性能,其误识率比SMO降低约0.12%,运算速度比LPSO提高2倍左右.     

碱煮过程浸出率预测与优化研究

针对钨碱煮过程WO_3浸出率预测困难的问题,建立了动态机理模型与最小二乘支持向量机(LSSVM)相结合的并联混合模型,在该混合模型的基础上,构建了碱煮过程优化模型,将动态浸出问题转化为带约束的优化问题,并以粒子群优化(PSO)算法对优化模型进行求解。仿真结果表明,混合模型预测精度高,优化模型效果好,提高了WO_3浸出率,降低了浸出成本。     

基于粒子群优化算法和博弈论的网络学习控制系统带宽调度

研究了双层网络学习控制系统的带宽调度优化问题.为了合理分配子系统的带宽,引入了网络定价体系和动态带宽调度方法,建立了非合作博弈模型,从而将网络控制系统的网络资源分配问题转换为非合作博弈竞争模型下的Nash均衡点求解问题.在此基础上,采用粒子群优化算法得到此框架下的纳什均衡解,并进一步给出了网络控制系统的时间片调度方法.仿真结果表明了所提方法的有效性.      

基于自适应搜索的免疫粒子群算法

经典粒子群算法由于多样性差而陷入局部最优,从而造成早熟停滞现象.为克服上述缺点,本文结合人工免疫算法,提出一种基于自适应搜索的免疫粒子群算法.首先,该算法改善了浓度机制;然后由粒子最大浓度值来控制子种群数目以充分利用粒子种群资源;最后对劣质子种群进行疫苗接种,利用粒子最大浓度值调节接种疫苗的搜索范围,不仅避免了种群退化现象,而且提高了算法的收敛精度和全局搜索能力.仿真结果表明该算法求解复杂函数优化问题的有效性和优越性.      

应用混沌粒子群优化训练的BP神经网络预报高炉铁水含硅量

应用混沌粒子群优化(Chaos Particle Swarm Opti mization,CPSO)算法训练BP神经网络(Back-Propagation Neural Network,BPNN)并对高炉铁水含硅量进行预报。针对BP神经网络收敛速度慢和易于陷入极小值的问题,在粒子群优化算法中引入混沌思想,提出混沌粒子群优化算法,改善了粒子群优化算法摆脱局部极值点的能力,提高了BP网络的计算精度和收敛速度。系统分别选用料速、透气性指数、炉顶温度、风温、风量、喷煤量、上一炉铁水硅含量作为BP神经网络的输入层神经元,中间层(隐含层)有13个结点(用经验公式确定),输出层有一个结点,为铁水硅含量。应用CPSO算法训练BP神经网络建立的铁水含硅量预报模型对江苏永钢炼铁一厂1号高炉铁水含硅量的实际数据进行网络学习和预报。结果表明,此模型预报命中率高达91.2%,证明了方法的有效性。     

一种基于粒子群参数优化的改进蚁群算法及其应用

针对现有基于粒子群参数优化的改进蚁群算法耗时较大的问题,提出了一种新的解决方案.方案中采用一种全局异步与精英策略相结合的信息素更新方式,同时合理减少蚁群算法被粒子群算法调用一次所需的迭代代数.对日本旭川垃圾场巡查机器人路径规划问题仿真求解的结果表明,与其他算法相比,该改进算法具有比较明显的速度优势.      

用粒子群算法优化编制露天矿生产作业计划

从露天矿采掘和运输成本的最小化角度出发,构建露天矿生产作业计划模型.基于群体智能优化理论,提出了用粒子群算法对露天矿生产作业计划模型进行解算的方法,并在求解过程中设计了带核粒子及双吸引子的粒子搜索策略.以MATLAB软件为平台进行求解运算最佳作业计划.以某露天铁矿为工程背景进行实例研究,将研究结果与露天矿实际生产指标和非线性规划解算结果进行比较验证.结果表明,粒子群算法可用于露天矿生产作业计划的优化编制.      

云计算环境下冶金车间作业调度方法研究

传统的冶金车间作业调度方法无法以最小化平均完工时间和最大化客户满意度为目标,解决柔性作业车间调度问题,柔性作业车间的合理调度是提高生产效率和效益的关键,为了解决柔性作业车间调度问题求解过程中的难题,解决云计算环境下冶金车间作业调度问题,提出了一种基于人工免疫算法求解柔性作业车间调度问题的方法,采用人工免疫算法进行求解,并针对标准人工免疫算法存在的不足,引入粒子群算法保持种群的多样性,避免出现局部最优解。     

智能微粒群算法

微粒群算法是继蚁群算法之后提出的又一种新型的进化计算技术，具有典型的群体智能的特性。本文首先介绍微粒群算法，然后在对算法的关键参数进行分析的基础上，从算法的离散二进制表示、参数选择与设计、群体组织与进化以及混合微粒群算法等方面对国内外微粒群算法的研究进展进行综述。     

基于粒子群算法的冷连轧张力优化计算

针对冷连轧机高速轧制过程中带钢容易发生打滑的现象,分析了这种打滑现象的物理过程,建立了打滑因子的数学模型,用来表征打滑现象发生的概率。应用该模型研究了基于粒子群优化算法的冷连轧机架间张力优化算法。采用某钢厂现场轧制数据进行了优化算法的仿真试验,结果表明,经过优化后的打滑因子明显减小,打滑现象发生的概率显著降低,通过张力的优化可以很好地控制打滑现象的发生。     

基于LQR-QPSO的地下铲运机控制参数优化研究

现代控制理论是实现地下铲运机路径跟踪控制的重要技术之一。目前,控制算法应用的难点在于参数的选取和整定。为解决控制参数整定问题,提出应用量子行为粒子群优化算法（QPSO）对基于线性二次型调节（LQR）的状态反馈控制器进行参数优化,实现对地下铲运机精准、稳定的路径跟踪控制。状态反馈控制器基于铲运机的误差动力学模型得出,优化后的路径跟踪控制最大横向位置偏差低于0.23 m。仿真试验结果表明：相较于标准粒子群优化算法,QPSO算法优化的路径跟踪控制器的最大横向位置偏差减小53.4%,优化效果更好、成功率更高。     

Permutation-Based Particle Swarm Optimization for Resource-Constrained Project Scheduling

In the light of particle swarm optimization (PSO) which utilizes both local and global experiences during search process, a permutation-based scheme for the resource-constrained project scheduling problem (RCPSP) is presented. In order to handle the permutation-feasibility and precedence-constraint problems when updating the particle-represented sequence or solution for the RCPSP, a hybrid particle-updating mechanism incorporated with a partially mapped crossover of a genetic algorithm and a definition of an activity-move-range is developed. The particle-represented sequence should be transformed to a schedule (including start times and resource assignments for all activities) through a serial method and accordingly evaluated against the objective of minimizing project duration. Experimental analyses are presented to investigate the performances of the permutation-based PSO. The study aims at providing an alternative for solving the RCPSP in the construction field by utilizing the advantages of PSO.     

基于粒子群算法地应力场反演研究进展

阐述了基于粒子群算法的地应力场反演方法的基本原理,介绍了粒子群算法在地应力场反演中的研究现状,分析了其存在的不足,并指出与其他智能算法的结合是其发展的方向。     

Reliability-Based Optimal Design of Truss Structures Using Particle Swarm Optimization

In this work, the particle swarm optimization method is employed for the reliability-based optimal design of statically determinate truss structures. Particle swarm optimization is inspired by the social behavior of flocks (swarms) of birds and insects (particles). Every particle’s position represents a specific design. The algorithm searches the design space by adjusting the trajectories of the particles that comprise the swarm. These particles are attracted toward the positions of both their personal best solution and the best solution of the swarm in a stochastic manner. In typical structural optimization problems, safety is dealt with in a yes/no manner fulfilling the set of requirements imposed by codes of practice. Considering uncertainty for the problem parameters offers a measure to quantify safety. This measure provides a rational basis for the estimation of the reliability of the components and of the entire system. Incorporating the reliability into the structural optimization framework one can seek a reliability-based optimal design. For the problems examined herein, the reliability indexes of the structural elements are obtained from analytical expressions. The structure is subsequently analyzed as a series system of correlated elements and the Ditlevsen bounds are used for the calculation of its reliability index. The uncertain-random parameters considered in this work are the load, the yield-critical stress; and the cross sections of the elements. The considered design variables of the optimization problem are the cross-sectional areas of the groups, which control the size of the truss, and the heights and lengths that control the shape of the truss. The results of the optimization are presented for a 25-bar truss and a 30-bar arch and the robustness of the optimization scheme is discussed.     

基于群体智能优化的MKL-SVM算法及肺结节识别

针对单核学习支持向量机无法兼顾学习能力与泛化能力以及多核函数参数寻优问题,提出了一种基于群体智能优化的多核学习支持向量机算法。首先,研究了五种单核函数对支持向量机分类性能的影响,进一步提出具有全局性质的多项式核和局部性质的拉普拉斯核凸组合形式的多核学习支持向量机算法;其次,为增加粒子多样性及快速寻优,将粒子群优化算法引入了遗传算法中的杂交操作,并用此改进的群体智能优化算法对多核学习支持向量机进行参数寻优。最后,分别采用深度特征与手工特征作为识别算法的输入,研究表明采用深度特征优于手工特征。故本文采用深度特征作为多核学习支持向量机的输入,以交叉遗传与粒子群混合智能优化算法作为其寻优方式。实验选取合作医院数据集对所提算法进行训练并初步测试,进一步为了验证所提算法的泛化能力,选取公开数据集LUNA16进行测试。实验结果表明,本文算法易于跳出局部最优解,提升了算法的学习能力与泛化能力,具有较优的分类性能。      

An Improved Particle Swarm Optimization for Feature Selection

Particle Swarm Optimization (PSO) is a popular and bionic algorithm based on the social behavior associated with bird flocking for optimization problems. To maintain the diversity of swarms, a few studies of multi-swarm strategy have been reported. However, the competition among swarms, reservation or destruction of a swarm, has not been considered further. In this paper, we formulate four rules by introducing the mechanism for survival of the fittest, which simulates the competition among the swarms. Based on the mechanism, we design a modified Multi-Swarm PSO (MSPSO) to solve discrete problems,which consists of a number of sub-swarms and a multi-swarm scheduler that can monitor and control each sub-swarm using the rules. To further settle the feature selection problems, we propose an Improved Feature Selection (IFS) method by integrating MSPSO, Support Vector Machines (SVM) with F-score method. The IFS method aims to achieve higher generalization capability through performing kernel parameter optimization and feature selection simultaneously. The performance of the proposed method is compared with that of the standard PSO based, Genetic Algorithm (GA) based and the grid search based methods on 10 benchmark datasets, taken from UCI machine learning and StatLog databases. The numerical results and statistical analysis show that the proposed IFS method performs significantly better than the other three methods in terms of prediction accuracy with smaller subset of features.