Novel Discrete Particle Swarm Optimization Based on Huge Value Penalty for Solving Engineering Problem

For the purpose of solving the engineering constrained discrete optimization problem, a novel discrete particle swarm optimization（DPSO） is proposed. The proposed novel DPSO is based on the idea of normal particle swarm optimization（PSO）, but deals with the variables as discrete type, the discrete optimum solution is found through updating the location of discrete variable. To avoid long calculation time and improve the efficiency of algorithm, scheme of constraint level and huge value penalty are proposed to deal with the constraints, the stratagem of reproducing the new particles and best keeping model of particle are employed to increase the diversity of particles. The validity of the proposed DPSO is examined by benchmark numerical examples, the results show that the novel DPSO has great advantages over current algorithm. The optimum designs of the 100-1 500 mm bellows under 0.25 MPa are fulfilled by DPSO. Comparing the optimization results with the bellows in-service, optimization results by discrete penalty particle swarm optimization（DPPSO） and theory solution, the comparison result shows that the global discrete optima of bellows are obtained by proposed DPSO, and confirms that the proposed novel DPSO and schemes can be used to solve the engineering constrained discrete problem successfully.

Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid ap- proximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimiza- tion (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

Coordinated Controller Tuning of a Boiler Turbine Unit with New Binary Particle Swarm Optimization Algorithm

Coordinated controller tuning of the boiler turbine unit is a challenging task due to the nonlinear and coupling characteristics of the system.In this paper,a new variant of binary particle swarm optimization （PSO） algorithm,called probability based binary PSO （PBPSO）,is presented to tune the parameters of a coordinated controller.The simulation results show that PBPSO can effectively optimize the control parameters and achieves better control performance than those based on standard discrete binary PSO,modified binary PSO,and standard continuous PSO.

SECURE STEGANOGRAPHY BASED ON BINARY PARTICLE SWARM OPTIMIZATION

The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.

Service composition based on discrete particle swarm optimization in military organization cloud cooperation

This paper addresses the problem of service composition in military organization cloud cooperation（MOCC）. Military service providers（MSP） cooperate together to provide military resources for military service users（MSU）. A group of atom services, each of which has its level of quality of service（QoS）, can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users＇ will. In this paper a method based on discrete particle swarm optimization（DPSO） is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU＇s requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization（PSO） and genetic algorithm（GA）.

RESEARCH ON OPTIMIZING THE MERGING RESULTS OF MULTIPLE INDEPENDENT RETRIEVAL SYSTEMS BY A DISCRETE PARTICLE SWARM OPTIMIZATION

The result merging for multiple Independent Resource Retrieval Systems (IRRSs), which is a key component in developing a meta-search engine, is a difficult problem that still not effectively solved. Most of the existing result merging methods, usually suffered a great influence from the usefulness weight of different IRRS results and overlap rate among them. In this paper, we proposed a scheme that being capable of coalescing and optimizing a group of existing multi-sources-retrieval merging results effectively by Discrete Particle Swarm Optimization (DPSO). The experimental results show that the DPSO, not only can overall outperform all the other result merging algorithms it employed, but also has better adaptability in application for unnecessarily taking into account different IRRS's usefulness weight and their overlap rate with respect to a concrete query. Compared to other result merging algorithms it employed, the DPSO's recognition precision can increase nearly 24.6%, while the precision standard deviation for different queries can decrease about 68.3%.

Optimizing the Multi-Objective Discrete Particle Swarm Optimization Algorithm by Deep Deterministic Policy Gradient Algorithm

Deep deterministic policy gradient(DDPG)has been proved to be effective in optimizing particle swarm optimization(PSO),but whether DDPG can optimize multi-objective discrete particle swarm optimization(MODPSO)remains to be determined.The present work aims to probe into this topic.Experiments showed that the DDPG can not only quickly improve the convergence speed of MODPSO,but also overcome the problem of local optimal solution that MODPSO may suffer.The research findings are of great significance for the theoretical research and application of MODPSO.

Optimal Formation Reconfiguration Control of Multiple UCAVs Using Improved Particle Swarm Optimization

Optimal formation reconfiguration control of multiple Uninhabited Combat Air Vehicles （UCAVs） is a complicated global optimum problem. Particle Swarm Optimization （PSO） is a population based stochastic optimization technique inspired by social behaviour of bird flocking or fish schooling. PSO can achieve better results in a faster, cheaper way compared with other bio-inspired computational methods, and there are few parameters to adjust in PSO. In this paper, we propose an improved PSO model for solving the optimal formation reconfiguration control problem for multiple UCAVs. Firstly, the Control Parameterization and Time Diseretization （CPTD） method is designed in detail. Then, the mutation strategy and a special mutation-escape operator are adopted in the improved PSO model to make particles explore the search space more efficiently. The proposed strategy can produce a large speed value dynamically according to the variation of the speed, which makes the algorithm explore the local and global minima thoroughly at the same time. Series experimental results demonstrate the feasibility and effectiveness of the proposed method in solving the optimal formation reconfiguration control problem for multiple UCAVs.

Dynamic Weapon Target Assignment Based on Intuitionistic Fuzzy Entropy of Discrete Particle Swarm

Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzzy Entropy of Discrete Particle Swarm Optimization(IFDPSO) and makes it applied to Dynamic Weapon Target Assignment(WTA). First, the strategy of choosing intuitionistic fuzzy parameters of particle swarm is defined, making intuitionistic fuzzy entropy as a basic parameter for measure and velocity mutation. Second, through analyzing the defects of DPSO, an adjusting parameter for balancing two cognition, velocity mutation mechanism and position mutation strategy are designed, and then two sets of improved and derivative algorithms for IFDPSO are put forward, which ensures the IFDPSO possibly search as much as possible sub-optimal positions and its neighborhood and the algorithm ability of searching global optimal value in solving large scale 0-1 knapsack problem is intensified. Third, focusing on the problem of WTA, some parameters including dynamic parameter for shifting firepower and constraints are designed to solve the problems of weapon target assignment. In addition, WTA Optimization Model with time and resource constraints is finally set up, which also intensifies the algorithm ability of searching global and local best value in the solution of WTA problem. Finally, the superiority of IFDPSO is proved by several simulation experiments. Particularly, IFDPSO, IFDPSO1~IFDPSO3 are respectively effective in solving large scale, medium scale or strict constraint problems such as 0-1 knapsack problem and WTA problem.

Particle Swarm Optimization and Its Application in Transmission Network Expansion Planning

The author introduced particle swarm optimization as a new method for power transmission network expansion planning. A new discrete method for particle swarm optimization was developed,which is suitable for power transmission network expansion planning, and requires less computer s memory.The optimization fitness function construction, parameter selection, convergence judgement, and their characters were analyzod.Numerical simulation demonstrated the effectiveness and correctness or the method. This paper provides an academic and practical basis of particle swarm optimization in application of transmission network expansion planning for further investigation.

基于改进二进制粒子群算法优化DBN的轴承故障诊断

针对滚动轴承故障振动信号非平稳性的特点,对二进制粒子群优化算法(binary particles swarm optimization,BPSO)和深度信念网络(deep belief network,DBN)进行研究,提出一种基于局部均值分解(local mean decomposition,LMD)和IBPSO-DBN的轴承故障诊断方法。提出用加权惯性权重改进BPSO迭代过程中的固定权重,再用改进BPSO优化DBN的隐含层神经元个数和学习率。该方法先对信号进行LMD,提取出各PF分量的散布熵和时域指标,并构建特征矩阵,然后把特征矩阵输入改进BPSO-DBN模型中训练,实现滚动轴承故障诊断和分类。采用试验轴承数据做验证并与其他诊断方法对比,结果表明,基于LMD和BPSO-DBN的滚动轴承故障诊断方法具有较好的故障识别率。

公路隧道风光水储互补发电系统容量配置研究

为降低公路隧道的电力运营成本,探究可再生能源互补发电系统在公路隧道的应用前景,研究合适的容量配置求解方法。建立利用风、光、水和储能设备的互补发电系统为公路隧道提供电力资源。以特长公路隧道(总长7.1 km)为估算模型,采用改进后的粒子群优化算法,即离散型自适应粒子群优化算法,以全生命周期的建设成本和设备维护成本最小为目标函数,以缺电负荷率(LPSP)和储能电池的状态为约束,对风力发电设备、光伏发电设备、水力发电设备和储能设备的最优容量配置进行求解。结果表明:1)对比标准粒子群算法,离散型自适应粒子群优化算法的总投入成本更少,寻优能力更强;2)对比该隧道1年的用电成本,前期投入将在5年内回本;3)在风光水储互补发电系统的设备全生命使用周期的20年内,该隧道可节省1 920.39万元电费。

基于离散粒子群算法的管道保温结构优化研究

针对目前管道保温结构优化算法不稳定、结果优化程度不高的问题,建立以经济效益为目标函数,以满足国家散热损失标准等条件为约束函数的离散型数学模型。以BPSO算法为基础改变其位置更新规则,防止种群进化失效;采用自适应权重增加粒子的全局和局部搜索能力;充分利用模拟退火算法的思想避免出现早熟现象。应用改进的算法分别对普通蒸汽管道和核电站的蒸汽管道进行系统仿真实验。结果表明,该算法能够在满足国家散热损失标准等条件下取得最优解,可以为管道保温结构提供合理的优化方案。

高光谱结合离散二进制粒子群算法对久保桃可溶性固形物含量的检测

可溶性固形物(SSC)是评价久保桃内部品质的重要指标。传统的SSC检测有损、费时、费力;快速、无损检测久保桃的SSC含量对于其品质分级有着重要意义。离散二进制粒子群算法(BPSO)是在标准粒子群算法(PSO)的基础上,更新速度公式得到的,具有精度高,收敛快的特点,多用于离散空间的优化问题。基于高光谱技术结合BPSO算法及BPSO的组合特征波长选择算法对久保桃的SSC含量预测进行研究。首先采集198个久保桃样本的高光谱信息,获取久保桃900~1700nm范围内的光谱信息,计算感兴趣区域的平均光谱作为有效光谱数据,同时测量久保桃的SSC值。采用K-S(Kennard-Stone)算法将样本划分为校正集(147个)和预测集(51个)。使用BPSO特征波长选择算法对久保桃的原始光谱数据进行特征波长提取,并与竞争性自适应重加权算法(CARS)、连续投影法(SPA)、无信息变量选择法(UVE)等特征波长选择算法比较。同时为了避免单一算法建模中的不稳定问题,提出了基于BPSO的一次组合(BPS0+CARS、BPSO+SPA、BPSO+UVE)和二次组合[(BPSO+CARS)-SPA]、[(BPSO+SPA)-SPA]、[(BPSO+UVE)-SPA]特征波长提取方法。基于上述10种特征波长提取方法分别建立支持向量机(LS-SVM)模型和遗传算法(GA)优化的支持向量机模型(GA-SVM)模型。结果表明,基于BPSO算法提取特征波长建立的模型预测性能均高于其他单一特征波长方法,建立的两种模型预测集决定系数R_(p)^(2)均达到0.97以上;基于BPSO的组合算法中,二次组合(BPSO+SPA)-SPA算法建立的LS-SVM在特征波长数量较少的情况下对久保桃SSC含量预测性能最高,校正集和预测集决定系数R_(c)^(2)为0.982,R_(p)^(2)为0.955,均方根误差RMSEC为0.108,RMSEP为0.139。该模型预测性能略低于BPSO算法,但其仅用了22个特征波长进行建模,极大地简化了模型。说明(BPSO+SPA)-SPA是一种有效的特征波长提取方法,为水果SSC含量的无损检测提供了新的检测方法。

基于GA-PSO混合优化SVM的机载EHA故障诊断

针对机载电静液作动器(Electro-Hydrostatic Actuator,EHA)的典型故障,详细分析了故障原理并在MATLAB/Simulink中搭建了仿真模型。为了高效准确识别故障类型,提出一种用遗传算法(Genetic Algorithm,GA)和粒子群算法(Particle Swarm Optimization,PSO)混合优化支持向量机(Support Vector Machine,SVM)的故障诊断算法。GA鲁棒性好且全局搜索能力强但收敛速度慢,PSO对样本规模不敏感且具有记忆功能但易陷入局部最优,故融合两种算法寻找SVM的最优参数。另外,为了解决传统SVM多分类方法“一对多”和“一对一”易出现不可分的问题,建立一种偏二叉树结构的SVM多分类模型。对于采集的原始数据高度重合的情况,引入时域特征统计量进一步提升模型的分类性能。实验结果表明,提出的混合优化算法寻优速度更快、所寻参数更佳,同时用该算法优化的SVM分类模型相比于其他5类常用的机器学习模型分类效果更好,故障识别正确率可达97.7%。

基于混合离散粒子群优化的控制模式分配算法

连续微流控生物芯片是生物化学实验自动化、微型化的革命性技术.多路复用器的控制模式分配作为连续微流控生物芯片自动化设计的关键环节之一,是难的NP(Non-deterministic Polynomial)优化问题.现有工作采用粒子群优化算法求解控制模式分配问题存在过早陷入局部最优解、收敛速度慢以及算法稳定性差的缺点.为此,本文提出一种连续微流控生物芯片下基于混合离散粒子群优化的控制模式分配算法.首先,为了加快算法收敛速度及避免过早陷入局部最优解,提出了离散的自适应区域搜索策略.其次,通过基于样例的社会学习机制提高了算法的稳定性.然后,采用等距抽值的方式筛选出自适应区域搜索策略中重要参数的最佳组合,以进一步提高分配方案的质量.最终实验结果表明,所提算法在多路复用器中阀门使用数量上平均优化了19.01%,在算法稳定性上提高了29.18%,且在现实的生化应用中有良好的性能表现.

微分光谱变换方法对土壤重金属含量反演精度的影响研究

随着我国工农业的日益发展,土壤中以镍(Ni)、铁(Fe)、铜(Cu)、铬(Cr)、铅(Pb)等为代表的重金属污染对人类生活产生了严重影响。高光谱遥感技术具有实时、无损、快速等优点,为高效准确地获取土壤重金属含量提供了科学手段。而在利用高光谱数据反演土壤重金属含量时,微分光谱变换方法的选择对遥感反演土壤重金属含量的精度有显著影响。为明确二者关系,基于研究区采集的60个土壤样品,测定其Ni、Fe、Cr、Cu、Pb等含量以及350~2500 nm波段范围的光谱反射率。在相关系数(CC)分析法的基础上通过改进离散粒子群算法(MDBPSO)优选遥感探测土壤重金属含量的特征波段。最终以优选出的特征波段作为自变量利用随机森林(RF)算法构建了Ni、Fe、Cr、Cu、Pb等重金属含量的估测模型。在对原始反射率数据进行高斯平滑的基础上,对比分析了一阶微分(R′)、对数倒数的一阶微分(1/lgR)′、倒数的一阶微分(1/R)′、指数的一阶微分(e^(R))′四种微分光谱变换方法对土壤重金属反演精度的影响。结果表明,在CC分析法的基础上,MDBPSO算法可以有效地降低光谱数据的冗余度,提高模型的运行效率。其中R′、(1/lgR)′、(1/R)′、(e^(R))′中对Ni、Fe、Cr、Cu、Pb敏感的特征波段个数分别至少减少了154、363、135、744和889个。(1/lgR)′、R′、R′、(1/R)′、R′光谱变换方法分别应用到Ni、Fe、Cr、Cu、Pb特征波段的组合运算中,得到的估测模型的精度优于其他微分变换方法;模型检验集的决定系数分别为0.913、0.906、0.872、0.912、0.876,均方根误差分别为0.743、0.095、2.588、1.541、1.453。本研究为利用遥感数据反演土壤重金属含量微分光谱变换方法的选择提供了科学的参考,为进一步实现土壤重金属含量的大面积高精度遥感监测提供新的思路。

基于动态粒子群优化的X结构Steiner最小树算法

Steiner最小树(SMT)是总体布线的最佳连接模型,其构造是1个NP-难问题。粒子群优化(PSO)算法在解决NP-难问题中具有良好的表现,而PSO算法中种群的拓扑结构及搜索信息的传递机制对其性能有着很大的影响。1个适用于具体问题的种群拓扑结构对算法性能的提升极为显著。因此,利用PSO求解总体布线问题需要根据具体布线问题的特性来选择合适的粒子拓扑结构策略,以提升PSO的性能。提出基于动态PSO的X结构Steiner最小树(XSMT)算法以解决总体布线问题。首先,设计动态子群与信息交换策略,对种群进行子群划分,引入信息交换的概念,让子群在保持独立性的同时与其他子群进行信息交换,增加子群多样性;其次,设计粒子学习与变异策略,通过设置子群中粒子的学习对象使子群趋向于全局最优,并选择每个子群中适应度值最好的粒子进行变异,使粒子更易于跳出局部最优;最后,设计从多群局部学习过渡到单群全局学习策略,使算法在迭代次数到达阈值之后从局部学习过渡到全局学习,使得粒子在较优拓扑结构的基础上内部连接以获得更好的线长优化率。实验结果表明,与现有的2种R结构SMT(RSMT)算法相比,所提算法在优化线长方面分别优化了10.25%、8.24%;与现有的3种XSMT算法相比,该算法在优化线长方面分别优化了2.44%、1.46%、0.48%,验证了算法的有效性。