Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

Hybrid optimization algorithm based on chaos,cloud and particle swarm optimization algorithm

As for the drop of particle diversity and the slow convergent speed of particle in the late evolution period when particle swarm optimization（PSO） is applied to solve high-dimensional multi-modal functions,a hybrid optimization algorithm based on the cat mapping,the cloud model and PSO is proposed.While the PSO algorithm evolves a certain of generations,this algorithm applies the cat mapping to implement global disturbance of the poorer individuals,and employs the cloud model to execute local search of the better individuals;accordingly,the obtained best individuals form a new swarm.For this new swarm,the evolution operation is maintained with the PSO algorithm,using the parameter of pop distr to balance the global and local search capacity of the algorithm,as well as,adopting the parameter of mix gen to control mixing times of the algorithm.The comparative analysis is carried out on the basis of 4 functions and other algorithms.It indicates that this algorithm shows faster convergent speed and better solving precision for solving functions particularly those high-dimensional multi-modal functions.Finally,the suggested values are proposed for parameters pop distr and mix gen applied to different dimension functions via the comparative analysis of parameters.

Power system stabilizer design using hybrid multi-objective particle swarm optimization with chaos

A novel technique for the optimal tuning of power system stabilizer (PSS) was proposed,by integrating the modified particle swarm optimization (MPSO) with the chaos (MPSOC).Firstly,a modification in the particle swarm optimization (PSO) was made by introducing passive congregation (PC).It helps each swarm member in receiving a multitude of information from other members and thus decreases the possibility of a failed attempt at detection or a meaningless search.Secondly,the MPSO and chaos were hybridized (MPSOC) to improve the global searching capability and prevent the premature convergence due to local minima.The robustness of the proposed PSS tuning technique was verified on a multi-machine power system under different operating conditions.The performance of the proposed MPSOC was compared to the MPSO,PSO and GA through eigenvalue analysis,nonlinear time-domain simulation and statistical tests.Eigenvalue analysis shows acceptable damping of the low-frequency modes and time domain simulations also show that the oscillations of synchronous machines can be rapidly damped for power systems with the proposed PSSs.The results show that the presented algorithm has a faster convergence rate with higher degree of accuracy than the GA,PSO and MPSO.

Chaos quantum particle swarm optimization for reactive power optimization considering voltage stability

The reactive power optimization considering voltage stability is an effective method to improve voltage stablity margin and decrease network losses,but it is a complex combinatorial optimization problem involving nonlinear functions having multiple local minima and nonlinear and discontinuous constraints. To deal with the problem,quantum particle swarm optimization (QPSO) is firstly introduced in this paper,and according to QPSO,chaotic quantum particle swarm optimization (CQPSO) is presented,which makes use of the randomness,regularity and ergodicity of chaotic variables to improve the quantum particle swarm optimization algorithm. When the swarm is trapped in local minima,a smaller searching space chaos optimization is used to guide the swarm jumping out the local minima. So it can avoid the premature phenomenon and to trap in a local minima of QPSO. The feasibility and efficiency of the proposed algorithm are verified by the results of calculation and simulation for IEEE 14-buses and IEEE 30-buses systems.

Integration of uniform design and quantum-behaved particle swarm optimization to the robust design for a railway vehicle suspension system under different wheel conicities and wheel rolling radii

This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspension system. Based on the new nonlinear creep model derived from combining Hertz contact theory, Kalker's linear theory and a heuristic nonlinear creep model, the modeling and dynamic analysis of a 24 degree-of-freedom railway vehicle system were investigated. The Lyapunov indirect method was used to examine the effects of suspension parameters, wheel conicities and wheel rolling radii on critical hunting speeds. Generally, the critical hunting speeds of a vehicle system resulting from worn wheels with different wheel rolling radii are lower than those of a vehicle system having original wheels without different wheel rolling radii. Because of worn wheels, the critical hunting speed of a running railway vehicle substantially declines over the long term. For safety reasons, it is necessary to design the suspension system parameters to increase the robustness of the system and decrease the sensitive of wheel noises. By applying UD and QPSO, the nominal-the-best signal-to-noise ratio of the system was increased from -48.17 to -34.05 dB. The rate of improvement was 29.31%. This study has demonstrated that the integration of UD and QPSO can successfully reveal the optimal solution of suspension parameters for solving the robust design problem of a railway vehicle suspension system.

Parameters estimation online for Lorenz system by a novel quantum-behaved particle swarm optimization

This paper proposes a novel quantum-behaved particle swarm optimization （NQPSO） for the estimation of chaos＇ unknown parameters by transforming them into nonlinear functions＇ optimization. By means of the techniques in the following three aspects： contracting the searching space self-adaptively; boundaries restriction strategy; substituting the particles＇ convex combination for their centre of mass, this paper achieves a quite effective search mechanism with fine equilibrium between exploitation and exploration. Details of applying the proposed method and other methods into Lorenz systems are given, and experiments done show that NQPSO has better adaptability, dependability and robustness. It is a successful approach in unknown parameter estimation online especially in the cases with white noises.

Support vector machine based on chaos particle swarm optimization for fault diagnosis of rotating machine

The performance of the support vector machine models depends on a proper setting of its parameters to a great extent.A novel method of searching the optimal parameters of support vector machine based on chaos particle swarm optimization is proposed.A multi-fault classification model based on SVM optimized by chaos particle swarm optimization is established and applied to the fault diagnosis of rotating machines.The results show that the proposed fault classification model outperforms the neural network trained by chaos particle swarm optimization and least squares support vector machine,and the precision and reliability of the fault classification results can meet the requirement of practical application.It indicates that chaos particle swarm optimization is a suitable method for searching the optimal parameters of support vector machine.

A Novel Quantum-Behaved Particle Swarm Optimization Algorithm

The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling.This paper analyzed the motion pattern of particles in a square potential well,given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well(BC-QSPSO).In this novel algorithm,the intrinsic cognitive link between particles’experience information and group sharing information was created by using normal Copula function.After that,the control parameters chosen strategy gives through experiments.Finally,the simulation results of the test functions show that the improved algorithms outperform the original QPSO algorithm and due to the error gradient information will not be over utilized in square potential well,the particles are easy to jump out of the local optimum,the BC-QSPSO is more suitable to solve the functions with correlative variables.

Control of Neural Network Feedback Linearization Based on Chaotic Particle Swarm Optimization

A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.

A New Class of Hybrid Particle Swarm Optimization Algorithm

A new class of hybrid particle swarm optimization （PSO） algorithm is developed for solving the premature convergence caused by some particles in standard PSO fall into stagnation. In this algorithm, the linearly decreasing inertia weight technique （LDIW） and the mutative scale chaos optimization algorithm （MSCOA） are combined with standard PSO, which are used to balance the global and local exploration abilities and enhance the local searching abilities, respectively. In order to evaluate the performance of the new method, three benchmark functions are used. The simulation results confirm the proposed algorithm can greatly enhance the searching ability and effectively improve the premature convergence.

Feature Selection Optimization for Mahalanobis-Taguchi System Using Chaos Quantum-Behavior Particle Swarm

The computational speed in the feature selection of Mahalanobis-Taguchi system(MTS)using standard binary particle swarm optimization(BPSO)is slow and it is easy to fall into the locally optimal solution.This paper proposes an MTS variable optimization method based on chaos quantum-behavior particle swarm.In order to avoid the influence of complex collinearity on the distance measurement results,the Gram-Schmidt orthogonalization method is first used to calculate the Mahalanobis distance(MD)value.Then,the optimal threshold point of the system classification is determined through the receiver operating characteristic(ROC)curve;the misclassification rate and the selected variables are defined;the multi-objective mixed programming model is built.The chaos quantum-behavior particle swarm optimization(CQPSO)algorithm is proposed to solve the optimization combination,and the algorithm performs binary coding on the particle based on probability.Using the optimized combination of variables,a new Mahalanobis-Taguchi metric based prediction system is established to complete the task of precise discrimination.Finally,a fault diagnosis for the steel plate is taken as an example.The experimental results show that the proposed method can effectively enhance the iterative speed and optimization precision of the particles,and the prediction accuracy of the optimized MTS is significantly improved.

Short-term Load Prediction of Integrated Energy System with Wavelet Neural Network Model Based on Improved Particle Swarm Optimization and Chaos Optimization Algorithm

To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.

A novel mapping algorithm for three-dimensional network on chip based on quantum-behaved particle swarm optimization

Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.

Improved PSO algorithm based on chaos theory and its application to design flood hydrograph

The deficiencies of basic particle swarm optimization （bPSO） are its ubiquitous prematurity and its inability to seek the global optimal solution when optimizing complex high-dimensional functions. To overcome such deficiencies, the chaos-PSO （COSPSO） algorithm was established by introducing the chaos optimization mechanism and a global particle stagnation-disturbance strategy into bPSO. In the improved algorithm, chaotic movement was adopted for the particles＇ initial movement trajectories to replace the former stochastic movement, and the chaos factor was used to guide the particles＇ path. When the global particles were stagnant, the disturbance strategy was used to keep the particles in motion. Five benchmark optimizations were introduced to test COSPSO, and they proved that COSPSO can remarkably improve efficiency in optimizing complex functions. Finally, a case study of COSPSO in calculating design flood hydrographs demonstrated the applicability of the improved algorithm.

Optimal Parameter Estimation of Transmission Line Using Chaotic Initialized Time-Varying PSO Algorithm

Transmission line is a vital part of the power system that connects two major points,the generation,and the distribution.For an efficient design,stable control,and steady operation of the power system,adequate knowledge of the transmission line parameters resistance,inductance,capacitance,and conductance is of great importance.These parameters are essential for transmission network expansion planning in which a new parallel line is needed to be installed due to increased load demand or the overhead line is replaced with an underground cable.This paper presents a method to optimally estimate the parameters using the input-output quantities i.e.,voltages,currents,and power factor of the transmission line.The equivalentπ-network model is used and the terminal data i.e.,sending-end and receiving-end quantities are assumed as available measured data.The parameter estimation problem is converted to an optimization problem by formulating an error-minimizing objective function.An improved particle swarm optimization(PSO)in terms of time-varying control parameters and chaos-based initialization is used to optimally estimate the line parameters.Two cases are considered for parameter estimation,the first case is when the line conductance is neglected and in the second case,the conductance is considered into account.The results obtained by the improved algorithm are compared with the standard version of the algorithm,firefly algorithm and artificial bee colony algorithm for 30 number of trials.It is concluded that the improved algorithm is tremendously sufficient in estimating the line parameters in both cases validated by low error values and statistical analysis,comparatively.

PSS and SVC Controller Design using Chaos, PSO and SFL Algorithms to Enhancing the Power System Stability

In this paper, the Authors present the designing of power system stabilizer (PSS) and static var compensator (SVC) based on chaos, particle swarm optimization (PSO) and shuffled frog leaping (SFL) Algorithms has been presented to improve the power system stability. Single machine infinite bus (SMIB) system with SVC located at the terminal of generator has been considered to evaluate the proposed SVC and PSS controllers. The coefficients of PSS and SVC controller have been optimized by Chaos, PSO and SFL algorithms. Fi-nally the system with proposed controllers is simulated for the special disturbance in input power of genera-tor, and then the dynamic responses of generator have been presented. The simulation results show that the system composed with recommended controller has outstanding operation in fast damping of oscillations of power system and describes an application of Chaos, PSO and SFL algorithms to the problem of designing a Lead-Lag controller used in PSS and SVC in power system.

改进CQPSO算法的双频航向信标方向图优化

针对仪表着陆系统中的双频航向信标(localizer,LOC)阵列天线最大旁瓣电平抑制和覆盖性能优化问题,改进了一种混沌量子粒子群(chaos quantum particle swarm optimization,CQPSO)算法,对既定约束的LOC阵列天线方向图进行馈电参数寻优。在分析双频LOC覆盖形成的基础上,剖析了国际民航组织对LOC信号的覆盖要求,获得LOC方向图应满足的约束条件。为提升全局寻优能力和有效避免陷入局部最优,引入混沌思想和加权平均最优位置对CQPSO算法进行改进,使用改进的CQPSO算法对20阵元等间距LOC阵列天线进行约束条件下的馈电参数寻优,并依据所获得的馈电参数仿真分析LOC阵列天线的方向性。仿真实验表明,改进CQPSO算法寻优得到的馈电参数形成的方向图,相比于目前广泛使用的24阵元等间距LOC阵列天线的方向图,在天线数量减少16.67%的情况下,航道信号辐射的最大旁瓣电平降低了3.32 dB,且覆盖性能更好;而相比于目前广泛使用的20阵元不等间距LOC阵列天线的方向图,航道信号辐射的最大旁瓣电平降低了25.55 dB,证明了改进CQPSO算法的有效性。

重联编组条件下城轨车底运用方案优化研究

随着对城市轨道交通日常客流出行规律的不断挖掘,运输组织创新是解决客流与运力有效匹配问题、实现系统能耗节约及社会经济效益最大化的关键手段,而重联编组运营模式可有效提高客流与运力的匹配度。通过分析重联编组与固定编组条件下车底运用问题的差异性,构建基于“影子列车”的重联编组车次接续法,以车底与车次接续、车底一致性和重联编组作业等为约束条件,以车次接续总成本最小和车底使用时间标准差最小为目标函数,构建重联编组条件下城市轨道交通车底运用方案优化模型。通过引入非线性惯性权重更新方法和动态学习因子,设计多目标混沌粒子群优化(Multi-objective Chaos Particle Swarm Optimization,MOCPSO)算法。以某城市轨道交通线路的102个车次为例验证模型的有效性,并对车次接续时间上限、车底重联解编作业和车底存放情况进行讨论分析。研究结果表明:MOCPSO算法通过引入Logistic混沌优化策略可有效跳出局部最优;车次接续时间上限越大,需要投入的车底数量越多,不宜使车次接续时间过长;在车底运用过程中应尽可能地减少联挂解编作业的次数。该方法可为决策者提供一系列不同运营投入和车底运用均衡性下的车底运用Pareto非劣方案,有助于协调线路运能利用,同时降低了轨道交通的能耗。

CQPSO-BP算法在风电机组齿轮箱故障诊断中的应用

为实现风电机组齿轮箱故障模式的有效识别,提出一种基于混沌量子粒子群优化BP神经网络(CQPSOBP)的故障诊断方法。在该算法中,利用混沌序列来初始化粒子的初始角位置,可提高种群的遍历性;通过引入变异操作,避免算法陷入早熟收敛,并依此来对BP神经网络的初始权值和阈值进行优化。实例表明,同粒子群优化BP神经网络(PSO-BP)与BP网络的诊断结果相比,CQPSO-BP算法具有收敛速度快、识别精度高的优点,可有效用于风电机组齿轮箱的故障诊断系统中。

基于精英引导的社会学习粒子群优化算法

为了改进经典粒子群算法(PSO)过早收敛和全局搜索能力不足的缺点,提出了一种基于精英引导的社会学习粒子群优化算法(ESLPSO)。在ESLPSO中,提出了一种分层拓扑结构的搜索方法。这一策略根据粒子的适应度表现将粒子分化为最优的精英粒子和其余的平民粒子,革新了传统种群迭代搜索的更新样本,由此加强了整个种群演化信息的引导作用。采用Cubic混沌初始化赋予了初始粒子群体在搜索空间内的广域覆盖能力。设计了精英粒子引导的社会学习策略,通过增加态叠加的不确定性更好地利用了种群演化的多维信息。在此基础上,结合极值扰动迁移机制激励粒子经历新的搜索路径和区域,增加种群的多样性,平衡种群在搜索过程中的探索和开发能力。基于12个涵盖单峰、多峰以及旋转多峰的基准测试函数集对所提算法的性能进行了验证。此外,ESLPSO与其他8种PSO改进算法的比较结果表明,ESLPSO在解决不同类型函数方面表现出了优秀的搜索性能,具有高效的求解稳定性和优异的求解结果。