基于改进PSO-BP神经网络的旅游客流量预测方法

提高旅游风景区日客流量的预测精度,对旅游风景区的日常运营管理和旅游资源的保护有重要意义.PSO-BP被广泛应用于预测中,针对PSO算法的惯性权重采取线性动态变化时无法满足粒子多样性和易陷入局部极值等缺陷,文章提出一种利用改进后的PSO-BP方法,利用粒子适应度值对惯性权重进行动态非线性变化,同时结合粒子迭代周期增加位置扰动,对粒子群算法进行改进.将改进后的PAPSO算法(particle swarm optimization algorithm with position disturbance and adaptive inertia weight,PAPSO)对BP神经网络的初始权值和阈值进行优化,建立黄山风景区日客流量的Matlab预测模型,对黄山旅游客流量数据进行实验,结果表明文章提出的基于PAPSO算法优化BP神经网络的预测模型有效地提升了预测精度.     

粒子群优化模糊神经网络在语音识别中的应用

针对模糊神经网络训练采用BP算法比较依赖于网络的初始条件,训练时间较长,容易陷入局部极值的缺点,利用粒子群优化算法(PSO)的全局搜索性能,将PSO用于模糊神经网络的训练过程.由于基本PSO算法存在一定的早熟收敛问题,引入一种自适应动态改变惯性因子的PSO算法,使算法具有较强的全局搜索能力.将此算法训练的模糊神经网络应用于语音识别中,结果表明,与BP算法相比,粒子群优化的模糊神经网络具有较高的收敛速度和识别率.     

基于PCA和改进的PSO-SVM的机器人移动方向分类

随着人们创新水平的不断提高,为了更加准确的实现机器人的导航任务,提出了一种基于改进的粒子群优化支持向量机中的参数的方法.首先利用主成分分析法对数据进行降维,然后利用改进的粒子群优化算法,对SVM中的惩罚参数c和核函数的参数g进行优化,最后代入到SVM中,以此来达到运用SVM对机器人的导航任务进行分类识别.相对于其他算法,容易发现改进的粒子群优化算法优化后的支持向量机可以达到很好的效果.这种识别分类可以帮助人们很好的对机器人进行导航,对今后机器人的研究具有很大的应用价值.     

一种改进的粒子群优化算法及其算法测试

粒子群算法原理简单、参数少、易于实现,但有时容易陷入局部最优解,收敛速度慢.本文在粒子群算法理论研究的基础上,对算法的初始值选取、惯性权重取值、算法结构进行了改进:首先采用线性惯性递减权重调整,平衡全局搜索和局部搜索的能力;然后通过logistic映射将混沌状态引入到优化变量中,增强搜索空间的遍历性;最后引入遗传算法中的选择、交叉、变异保持了种群的多样性,使其具有不易陷入局部最优的能力.采用六种典型的测试函数,对惯性权重和算法进行了测试和对比分析.结果表明,算法在收敛速度和精度上都有所提高.     

基于改进的SAPSO优化支持向量机的太原市空气质量评价

由于气象环境复杂多变且具有动态的不确定特性,选取太原市2014年至2015年的空气污染物监测数据,将模拟退火算法(SA)与粒子群算法(PSO)相结合并对其进行改进,优化支持向量机(SVM)完成参数寻优,并运用偏最小二乘法(PLS)分析各污染物因子间的相互作用,构造出一种新的空气质量评价模型.实验结果表明,改进的SAPSO-SVM与PSO-SVM和SVM相比,模型运行时间短、等级分类精度高,具有良好的评价性能,为空气质量评价提供了新思路.     

ABC-PSO算法优化混合核SVM参数及应用

针对混合核支持向量机(SVM)中的可调参数一般是根据经验或人工随机调试得到,不能确保参数最优的局限性,提出用粒子群和人工蜂群的并行混合优化(ABC-PSO)算法来优化混合核SVM参数,找出满足条件的最优参数组合.将该SVM模型应用到语音识别中,通过对三个不同语种的语音数据库的实验仿真,验证了混合算法优化SVM参数所得的优化SVM模型比PSO算法优化SVM所得的模型,具有良好的泛化能力和语音识别能力.     

一种改进粒子群优化算法及其在投资规划中的应用

粒子群优化算法(PSO)是模拟生物群体智能的优化算法,具有良好的优化性能.但是群体收缩过快和群体多样性降低导致早熟收敛.本文引入了多样性指标和收敛因子模型来改进PSO算法,形成多样性收敛因子PSO算法(DCPSO),并且对现代资产投资的多目标规划问题进行了优化,简化了多目标规划的问题,并且表现出了比传统PSO算法更好性能.     

混合变异粒子群优化算法及其应用

为改善粒子群优化算法在解决复杂优化问题时收敛质量不高的不足,提出了一种改进的粒子群优化算法,即混合变异粒子群优化算法(HMPSO).HMPSO算法采用了带有随机因子的惯性权重取值更新策略,降低了标准粒子群优化算法中由于粒子飞行速度过大而错过最优解的概率,从而加速了算法的收敛速度.此外,通过混合变异进化环节的引入,缓解了粒子种群在进化过程中的多样性与收敛性这一矛盾,使得算法的全局探索与局部开发得到有效平衡.利用经典的基准测试函数和平面冗余机械臂逆运动学问题的求解来验证提出算法的有效性,试验结果表明:与其他算法相比,HMPSO算法具有更快的收敛速度、更高的收敛精度、更强的收敛稳定性以及更低的计算成本.     

带自身最好位置权重的粒子群算法

本文研究了粒子群算法的收敛速度，提出了一种带自身最好位置权重的粒子群算法。利用更多其他粒子的有用信息．即通过个体极值加权来平衡算法搜索效率和精度之间的矛盾，并改变了粒子的行为方式。获得对于高维单峰函数．改进的基于收缩因子的自身最好位置赋权PSO算法在收敛速度方面优于单纯的带收缩因子的PSO算法。为带收缩因子的PSO算法提供了一种新思路．     

基于GA-SVM的太原市空气质量指数预测

针对大气环境的复杂多变性和不确定性,采用太原市2014年至2016年的空气污染物监测数据,分别将改进的粒子群算法(IPSO)和遗传算法(GA)与支持向量机(SVM)相结合,通过参数寻优构建新模型完成对空气质量指数(AQI)的预测.实验结果表明,GA-SVM在预测精度、误差率和可靠性方面均优于IPSO-SVM与SVM.因此GA-SVM模型更适用于AQI的预测,为大气污染防治提供了科学合理的理论依据和新的预测方法.     

Novel inertia weight strategies for particle swarm optimization

The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. This paper proposes three new nonlinear strategies for selecting inertia weight which plays a significant role in particle’s foraging behaviour. The PSO variants implying these strategies are named as: fine grained inertia weight PSO (FGIWPSO); Double Exponential Self Adaptive IWPSO (DESIWPSO) and Double Exponential Dynamic IWPSO (DEDIWPSO). In FGIWPSO, inertia weight is obtained adaptively, depending on particle’s iteration wise performance and decreases exponentially. DESIWPSO and DEDIWPSO employ Gompertz function, a double exponential function for selecting inertia weight. In DESIWPSO the particles’ iteration wise performance is fed as input to the Gompertz function. On the other hand DEDIWPSO evaluates the inertia weight for whole swarm iteratively using Gompertz function where relative iteration is fed as input. The efficacy and efficiency of proposed approaches is validated on a suite of benchmark functions. The proposed variants are compared with non linear inertia weight and exponential inertia weight strategies. Experimental results assert that the proposed modifications help in improving PSO performance in terms of solution quality as well as convergence rate.     

Improved particle swarm optimization combined with chaos

As a novel optimization technique, chaos has gained much attention and some applications during the past decade. For a given energy or cost function, by following chaotic ergodic orbits, a chaotic dynamic system may eventually reach the global optimum or its good approximation with high probability. To enhance the performance of particle swarm optimization (PSO), which is an evolutionary computation technique through individual improvement plus population cooperation and competition, hybrid particle swarm optimization algorithm is proposed by incorporating chaos. Firstly, adaptive inertia weight factor (AIWF) is introduced in PSO to efficiently balance the exploration and exploitation abilities. Secondly, PSO with AIWF and chaos are hybridized to form a chaotic PSO (CPSO), which reasonably combines the population-based evolutionary searching ability of PSO and chaotic searching behavior. Simulation results and comparisons with the standard PSO and several meta-heuristics show that the CPSO can effectively enhance the searching efficiency and greatly improve the searching quality.     

种群规模自适应粒子群在配送中心连续型选址中的应用

本文依照更具有现实意义的“加工厂—配送中心—用户”的模式建立物流配送中心连续型选址模型,并针对较大规模的选址问题提出求解算法。该算法是将具有较强鲁棒性的自适应粒子算法和改进的ALA(Alert Location-Allocation)方法结合而得,该算法中种群规模自适应变化,对经典粒子移动方程进行改进,消除了学习因子,惯性因子随粒子适应值自适应变化,改进的ALA方法提高了算法计算效率。数值试验表明,本文所建模型具有一定的实践优越性,所提出的算法能有效避免陷入局部最优,寻优能力和鲁棒性均较强。     

Advanced particle swarm assisted genetic algorithm for constrained optimization problems

A novel hybrid evolutionary algorithm is developed based on the particle swarm optimization (PSO) and genetic algorithms (GAs). The PSO phase involves the enhancement of worst solutions by using the global-local best inertia weight and acceleration coefficients to increase the efficiency. In the genetic algorithm phase, a new rank-based multi-parent crossover is used by modifying the crossover and mutation operators which favors both the local and global exploration simultaneously. In addition, the Euclidean distance-based niching is implemented in the replacement phase of the GA to maintain the population diversity. To avoid the local optimum solutions, the stagnation check is performed and the solution is randomized when needed. The constraints are handled using an effective feasible population based approach. The parameters are self-adaptive requiring no tuning based on the type of problems. Numerical simulations are performed first to evaluate the current algorithm for a set of 24 benchmark constrained nonlinear optimization problems. The results demonstrate reasonable correlation and high quality optimum solutions with significantly less function evaluations against other state-of-the-art heuristic-based optimization algorithms. The algorithm is also applied to various nonlinear engineering optimization problems and shown to be excellent in searching for the global optimal solutions.     

基于正弦控制因子的Lateral变异鲨鱼优化算法

针对传统鲨鱼优化算法在求解高维目标函数时,易早熟收敛,陷入局部最优的缺陷.提出一种基于正弦控制因子的Lateral变异鲨鱼优化算法.通过正弦曲线的特性和自适应惯性权重,改善了传统鲨鱼优化算法中由于随机选取控制因子数值大小可能导致算法在迭代后期全局搜索能力降低的问题,提高了算法在迭代后期的全局收敛能力,并对最佳鲨鱼位置引入Lateral变异策略,加强了算法跳出局部最优的可能性.改进后的算法对多个shifted单峰,多峰以及固定维测试函数进行求解,实验结果表明,对比多种不同优化算法而言,本文所提LSSO算法具有更高的收敛精度和搜索速度.     

A rank based particle swarm optimization algorithm with dynamic adaptation

The particle swarm optimization (PSO) technique is a powerful stochastic evolutionary algorithm that can be used to find the global optimum solution in a complex search space. This paper presents a variation on the standard PSO algorithm called the rank based particle swarm optimizer, or PSO_rank, employing cooperative behavior of the particles to significantly improve the performance of the original algorithm. In this method, in order to efficiently control the local search and convergence to global optimum solution, the γ best particles are taken to contribute to the updating of the position of a candidate particle. The contribution of each particle is proportional to its strength. The strength is a function of three parameters: strivness, immediacy and number of contributed particles. All particles are sorted according to their fitness values, and only the γ best particles will be selected. The value of γ decreases linearly as the iteration increases. A time-varying inertia weight decreasing non-linearly is introduced to improve the performance. PSO_rank is tested on a commonly used set of optimization problems and is compared to other variants of the PSO algorithm presented in the literature. As a real application, PSO_rank is used for neural network training. The PSO_rank strategy outperformed all the methods considered in this investigation for most of the functions. Experimental results show the suitability of the proposed algorithm in terms of effectiveness and robustness.     

System identification and control using adaptive particle swarm optimization

This paper presents a methodology for finding optimal system parameters and optimal control parameters using a novel adaptive particle swarm optimization (APSO) algorithm. In the proposed APSO, every particle dynamically adjusts inertia weight according to feedback taken from particles’ best memories. The main advantages of the proposed APSO are to achieve faster convergence speed and better solution accuracy with minimum incremental computational burden. In the beginning we attempt to utilize the proposed algorithm to identify the unknown system parameters the structure of which is assumed to be known previously. Next, according to the identified system, PID gains are optimally found by also using the proposed algorithm. Two simulated examples are finally given to demonstrate the effectiveness of the proposed algorithm. The comparison to PSO with linearly decreasing inertia weight (LDW-PSO) and genetic algorithm (GA) exhibits the APSO-based system’s superiority.