Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Quantum-Inspired Particle Swarm Optimization Algorithm Encoded by Probability Amplitudes of Multi-Qubits

To enhance the optimization ability of particle swarm algorithm, a novel quantum-inspired particle swarm optimization algorithm is proposed. In this method, the particles are encoded by the probability amplitudes of the basic states of the multi-qubits system. The rotation angles of multi-qubits are determined based on the local optimum particle and the global optimal particle, and the multi-qubits rotation gates are employed to update the particles. At each of iteration, updating any qubit can lead to updating all probability amplitudes of the corresponding particle. The experimental results of some benchmark functions optimization show that, although its single step iteration consumes long time, the optimization ability of the proposed method is significantly higher than other similar algorithms.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Design of Radial Basis Function Network Using Adaptive Particle Swarm Optimization and Orthogonal Least Squares

This paper presents a two-level learning method for designing an optimal Radial Basis Function Network (RBFN) using Adaptive Velocity Update Relaxation Particle Swarm Optimization algorithm (AVURPSO) and Orthogonal Least Squares algorithm (OLS) called as OLS-AVURPSO method. The novelty is to develop an AVURPSO algorithm to form the hybrid OLS-AVURPSO method for designing an optimal RBFN. The proposed method at the upper level finds the global optimum of the spread factor parameter using AVURPSO while at the lower level automatically constructs the RBFN using OLS algorithm. Simulation results confirm that the RBFN is superior to Multilayered Perceptron Network (MLPN) in terms of network size and computing time. To demonstrate the effectiveness of proposed OLS-AVURPSO in the design of RBFN, the Mackey-Glass Chaotic Time-Series as an example is modeled by both MLPN and RBFN.

Quantum control based on three forms of Lyapunov functions

This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.

考虑碳排放的铁路路基施工机群配置优化

铁路路基施工机群配置关系施工工期,会直接产生施工成本,对生态环境造成重要影响,进而产生较高碳排放量。首先,考虑铁路路基施工工期、施工成本、施工绿色指数及碳排放等目标,建立铁路路基施工机群配置优化模型。其中,将施工机群配置优化模型中各优化目标作为一级指标建立机群配置多目标决策偏好评价指标体系,并将组合数有序加权算子(Combination Ordered Weighted Averaging,C-OWA)法与基于指标间相关性分析的权重确定(Criteria Importance Though Intercriteria Correlation,CRITIC)法结合对指标进行组合赋权。其次,采用基于莱维飞行机制的量子粒子群优化(Quantum Particle Swarm Optimization,QPSO)算法求解该施工机群配置优化模型。最后,以某铁路路基工程某标段为例进行实证分析。结果显示,多目标优化方案较原方案工期提前75 d,成本降低203.257万元,绿色指数提升5.250%,碳排放量降低1.305 t。研究结果可为铁路路基施工机群配置优化提供新思路。

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.

融合混沌映射和麻雀搜索的PSO图像分割算法

针对传统图像分割算法具有实时性低、丢失细节的问题,提出了一种利用SFM混沌映射改进粒子群并与麻雀搜索算法结合的智能优化算法(MSAPSO),实现OTSU阈值分割。首选利用SPM混沌映射产生的混沌现象,初始化粒子种群,提高粒子的随机性与遍历性,随之加强粒子全局搜索能力;其次使用自适应粒子群优化,惯性权重动态更替变化,用来调节局部与全局搜索能力的平衡;然后引入麻雀算法思想,使其引领粒子群向最优解范围内搜索,达到加快收敛的同时跳出局部极值;最后通过对不同标准图像测试,并与多种算法比较分析,仿真结果表明,所提方法相较其他群体智能算法,有更快的收敛速度和更好的阈值精度,表明所提算法的可行性和有效性。

An Effective Non-Commutative Encryption Approach with Optimized Genetic Algorithm for Ensuring Data Protection in Cloud Computing

Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storage and access,our proposed work designs a Novel Quantum Key Distribution(QKD)relying upon a non-commutative encryption framework.It makes use of a Novel Quantum Key Distribution approach,which guarantees high level secured data transmission.Along with this,a shared secret is generated using Diffie Hellman(DH)to certify secured key generation at reduced time complexity.Moreover,a non-commutative approach is used,which effectively allows the users to store and access the encrypted data into the cloud server.Also,to prevent data loss or corruption caused by the insiders in the cloud,Optimized Genetic Algorithm(OGA)is utilized,which effectively recovers the data and retrieve it if the missed data without loss.It is then followed with the decryption process as if requested by the user.Thus our proposed framework ensures authentication and paves way for secure data access,with enhanced performance and reduced complexities experienced with the prior works.

钻孔瞬变电磁法扫描探测RCQPSO-LMO组合算法2.5D反演

利用钻孔进行超前探测地质构造及含水体是地下开挖工程中的常规手段,如何利用这些钻孔进行钻孔瞬变电磁法扫描探测,从而实现钻孔孔壁外围地质异常体的精细探测,对实现地下工程地质透明化具有重要的指导意义.本文提出钻孔瞬变电磁法扫描探测2.5D反演的数据解译方法,首先针对随机性反演算法时效性低,易陷入局部最优解,而确定性反演算法依赖初始模型的问题,提出了组合策略的量子粒子群优化算法用来随机搜索最优初始模型.在此基础上,利用Levenberg-Marquarat方法求解Occam反演的目标函数,形成了RCQPSO-LMO组合算法进行2.5D反演,通过对比组合算法和单一算法,验证了组合算法具有更精确的反演结果.其次结合屏蔽条件下扫描探测,对比分析了有无屏蔽的2.5D反演结果,通过设定屏蔽系数对非探测方向信号进行部分压制,可以较好地解决钻孔径向扫描探测中对非探测方向信号部分屏蔽下的反演及成像.最后建立三组理论模型进行组合算法2.5D反演,结果表明:组合算法反演结果与理论模型的一致性较好,对低阻异常体的反演精度较高,验证了组合算法对钻孔孔壁外围低阻异常体具有较高的反演精度和分辨能力.

多场景下基于AHP-EWM的人体健康状态评估模型研究

为解决人体健康评估方法个性化监测不足的问题以及在满足不同场景下健康状态精细化评估的需求,需要一种基于多场景的人体健康状态评估方法来实现长期自动化监测。提出一种基于层次分析法(AHP)和熵权法(EWM)组合的多场景人体健康状态评估模型。首先采集人体在运动、休息、工作/学习和娱乐等4种不同场景下的健康监测指标数据,构建相应的评估指标体系。然后分别根据评估指标计算出AHP和EWM权重,再采用量子粒子群优化(QPSO)算法对AHP和EWM中的主客观权重进行分配,以确保评价指标占比的客观性。最后通过模糊综合评价法对人体健康状态进行评估和量化,并利用实际监测数据对方法的可靠性和稳定性进行验证。实验结果表明,在4种场景下所提方法的综合得分分别为63.78、59.83、58.71和59.21,表明在不同场景下该模型都具有较好的准确性和稳定性。根据评估结果,对测试者的身体状态评价结果进行分析,并给出一些健康建议。所提模型可全面了解人体在不同场景下的健康状况,并为人们提供科学的健康指导,从而为健康管理和疾病预防提供科学依据。

基于改进PSO算法的光伏阵列MPPT研究

为解决传统粒子群优化(PSO)算法在寻优过程中出现粒子早熟、收敛速度慢、易陷入局部优化等问题,提出一种基于反向学习的Logistic-Tent双重混沌映射和时变双重压缩因子(TVCF)策略的改进粒子群优化(LT-TVCFPSO)算法,在传统PSO算法基础上,引入了Logistic-Tent混沌映射和TVCF,既可增强种群多样性,避免粒子早熟,跳出局部优化,又能加快粒子收敛,提升全局寻优能力。最后在MATLAB/Simu-link上进行仿真。仿真结果表明:相比于传统MPPT算法,LT-TVCFPSO算法能够快速准确地追踪到全局最大功率点(GMPP)。

基于低碳物流的危化品仓库堆垛布局优化研究

为保证危化品仓库安全的同时有效减少碳排放并提升经济效益,建立危险指数最小、物料搬运量最小和碳排放成本最小的危化品仓库堆垛布局多目标优化模型,采用改进的粒子群-禁忌搜索混合算法对模型进行求解。该算法在传统粒子群算法的基础上加入多点变异操作,并在粒子群算法得出解的基础上加入禁忌搜索算法,提高算法跳出局部最优解的能力。研究结果表明:利用本文建立的多目标优化模型及改进算法,危险指数、物料搬运量和碳排放成本均有所下降,解集质量较高,从而在保证危化品安全的情况下,有效降低物料搬运量及碳排放成本。研究结果可为危化品企业对仓库内部碳排放量的影响因素和数值计算以及危化品仓库安全性的界定提供参考与借鉴。

基于双通道生成对抗网络的城市用电负荷缺失数据补全方法

用电负荷数据的完整性与有效性在负荷预测等应用中具有重要意义。传统的缺失数据补全方法缺乏对用电负荷和多种外部时空关联信息的挖掘,难以获得高精度的补全结果。文中提出了一种双通道生成对抗网络,对缺失的负荷数据进行补全。首先,根据负荷的周期性变化特征和时空关联性构建三阶负荷张量,并将影响负荷变化的多种外部因素构建为三阶辅助信息张量。然后,为满足两种张量的双输入需求,在生成对抗网络的输入层引入双通道机制,通过卷积与反卷积运算提取张量的特征;为提升网络对张量数据的训练效果和补全精度,将张量分解损失引入原始损失函数,并采用改进的混沌映射粒子群优化算法联合优化超参数和网络。最后,在真实负荷数据集上开展数据补全实验。结果表明,所提方法能够对随机缺失率不超过50%、连续缺失不超过3天的负荷数据进行准确补全。

基于多变量灰色系统的乏信息堤防变形短期预测模型

依据信息模糊和不确定状态下乏信息数据处理理论,提出了一种改进多变量灰色系统的乏信息堤防短期预测模型;引入多变量灰色模型对多测点的沉降变形序列进行拟合,结合混沌粒子群优化算法和分数阶微积分理论,实现了在乏信息条件下对堤防多测点变形的短期预测;由对比结果可知,研究提出的模型可行且有效,填补了堤防乏信息处理模型的空白。

基于混沌多目标粒子群算法的综合能源调度

目的针对当前综合能源系统中资源协同优化效率不足、微网运行经济性和环保性差的问题,提出了一种计及风电储能及不稳定因素的微网优化调度方法。方法该方法在微网负荷侧需求响应对新能源消纳影响的基础上,以消纳新能源和削峰填谷为目的,提出了优化负荷曲线的方案;然后,考虑微网调度侧风电出力的不稳定性以及微网内部设备的耦合,进行优化调度以降低微网运行成本、减少环境惩罚费用并提高风电消纳平稳性;最后,采用混沌多目标粒子群算法对优化问题进行求解,并在风电不稳定度占比0%、5%、10%和15%时进行了算例仿真分析。结果当风电不稳定度为10%和加入风电储能,系统运行成本和环境治理费用最少,比方案1和无风电储能少6919.4元,风电平稳量也提高38 kWh。在电热冷网中,负荷侧加入需求响应后,系统得到稳定运行和能源合理利用,可以很好地满足负荷侧用能需求。从算法对比中,混沌多目标粒子群算法加入自适应权重和变异率后,具有较强的全局搜索能力和更好的准确性。结论该方法通过合理设置风电不稳定度能够有效降低运行成本和环境惩罚费用,提高风电稳定性,其次,负荷侧的需求响应可以一定程度地削峰填谷和消纳新能源。

基于随机增强量子粒子群算法的弹性波数值模拟

在本文中,我们提出了一种随机增强量子粒子群优化算法,并基于该随机增强量子粒子群算法提出了一种新的有限差分格式。随机增强量子粒子群优化算法具有明显的收敛速度优势,可以在第200代内收敛。在相同条件下,未改进的量子粒子群算法的收敛速度远低于随机增强量子粒子群算法。数值频散分析表明,基于随机增强量子粒子群算法的优化有限差分格式具有更大的频谱覆盖范围并将精度误差控制在了有效范围之内,这意味着随机增强量子粒子群算法具有更好的搜索全局精确解的能力。最后,采用基于随机增强量子粒子群算法的优化有限差分格式对弹性波动方程进行数值模拟。数值模拟结果表明,基于随机增强量子粒子群算法的优化有限差分格式能有效压制数值频散。

基于寻优算法的双馈风机变流器动态运行控制参数辨识

针对运行过程中双馈风机变流器控制参数难以获取的问题,提出了一种基于自适应混沌粒子群算法的转子侧变流器参数辨识方法。首先,基于机组实际运行下可量测电气量时间序列,建立双馈风机变流器控制系统离散化数学模型;然后,根据不同观测电气量下参数的轨迹灵敏度,对辨识难易程度进行分析;最后,利用自适应混沌粒子群算法对变流器PI控制参数进行辨识。仿真实验结果验证了所提出辨识方法的准确性与可行性。