用户名: 密码: 验证码:
粒子群优化算法的改进及应用研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
粒子群优化算法PSO(Particle Swarm Optimization)由Kennedy和Eberhart于1995年提出,算法模拟鸟群飞行觅食的行为,通过鸟之间的集体协作使群体达到最优。PSO算法依靠个体间的信息交换来达到整个群体的共同演化,这些称为“群”(swarm)的无体积无质量的小粒子,能够调整自身的运动轨迹,同时能够朝着自己以前经历过的最佳位置和整个群体粒子曾经经历过的最佳位置飞行。为了达到这个目的,群体中所有的粒子都具有记忆的能力,能对自身位置和记忆中经历过的最佳位置进行调整,如在一个最小化问题中,所谓的一个较佳的位置就是解空间中对应于目标函数其值较小的一个点。PSO的优势在于简单容易实现,同时又有深刻的智能背景,既适合科学研究,又特别适合工程应用。短短几年时间, PSO算法便获得了很大的发展,并在一些领域得到应用。
     但是,粒子群优化算法也具有自身的不足,该算法在优化过程中容易出现早熟或停滞的问题,这主要是由于在粒子群优化的后期由于各个粒子的速度更新能力不足,使得粒子在一定位置紧密聚集而无法进行更大程度、更细致的局部搜索,从种群多样性而言,此时种群的多样性匮乏,各个粒子之间的差别很小,无法促使粒子群发展变化。粒子群的早熟问题在单模态函数的优化中还比较不容易发生,而一旦对多模态函数进行优化,由于这类函数大多都是非线性的,并且具有广泛的搜索空间、大量的局部极值点和高大的障碍物,所以粒子群优化算法在处理此类问题的时候就很容易陷入到局部极值中而造成算法的停滞。
     本文从工程应用实际的角度出发,以简单性原则为指导思想,撇开复杂和繁琐的理论推理和计算,借助一些经典的优化算法来对粒子群优化算法PSO的设计进行探讨和研究,力图为粒子群优化算法PSO的工程应用提供一些可借鉴的设计方法。本文在前人研究的基础上作了进一步的提高和发展,其创新之处主要有以下几点:
     (1)在粒子群优化算法中,加速度系数c_1 ,c_2是非常重要的参数,对算法的寻优性能有着很大的影响,论文对加速度系数c_1 ,c_2分别从二者线性配对关系、非线性配对关系以及惯性系数w配合这三个方向进行大量实验分析,对算法中c_1 ,c_2不同配对对算法寻优能力的影响做了初步的研究;
     (2)采用云模型理论实现对惯性权重w的多规则不确定动态调整,对测试函数的测试结果表明,该方法收敛速度快,优化效果好。另外,考虑到在粒子群优化算法中加速度2 c也是一个重要的参数,提出对惯性权重w以及加速度2 c的双变量多规则不确定动态调整,这种方法经过测试其效果要优于仅调整惯性权重w的改进算法;
     (3)提出了一种两群替代粒子群优化算法,该算法简单易行,使用的两个分群一个使用全局型PSO算法进行搜索寻优,另外一个采用局部型PSO算法,通过它们之间粒子的互相替换既可以实现对群体多样性的保持,同时还保持了收敛速度快的特点。实验表明该改进算法的寻优效率大大提高。将该算法应用于工业控制中基本使用的不完全微分PID的参数寻优,对几个对象的控制效果良好,同时在出现控制对象变化或外来扰动引入时具有一定的自适应控制能力。
     (4)将差异演化(DE)算法和标准PSO算法混合进行进化,把DE算法的优势带入到粒子群算法中,利用DE算法其本身具备的对粒子个体的交叉和变异操作使PSO算法种群保持寻优所需的多样性。文中将这种算法成功应用到神经网络的优化中,并在火灾的早期探测报警系统中取得了很好的效果;
     (5)提出通过差异演化算法对粒子群优化算法中的各个个体历史最佳位置id p进行变异,使之不会在较长时间内没有发生变化或者变化非常小,同时也变异了粒子群最佳位置gd p,从而保证粒子速度能获得较大程度的更新保持较好的搜索能力,避免陷入“早熟”的能力大大提高,获得全局最优点的概率也更高;
Kennedy and Eberhart established the Particle Swarm Optimization algorithm(PSO) in 1995. This algorithm simulates the action of the bird swarm looking for food by flying and get the optimization through the cooperation in the bird swarm. PSO obtain the evolution of all the swarm depending on changing the information between the singles. These little particles which are called swarm are non-volume and non-quality. They can adjust the moving track of themselves and fly towards the best location which itself ever went previously and which the whole swarm ever went previously. In order to attain the aim, all the particles of the swarm have the ability of memory and they can adjust their locations between the current locations and the best locations they ever found, for example, in a minimum problem the so-called better location is a point corresponding to the lesser value of the aim-function in the explain space. What is the superiority of PSO is that the algorithm can be realized easily and has the profound intelligence background. This algorithm is not only fit for scientific research but also fit for the engineering application. In very short time the PSO made the great progress and has been used in some fields.
     But the PSO also has its shortage. This algorithm is easy in premature convergence or become stagnant during the optimizing process. This is because every particle’s speed can not be refreshed in the anaphase of the optimization, which cause the particles to collect together very tightly in some locations and can not make the local search more wide and more meticulous. To the variety of the swarm, in this time the swarm is went short of variety and the difference between each particles is very little, which can not urge the swarm to develop. The problem of premature convergence is not easy found in optimizing the single mode functions but once optimize the mul-mode functions, which are nonlinear and have extensive searching space, plentiful local extremum and large bar, the algorithm will be easy in the premature convergence or become stagnant.
     The angle that this text is from the engineering applied physically set outs, with the simple principle is guide thought, cast aside to sophisticate to reason logically with tedious theories with compute, and apply the optimize of some classics the calculate way to discuss and study the design of the PSO in order to offering some can design method that draw lessons from. To carry out this task, this paper is presented the new ideas as follows:
     ☆The acceleration c_1 ,c_2 are the very important coefficient to the PSO. They can improve the optimization quality of the PSO greatly. In the paper we do much experiment and analyse to elementarily study how the partnership about c_1 ,c_2 can affect the optimization quality of the PSO from three direction including the linear partnership relation of the c_1 ,c_2、the non-linear partnership relation of the c_1 ,c_2 and the partnership relation with the inertia weightω.
     ☆Applying the cloud model to realize the adjusting to the inertia weight by mul-rule and uncertainty. This method has more quick convergence speed and more better optimization result using some test-functions. On the other hand, the acceleration c 2is also a very important parameter of the PSO, so also to refer a method which adjust both the inertia weight and the acceleration c 2 using the mul-rule and uncertainty. This method is proved more better than the method only adjusting the inertia weight.
     ☆two sub—swarms substituting particle swarm optimization algorithm is proposed. This method is simple to use. It use two sub-swarms.One sub-swarm use the Globe PSO to search and find optimization, and the other use the Local PSO. Through the particles being replaced between the two swarm the variety of the swarm can be confirmed and also confirm the quick convergence speed. Through the examination this method can improve the efficiency of the optimization. Then use this improved PSO to optimize the parameters of the incomplete differential PID which is used in the industrial controlling universally. Through the simulation of the controlling to several objects, the results are excellent, at the same time also showing the excellent ability of the self-adaptive control when the object is changed or some disturbs are imported inside the system suddenly.
     ☆a cooperative PSO which use the differential evolution algorithm(DE) and the standard PSO. The new algorithm bring the superiority of the DE to the PSO and confirm the variety of the swarm by applying the intersection and the variance to the particle. Use this improved PSO algorithm to optimize the NN and then use the NN to the system which detect and alarm to the fire in forepart. The system work very well.
     ☆Referring to use the DE to variety the historical best location of each particle in order to confirm that these location would not change nothing or change very little in a long time, in the other hand, also variety the best location of all the swarm, so the particle’s speed can be changed usually so that the search ability can be preserved and the ability of the avoiding the premature convergence will be improved, and has the more probability to attain the best value.
引文
[1]运筹学教材编写组.运筹学[M],北京:清华大学出版社,2000.1-2
    [2]薛嘉庆.最优化原理与方法[M],北京:冶金工业出版社,2001.1-2
    [3]高尚,杨静宇.群智能算法及其应用[M],北京:中国水利水电出版社,2006.1-2
    [4] Hackwood S,Beni G.Self-organization of Sensors for SwarmIntelligence[C].In:IEEE International conference on Robotics andAutomation.Piscataway,NJ:IEEE Press,1992:819—829
    [5]E Bonabeau, M Dorigo, G Theraulaz.Swarm Intelligence:From Naturalto Artificial Systems[M].New York:Oxford University Press,1999
    [6]冯静,苏宁.群智能理论及应用研究[J],计算机工程与应用,2006(17):31-34
    [7]李晓磊,邵之江,钱积新.一种基于动物自治体的寻优模式:鱼群算法[J],系统工程理论与实践,2002,22(11):32-38
    [8]彭喜元,彭宇,戴毓丰.群智能理论及应用[J],电子学报,2003,31(12A):1982-1988
    [9] Colorni A,Dorigo M,Maniezzo V.Distributed Optimization by AntColonies[C].In:The First European conference on Artificial Life.France:Elsevier.1991:134—142
    [10] Reynolds C W F1ocks.Herds and Schools:A Distributed BehavioralModel[J].Computer Graphics,1987,21(4):25-34
    [11] Kennedy J, Eberhart R C.Particle Swarm Optimization[C].In:IEEEInternational Conference on Neural Networks.IV Piscataway,NJ:IEEEService Center,1995:1942-1948
    [12] Eberhart R C,Shi Y.Particle Swarm Optimization:Developments,Applications and Resources[A].Proc.Congress on EvolutionaryComputation 2001[C].Piscataway,NJ:IEEE Press,2001.81—86.
    [13]谢晓锋,张文俊,杨之廉.微粒群算法综述[J],控制与决策,2003,18(2):129-134
    [14]吴启迪,汪镭。智能微粒群算法研究及应用[M].南京:江苏教育出版社,2005. 15-16.
    [15] Shi Yuhui, Eberhart R C. A modified particle swarm optimizer [A].Proc IEEE Int Conf on Evolutionary Computation [C]. Anchorage, 1998:69-73.
    [16] Thorndike E L. Animal Intelligence: Empirical Studies[M]. New York:MacMillan, 1911.
    [17] Bandura A. Social Foundations of Thought and Action:A SocialCognitive Theory [M]. New Jersey: Prentice Hall, 1986.
    [18] Wetter M,Wright J. A comparison of deterministic and probabilisticoptimization algorithms for nonsmooth simulation-based optimization.Building and Environment,2004,39(8):989-999
    [19] Trelea I C. The particle swarm optimization algorithm: convergenceanalysis and parameter selection. Information Proceeing Letters,2003,85(6):317-325
    [20] Eberhart R C, Shi Y. Comparing inertia weights and constrictionfactors in particle swarm optimization. Proceedings of the IEEEConference on Evolutionary Computation, California: IEEE, 2000, 84-88
    [21]康琦,张燕,汪镭,吴启迪.智能微粒群算法[J],冶金自动化,2005,(4):5-9
    [22]刘波,王凌,金以慧,黄德先.微粒群优化算法研究进展[J],化工自动化仪表,2005,32(3):1-6
    [23] Kennedy J , Eberhart R C. Discrete binary version of the particleswarm algorithm[A] . Proceedings of the IEEE International Conference onSystems , Man and Cybernetics[C] . Orlando IEEE , 1997. 4104-4108.
    [24] Shi Y, Eberhart R C. A Modified Particle Swarm Optimizer[A].Proceedings of the IEEE International Conference on EvolutionaryComputation[C]. 1998. 69-73.
    [25]俞欢军,张丽平,陈德钊,胡上序.基于反馈策略的自适应粒子群优化算法[J],浙江大学学报{工学版},2005,39(9):1286-1290
    [26]张选平,杜玉平,秦国强,覃征.一种动态改变惯性权的自适应粒子群算法[J],西安交通大学学报,2005,39(10):1039-1042
    [27]王启付,王战江,王书亭.一种动态改变惯性权重的粒子群优化算法[J],中国机械工程,2005,16(11):945-948
    [28] Shi Y, Eberhart R C. Fuzzy adaptive particle swarmoptimization [A] .Proceedings of the IEEE Conference on Evolutionary Computation[C] . Soul :IEEE , 2001. 101-106.
    [29]陈贵敏,贾建援,韩琪.粒子群优化算法的惯性权值递减策略研究[J],西安交通大学学报,2006,40(1):53-61
    [30]张丽平,俞欢军,陈德钊,等.粒子群优化算法的分析与改进[J],信息与控制,2004 ,33(5) :513-517.ZHANG Li-ping , YU Huan-jun , CHEN De-zhao , et al.Analysis and improvement of particle swarm optimization algorithm[J] .Information and Control , 2004 , 33 (5) : 513-517.
    [31] KE Jing , QIAN Ji-xin , QIAO Yi2zheng. A modified particleswarm optimization algorithm[J ] . Journal of Circuits of Systems , 2003 ,8(5) :87-91.
    [32] Fan H Y. A modification to particle swarm optimization algorithm[J] .Engineering Computations , 2002 , 19 (8) : 970-989.
    [33]付国江,王少梅,刘舒燕,李宁.改进的速度变异粒子群算法[J],计算机工程于应用,2006,(13):48-50
    [34]姜海明,谢康,任诚,王亚非.具有随机停滞行为的粒子群优化算法[J],四川大学学报(工程科学版),2006,38(4):117-121
    [35]刘宇,覃征,史哲文.简约粒子群优化算法[J],西安交通大学学报,2006,40(8):883-887
    [36] Kennedy J, Mendes R. Population Structure and Particle SwarmPerformance[A]. Proceedings of the IEEE Congress on EvolutionaryComputation[C]. 2002. 1671-1676.
    [37] Mendes R,Kennedy J.The Full Informed Particle Swarm:Simpler,Maybe Better[J].IEEE TRANS-ACTION ON EVOLUTIONARY COMPUTATION,2004,8(3):204-210.
    [38] Suganthan P N. Particle Swarm Optimizer with NeighborhoodOperator[A]. Proceedings of the Congress on Evolutionary Computation[C].1999. 1958-1961.
    [39] Kennedy J. Stereotyping: Improving Particle Swarm Performance withCluster Analysis[A]. Proceedings of the IEEE Conference on EvolutionaryComputation[C] ,California, CA: IEEE, 2000,1507-1512
    [40] Al-Kazemi B,Mohan C K. Multi-phase generalization of the particleswarm optimization algorithm[A].Proceeding of the Congress onEvolutionary Computation, Honolulu, HI: IEEE, 2002,489-494
    [41] Van den Berth F, Engelbrecht A P. 2001. Effects of Swarm Size onCooperative Particle Swarm Optimizers. In: Proc. of the CECCO, SanFrancisco, USA, 2001
    [42]李爱国.多粒子群协同优化算法[J],复旦大学学报(自然科学版),2004,43(5):923-925
    [43] Xie X F, Zhang W J, Yang Z L. Adaptive Particle Swarm Optimizationon Individual Level[J], 2002 6th International Conference on SignalProcessing, Beijing: IEEE Piscatway, 2002, 1215-1218
    [44]王俊伟,汪定伟.一种带有梯度加速的粒子群算法[J],控制与决策,2004,19(11):1298-1300
    [45]滕居特,陈国初,顾幸生.分段式微粒群优化算法[J],华东理工大学学报(自然科学版),2006,32(4):462-465
    [46]许丽艳,沈继红,毕晓君.基于空间收缩的新颖粒子群优化算法[J],哈尔滨工程大学学报,2006,27,supp1.:542-546
    [47]刘康,余玲.一种改进的微粒群算法——多步长微粒群算法[J],机械设计,2004,21(7):24-26
    [48]薛明志,左秀会,钟伟才,刘静.正交微粒群算法[J],系统仿真学报,2005,17(12):2908-2911
    [49] Christopher K Monson,Kevin D Seppi.The Kalman Swarm,A New Approachto Particle Motion in Swarm Optimization.http://www.Researchindex.com
    [50] Christopher K Monson,Kevin D Seppi.Improving on the Kalman SwarmExtracting Its Essential Characteristics.http://www.Researchindex.com
    [51]黄天戍,吴少勇.基于Kalman滤波器原理的PSO算法[J],计算机工程与应用,2005,(35):56-58
    [52]高鹰,谢胜利.混沌粒子群优化算法[J],计算机科学,2004 ,31(8) :13-15.
    [53] XIE Xiao-feng , ZHANGWen-jun , YANG Zhi-lian. Dissipative particleswarm optimization [A] . Proceedings of the Congress on EvolutionaryComputation [C] . Honolulu :IEEE , 2002. 1456-1461.
    [54] Angeline PJ . Using selection to improve particle swarmoptimization[A] . Proceedings of the IEEE Conference on Evolutionary Computation [C] .Anchorage : IEEE Piscataway ,1998. 84-89.
    [55]吕振肃,侯志荣.自适应变异的粒子群优化算法[J],电子学报,2004,32(3):416-420
    [56]高尚,韩斌,吴小俊,等.求解旅行商问题的混合粒子群优化算法[J],控制与决策, 2004 , 19 (11) :1286-1289.
    [57]高鹰,谢胜利.免疫粒子群优化算法[J],计算机工程与应用,2004,40(6):4-6
    [58]高鹰,谢胜利.基于模拟退火的粒子群优化算法[J],计算机工程与应用,2004,40(1):47-50
    [59] Morten L, Thomas K R,Thiemo K. Hybird Particle Swarm Optimizer withBreeding and Subpopulations[A]. Proceeding of the Genetic andEvolutionary Computation Conference, 2001
    [60] Xie X F, Zhang W J, Yang Z L. Hybrid Particles Swarm Optimizer withMass Extinction[A], IEEE International Conference on Communication,Circuits and Systems and West Sino Expositions, Chengdu: IEEE,2002,1170-1173
    [61]安伟刚,李为吉.改进的粒子群优化算法及其工程应用[J],机械科学与技术,2005,24(4):415-417
    [62]安伟刚,李为吉.单纯形-多目标粒子群优化方法的混合算法[J],西北工业大学学报,2004,22(5):563-566
    [63]陈国初,俞金寿.单纯形微粒群优化算及其应用[J],系统仿真学报,2006,18(4):862-865
    [64]王芳,邱玉辉.一种引入单纯形法算子的新颖粒子群算法[J],信息与控制,2005,34(5):517-522
    [65]董颖,唐加福,许宝栋等.一种求解非线性规划问题的混合粒子群优化算法[J],东北大学学报(自然科学版),2003,24(12):1141-1144
    [66]王华秋,曹长修.并行混沌粒子群优化研究及应用[J],计算机仿真,2005,22(11):98-101
    [67]杨俊杰,周建中,喻菁,吴玮.基于混沌搜索的粒子群优化算法[J],计算机工程与应用,2005,(16):69-71
    [68]窦全胜,周春光,马铭.粒子群优化的两种改进策略[J],计算机研究与发展,2005,42(5):897-904
    [69]窦全胜,周春光,马铭,刘全.群核进化粒子群优化方法[J],计算机科学,2005,32(8):134-137
    [70]赫然,王永吉,王青,周津慧,胡陈勇.一种改进的自适应逃逸微粒群算法及实验分析[J],软件学报,2005,16(12):2036-2044
    [71]陈红洲,顾国昌,康望星.一种具有感觉的微粒群算法[J],计算机研究与发展,2005,42(8):1299-1305
    [72]王芳,邱玉辉.一种引入轮盘赌选择算子的混合粒子群算法[J],西南师范大学学报(自然科学版),2006,31(3):93-96
    [73]李宁,付国江,库少平,陈明俊.粒子群优化算法的发展与展望[J],武汉理工大学学报·信息与管理工程版,2005,27(2): 26-29
    [74] Engelbrecht A P, Ismail A. Training Product Unit Neural Networks [J].Stability and Control: Theory and Applications,1999, 2 (1-2) : 59-74.
    [75] Juang C F. A Hybrid of Genetic Algorithm and Particle SwarmOptimization for Recurrent Network Design[J]. IEEE Transactions onSystems Man and Cybernetics ( Part B-Cybernetics) ,2004,34 (2) : 997-1006.
    [76] Messerschmidt L, Engelbrecht A P. Learning to Play Fames Using aPSO-based Competitive Learning App roach [J]. IEEE Transactions onEvolutionary Computation, 2004, 8 (3) : 280-288.
    [77] Eberhart R, Hu Xiaohui. Human tremor analysis using particle swarmoptimization [A]. P roc of the Congress on Evolutionary Computation [C].Washington, 1999. 1927-1930.
    [78] Costa Jr E F, Lage P L C, Biscaia Jr E C. On the Numerical Solutionand Optimization of Styrene Polymerization in Tubular Reactors[J]. CompChem Eng, 2003, 27 (11): 1591-1604.
    [79] Ourique C U O,Biscaia E C Jr, Pinto J C. The Use of ParticleSwarm Optimization for Dynamical Analysis in Chemical Processes[J]. CompChem Eng,2002,26(12):1783-1793.
    [80] CockshottA R, Hartman B E. Improving the Fermentation Medium forEchinocandin B Production PartⅡ: Particle Swarm Optimization[J].Process Biochemistry, 2001, 36 (7) : 661-669.
    [81] Zhang F, Xue D. Optimal Concurrent Design Based upon DistributedProduct Development Life-cycle Modeling[J]. Robotics andComputer-integrated Manufacturing, 2001, 17 ( 6 ) :469-486.
    [82] Kannan S, Slochanal SM R, Subbaraj P, et al. Application ofParticle Swarm Optimization Technique and its Variants to GenerationExpansion Planning Problem [J]. Electric Power Systems Research, 2004,70 (3) : 203-210.
    [83] AbidoM A. Optimal Design of Power System Stabilizers UsingParticle Swarm Optimization[J]. IEEE Transactions on EnergyConversion, 2002, 17 (3) : 406-413.
    [84] Yoshida H, Kawata K, Fukuyama Y, et al. A Particle SwarmOptimization for Reactive Power and Voltage Control Considering VoltageSecurity Assessment [J]. IEEE Transactions on Power Systems, 2000, 15 (4) :1232-1239.
    [85] Gaing Z L. Particle Swarm Optimization to Solving the EconomicDispatch Considering the Generator Constraints [J].IEEE Transactions onPower Systems, 2003, 18 ( 3 ) : 1187-1195.
    [86] Ting T O, Rao M V C, Loo C K, et al. Solving Unit Commitment ProblemUsing Hybrid Particle Swarm Optimization[J].Journal of Heuristics, 2003,9 (6) : 507-520.
    [87] Kovács G, Groenwold A A, Jármai K, et al. Analysis and Optimum Designof Fibre-reinforced Composite Structures [J].Structural and Multidisciplinary Optimization, 2004, 28 ( 2 -3) : 170-179.
    [88] Jeon J Y,Okuma M. Acoustic Radiation Optimization Using theParticle Swarm Optimization Algorithm[J]. International Journalof Series C-Mechanical Systems Machine Elements andMan-ufacturing, 2004,47 (2) : 560-567.
    [89] Park J, Choi K,Allstot D J. Parasitic-aware RF Circuit Designand Optimization[J]. IEEE Transactions on Circuits and Systems I:Fundamental Theory and Applications, 2004, 51 ( 10) :1953-1966.
    [90] Zhang X G, Yu L, Zheng Y, et al. Two-stage Adaptive PMDCompensation in a 10 Gbit/ s Optical Communication System Using ParticleSwarm Optimization Algorithm [J]. Optics Communications, 2004, 231:233-242.
    [91] Venayagamoorthy G K,Doctor S. Navigation of Mobile SensorsUsing PSO and Embedded PSO in a Fuzzy Logic Controller[A]. IEEE 39th Industry Applications Conference[C]. 2004.1200-1206.
    [92] Wu H, Sun F C, Sun ZQ, et al. Optimal Trajectory Planning ofa Flexible Dual-arm Space Robot with Vibration Reduction[J]. Journal of Intelligent & Robotic Systems, 2004, 40 (2) :147-163.
    [93] Pavlidis N G, Parsopoulos K E,VrahatisM N. Computing NashEquilibria Through Computational Intelligence Methods [J].Journal of Computational and Applied Mathematics, 2005, 175(1) : 113-136.
    [94] Nenortaite J, Simutis R. Stocks’trading System Based on theParticle Swarm Optimization Algorithm [A]. International Conference onComputational Science [C]. Springer, 2004.843-850.
    [95] Yin P Y. A Discrete Particle Swarm Algorithm for Optimal PolygonalApproximation of Digital Curves[J]. Journal of Visual Communication andImage Representation, 2004, 15: 241-260.
    [96] Parsopoulos K E, Papageorgiou E I, Groumpos P P, et al. EvolutionaryComputation Techniques for Optimizing Fuzzy Cognitive Maps in RadiationTherapy Systems [A]. Proceedings of the Genetic and EvolutionaryComputation Conference [C].Springer, 2004. 402-413.
    [97] Caorsi S, DonelliM, Lommi A, et al. Location and Imaging ofTwo-dimensional Scatterers by Using a Particle Swarm Algorithm[J].Journal of Electromagnetic Waves and Applications,2004, 18 (4) : 481-494.
    [98] WachowiakM P, Smolikova R, Zheng Y F, et al. An ApproachTo Multimodal Biomedical Image Registration Utilizing ParticleSwarm Optimization [J]. IEEE Transactions on Evolutionary Computation,2004, 8 (3) : 289-301.
    [99] Rasmussen T K, Krink T. Improved Hidden Markov Model Training forMultiple Sequence Alignment by a Particle Swarm Optimization evolutionaryAlgorithm Hybrid [J]. Biosystems, 2003,72: 5-17.
    [100] Xiao X,Dow E R, Eberhart R, et al. A Hybrid Self-organizingMaps and Particle Swarm Optimization Spproach [J]. Concurrency andComputation: Practice & Experience, 2004, 16 (9) :895-915.
    [101] Shen Q, J iang J H, J iao C X, et al. Modified Particle SwarmOptimization Algorithm for Variable Selection in MLR and PLS modeling:QSAR Studies of Antagonism of Angiotensin II Antagonists [J]. EuropeanJournal of Pharmaceutical Sciences, 2004, 22: 145-152.
    [102] Tasgetiren M F, SevkliM, Liang Y C, et al. Particle SwarmOptimization Algorithm for Permutation Flowshop SequencingProblem [A]. Ant Colony Optimization and Swarm Intelligence[ C]. Springer,2004. 382-389.
    [103] Xie Xiaofeng, ZhangWenjun, Yang Zhilian. Incorporating knowledgein genetic algorithms for device synthesis[A]. 6th Int Conf on Solidstateand Integrated Circuit Technology [C]. Shanghai, 2001. 1143-1146.
    [104]熊伟丽,徐保国,周其明.基于改进粒子群算法的PID参数优化方法研究[J],计算机工程,2005,31(24):41-43
    [105]方红庆,沈祖诒.基于改进粒子群算法的水轮发电机组PID调速器参数优化[J],中国电机工程学报,2005,25(22):120-124
    [106]魏星,张青松,黄辉.基于改进粒子群算法的水轮机调速器参数寻优[J],电力科学与工程,2005,(3):48-51
    [107]李剑波,王东风,付萍,韩璞.基于改进粒子群算法的主汽温系统PID参数优化[J],华北电力大学学报,2005,32(4):26-30
    [108]湛锋,魏星,郭建全,胡志坚,陈允平.基于改进粒子群优化算法的PID参数整定[J],继电器,2005,33(19):23-27
    [109]王介生,王金诚,王伟.基于粒子群算法的PID控制器参数子整定[J],控制与决策,2005,20(1):73-76
    [110]陈俊凤,范新南,苏丽媛.基于粒子群优化算法的PID控制器参数整定[J],计算机仿真,2006,23(8):158-160
    [111]汪新星,张明.利用改进微粒群算法优化PID参数[J],自动化仪表,25(2):19-22
    [112]任玉军,邹俊,傅新.液压位置伺服系统PID参数在线优化[J],机床与液压,2005,(10):87-88
    [113]刘清.用微粒群算法实现水轮机调节器参数的优化设计[J],南京师范大学学报(工程技术版),2005,5(3):41-44
    [114]夏桂梅,曾建潮.微粒群算法的研究现状及发展趋势[J],山西师范大学学报(自然科学版),2005,19(1):23-25
    [115]李博.粒子群优化算及其在神经网络中的应用[D],大连理工大学,2005,13-18
    [116] Maurice C,Kennedy J.The Particle Swarm—Explosion,Stability,an d Convergence in a Multidimensional Complex Space[J].IEEE TRANSACTIONON EVOLUTIONARY COMPUTATION,2002,6(1):58-73.
    [117] Van den Bergh F.An Analysis of Particle SwarmOptimizers[D].Department of Computer Science,University of Pretoria,South Africa,2002.
    [118] Trelea I C. The particle swarm optimization algorithm: convergenceanalysis and parameter selection. Information Processing Letters,2003:317-325
    [119] Shi Y, Eberhart R C. Empirical study of particle swarmoptimization[A] . Proceedings of the 1999 Congress on EvolutionaryComputation [ C ] . Washington DC: IEEE Piscataway ,1999. 1945-1950.
    [120] Clerc M, Kennedy J. The particle swarm: explosion , stability , andconvergence in a multi-dimensional complex space[J] . IEEE Transactionson Evolutionary Computation , 2002 ,6(1) :58-73.
    [121]王进,李薇,郑宝玉.粒子种群优化(PSO)算法的性能研究[J],南京邮电学院学报,2005,25(4):30-34
    [122]王俊伟,汪定伟.粒子群算法中惯性权重的实验与分析[J],系统工程学报,2005,20(2):194-198
    [123]彭宇,彭喜元,刘兆庆.微粒群算法参数效能的统计分析[J],电子学报,2004,32(2):209-213
    [124]陈国初,俞金寿.微粒群优化算法[J],信息与控制,2005,34(3):318-323
    [125]李德毅,刘常昱,杜鹊,等.不确定性人工智能[J].软件学报,2004,15(9):1-13
    [126]李众,杨一栋.一种新的基于二维云模型不确定性推理的智能控制器[J].控制与决策, 2005,20(8):866-872
    [127] Zadeh L A. Fuzzy Sets. Informat Control.1965, 8:338-353
    [128] Zadeh L A. Fuzzy Algorixhm. Informat Control. 1968, 12:94-102
    [129] Zadeh L.A. Similarity reltions and fuzzy ordening. Informat Sciene,1971, 3: 177-206
    [130] Zadeh L.A. Outline of a New Approach to Analysis Complex Systemsand Decision Processes. IEEE Trans. Syst. Man. and Cyberm. 1973,3(1):28-44
    [131]方千山.模糊控制器工程优化设计及应用研究[D],华侨大学,2003,1-4
    [132]李德毅,史雪梅.语言原子模型和似然模型[A],计算机智能接口与智能应用论文集[C],1993,272-277
    [133]李德毅,孟海军,史雪梅.隶属云和隶属云发生器[J],计算机研究与发展,1995,32(6):15-20
    [134]李德毅,淦文燕,刘璐莹.人工智能与认知物理学[A].中国人工智能进展第10届全国学术年会论文集[C].北京:北京邮电大学出版社,2003:6-15.
    [135] Wang S L,Li D R,Shi W Z,et a1.Cloud Model Based Spatial DataMining[J].Geographical Information Science,2003,9(2):67-78
    [136]Li D Y,Han J,Chan E,et a1.Knowledge Representation andDiscovery Based on Linguistic Atoms[A].Proc of the 1st Pacific·AsiaConf on KDD&DM [C].Singapore,1997:89-97.
    [137] Li D Y,Di K C,Li D E,et a1.Mining Association Rules with LinguisticCloud Models[A].PAKDD’98 Proc of the Second Pacific·Asia Conf onKnowledge Discovery and Data Mining[C].Melbourne,1998:392-394.
    [138]邸凯昌,李德毅,李德仁.云理论及其在空间数据发掘和知识发现中的应用[J].中国图象图形学报,1999,11(4):930-935.
    [139]刘常昱,戴晓军,李德毅.基于云x信息的逆向云新算法.系纺仿真学报,2004,16(11):2417-2420.
    [140]张飞舟,范跃祖,孙先仿.基于云模型的导航系统模糊可靠性评测分析[J].自动化学报,2002,28(1):126-130.
    [141]杨朝晖,李德毅.二维云模型及其在预测中的应用[J].计算机学报,1998,21(11):961-969.
    [142] Li D Y,Cheng D W,Shi X M,et a1.Uncertainty Reasoning Basedon Cloud Models in Controllers[J].J of Computer Science and Mathematicswith Applications,1998,35(3):99-123.
    [143]张飞舟,范跃祖,李德毅.基于隶属云发生器的智能控制[J].航空学报,1999,20(1):89-92.
    [144]段海滨,王道波,于秀芬,朱家强.基于云模型理论的蚁群算法改进研究[J].哈尔滨工业大学学报,2005,37(1):115-119
    [145]高键,姜长生,李众.一种新的云模型控制器设计[J],信息与控制,2005,34(2):157-162
    [146]李众,高键.电液伺服变距系统的二维云模型控制研究[J],系统仿真学报,2004,16(5):1050-1052
    [147] Ratnaweera A,Halgamuge SK.Watson HC.Self-Organizing hierarchicalparticle swarm optimizer with time-varying accelerationcoefficients.IEEE Trans,.on Evolutionary Computation,2004,8(3):240-255.
    [148]赫然,王永吉,王青,周津慧,胡陈勇.一种改进的自适应逃逸微粒群算法及实验分析[J],软件学报,2005,16(12):2036-2044
    [149]张更新,赵辉,王红君,苏君临.基于动态参数的微粒群算法(PSO)的研究[J].天津理工大学学报,2005,21(4):42-44.
    [150]陈国初,俞金寿,郭伟.两群替代微粒群优化算法及其应用[J],华东理工大学学报(自然科学版),2005,31(6):787-791
    [151]刘卓倩,顾幸生,陈国初.三群协同粒子群优化算法[J],华东理工大学学报(自然科学版),2006,32(7):754-757
    [152]夏桂梅,曾建潮.双群体随机微粒群算法[J],计算机工程与应用,2006,(24):46-48
    [153]王攀,万君康,冯珊,魏崴,张坚坚.一类基于分治原理的多种群协同进化算法[J],系统工程与电子技术,2004,26(11):1687-1690
    [154]艾景波.文化粒子群优化算法及其在布局设计中的应用研究[D],大连理工大学,2005,
    [155] N.Higashi,H.1bsa.Particle Swarm Optimi zation with Gaussianmutation[C].Proceedings of IEEE Swarm Intelligence Symposium,2003:72—79.
    [156] M.Lovbjerg.Tkrink.Extending Particle swarm optimization withself-organized critically[C].Proceeding IEEE Conference onEvolutionary Computation,2002:1588—1593
    [157]杨光友,陈定方,周国柱.粒子个体最优位置变异的粒子群优化算法[J],哈尔滨工程大学学报,2006,27,supp1.:531-536
    [158]毛恒、王永初.基于多样性指标的两群替代微粒群算法[J].计算机工程,已被录用
    [159]刘艳.关于黄金分割法的几点讨论[J].机电技术,2006,(1):13-14
    [160]宋巨龙,钱富才.基于黄金分割的全局最优化方法[J].计算机工程与应用,2005,(4):94-95
    [161]史文谱,刘迎曦,巩华荣,李翠华.黄金分割法在无约束多元优化问题中的应用[J],东北师大学报自然科学版,2003,35(2):11-14
    [162]关淮海.黄金分割优选法的应用[J],安徽农业技术师范学院学报,2000,14(2):80
    [163]方千山,黄传明,王忠勇.基于双种群黄金分割优化的遗传算法及其应用[J],电子测量与仪器学报,2005,19(6):103-105
    [164]周祥,何小荣,陈丙珍.基于最优变异因子的遗传算法在EFF训练中的应用[J],清华大学学报(自然科学版),2002,42(5):619-621
    [165] Abbattista F, Abbattista N, Caponetti L. An evolutionary andcooperative agents model for optimization[A], Proceedings of the IEEEInternational Conference on Evolutionary Computation[C],1995,2:668-671
    [166] White T, Pagurek B, Oppacher F, ASGA: improving the ant system byintegration with genetic algorithms[A]. Proceedings of the 3rd AnnualGenetic Programming Conference[C],1998,610-617
    [167] Li M, Wang H, Li P. Tasks mapping in multi-core based system: hybridACO & GA approach[A].Proceedings of the 5th International Conference onASIC[C],2003,1:335-340
    [168] Pilat M L, White T. Using genetic algorithms to optimize ACS-TSP[A].Proceedings of the 3rd International Workshop on AntAlgorithms/ANTS2002[C],2002,2463:282-287
    [169] Acan A. GAACO:A GA+ACO hybrid for faster and better searchcapability[A].Proceedings of the 3rd International Workshop on AntAlgorithms/ANTS2002[C],2004,3:2068-2072
    [170] Gong D X, Ruan X G. A hybrid approach of GA and ACO for TSP[A].Proceedings of the 5th World Congress on Intelligent Control andAutomation[C], 2004,3:2068-2072
    [171]孙力娟,王良俊,王汝传.改进的蚁群算法及其在TSP中的应用研究[J].通信学报,2004,25(10):111-116
    [172]丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合[J].计算机研究与发展,2003,40(9):1351-1356
    [173]邵晓巍,邵长胜,赵长安.利用信息量留存的蚁群遗传算法[J].控制与决策,2004,19(10):1187-1189
    [174]陈宏建,陈峻,徐晓华等.改进的增强型蚁群算法[J].计算机工程,2005,31(2):176-178
    [175] Kumar G M, Haq A N. Hybrid genetic-ant colony algorithms for solvingaggregate production plan[J]. Journal of Advanced Manufacturing Systems,2005,4(1):103-111
    [176]陈国良,王煦法,庄镇泉,等.遗传算法及其应用[M] .北京:人民邮电出版社,1996. 81-147.
    [177]毛恒、王永初.一种基于差异演化的协同粒子群优化算法[J] .信息与控制,已被录用
    [178] Whitley D.An Overview of Evolutionary Algorithms:Practical Issuesand common Pitfalls[J].Information and Software Technology,2001,43(14):817—831.
    [179]谢晓锋,张文俊,张目瑞,等.差异演化的实验研究[J].控制与决策,2004,19(1):49-52.
    [180]吴亮红,王耀南,袁小芳,周少武.自适应二次变异差分进化算法[J],控制与决策,2006,21(8):898-902
    [181] Price K. Differential Evolution: A Fast and Simple NumericalOptimizer [A]. 1996 Biennial Conf of the North American Fuzzy InformationProcessing Society [C]. New York, 1996:524-527
    [182] ST0RN R.Differential evolution design of an IIR—filter[A].IEEEInt Conf on Evolutionary Computation[C].Nagoya,1996.
    [183] Madavan N K.Multiobjective optimization using aPareto differential evolution approach[A].Proceedingsof the Congress on Evolutionary Computation[C].Honolulu,USA 2002.
    [184] RAINER S,KENNETH P.Differential evolution:a simple and efficientadaptive scheme for global optimization over continuous spaces[J].Journal of Global Optimization,1997,11:341-359.
    [185]韩琳,贺兴时.基于人工免疫系统的二进制差分进化算法[J],哈尔滨工程大学学报,2006,27,supp1:278-282
    [186]郭振宇,康龙云,程博,叶敏,曹秉刚.一种动态改变权重因子和交叉率的混沌差异演化算法[J].哈尔滨工程大学学报,2006,27,Supp1:523-526
    [187]高飞,童恒庆.一类推广的差异演化算法及其应用[J],武汉大学学报(理学版),2005,51(5):547-551
    [188]毛恒、王永初.一种基于差异演化变异的粒子群优化算法[J] .计算机工程与应用,2007,43(30):56-59
    [189]范维澄,王清安等.火灾学简明教程[M].合肥:中国科学技术大学出版社.1995:1,23~46,128~129,132,243~251,249
    [190]程晓舫等.火灾探测的原理与方法(上) [J] .中国安全学报,1999,9(1):24-29
    [191]黄湘莹.基于过程特征信息的火灾早期探测方法研究[D] .华侨大学.2006: 2-3,26-27
    [192]龚雪.基于ARM的火灾复合探测系统研究[D] .华侨大学.2006: 6,16
    [193]黄湘莹等. CO/CO2体积分数分析在火灾早期探测中的应用[J].消防科学与技术,2005,24(5): 577-591
    [194]张树京,齐立心.时间序列分析简明教程[M].北京:北方交通大学出版社. 2003: 18~19.
    [195]高惠璇等著.应用多元统计分析[M].北京:北京大学出版社. 2005:265-277.
    [196]王永骥,涂键.神经元网络控制[M].北京,机械工业出版社,1998.2
    [197]何玉彬,李新忠.神经网络控制技术及其应用[M].北京,科学出版社,2000
    [198]李士勇.模糊控制、神经控制和智能控制论[M].哈尔滨,哈尔滨工业大学出版社,1998.9第二版
    [199]李人厚.智能控制理论和方法[M].西安,西安电子科技大学出版社,1999.10
    [200] Saridis G.S.Intelligent Robot Control.IEEE Tran on Automatic Control,1983,28(5):547-557
    [201]高文志.人工神经网络的发展、研究内容及应用综述[J].山东电子,1998(4):3-4
    [202]龙伟,张金,黄杰.人工神经网络发展前景[J].机械,1998,25(1):47-50
    [203]喻宗泉.人工神经网络发展五十五年[J].自动化与仪表,1998,13(5):1-4
    [204]韩力群.人工神经网络在控制中的应用及发展前景[J].北京轻工业学院学报,1996,14(1):32-36
    [205]费峻涛,鲍远律,朱民,杨梅.神经网络控制的应用和发展[J].自动化与仪表,1998,13(2):1-2
    [206]刘永红.神经网络理论的发展与前沿问题[J].信息与控制,1999,28(1):31-46
    [207]李少远,王群仙,刘浩,袁著祉.神经网络在控制中的应用[J].天津纺织工学院学报,1997,16(4):85-89.
    [208]宋卫国范维澄吴龙标.基于人工神经网络的火灾图象探测方法[J].火灾科学,1999,8(3):49-56
    [209]张本矿,吴龙标,卢结成.多层感知器火灾探测器研究[J].仪器仪表学报学,1999,20(2):202-204
    [210]赵建华,喻益超,李庄.火灾气体辨识的人工神经网络方法研究[J].消防设备研究,2006,25(5):675-678
    [211]翟瑞国,范征宇.火灾探测的神经网络融合算法[J].微型电脑应用,2003,19(11):37-39
    [212]罗云林,朱瑞平,王菁华.基于数字图像处理的火警监测系统研究[J].辽宁工程技术大学学报.2002.21(6):754-756
    [213]许维胜,田长征,方盛明.基于图像视觉特征的火灾自动识别[J].计算机工程,2003,29(18):112-114
    [214]邓超,吴龙标,范维澄,谭营.热释放率计算和预测的神经网络方法[J]中国科技大学学报,1999,29(2):175-180
    [215]张晶,李心广.基于人工智能技术的火灾探测信息融合系统[J].工业以表与自动化装置,2004,(4):65-68
    [216]夏太武,彭京华.人工神经网络在火灾探测中的应用[J].河北工业大学成人教育学院学报,2005,21(2):28-32
    [217]史海山,吕厚余,仲元红,刘晓明.基于遗传神经网络的火灾图像识别及应用[J].计算机科学,2006,33(11):233-236
    [218]吴龙标,张本矿.基于遗传算法的前馈神经网络火灾探测[J].火灾科学,1998.,7(2):21-26
    [219]王浩然,王殊,杨宗凯.子波神经网络在火灾探测中的应用[J].华中理工大学学报,1998.,26(11):1-3
    [220]曾昭华,苏志军,高姗姗.基于模糊神经网络的火灾探测算法的应用研究[J].控制理论与应用,2004,23(9):7-9
    [221]胡为,付兴武.基于模糊神经网络的智能火灾报警控制系统[J].微计算机信息,2004,20(3):20-21
    [222]张阳,张辉.基于模糊神经网络的智能型火灾报警系统[J].电子质量,2004,(4):4-5
    [223]刘尚争,董爱华,郑艳玲.基于模糊神经网络火灾报警系统设计[J].煤矿机械,2005,(5):14-16
    [224]杨效余,钱玮.模糊神经网络在火灾报警系统中的应用[J].自动化与仪表.2006. (1):40-43
    [225]王华,李景玉.模糊神经网络在火灾探测系统的应用[J].河北建筑科技学院学报,2002,19 (4):24-26
    [226]姚伟祥,吴龙标,卢结成.用模糊神经网络进行火灾探测[J].信号处理,2000,16(1):68-73
    [227]高海兵,高亮,周驰,喻道远.基于粒子群优化的神经网络训练算法研究[J],电子学报,2004,32(9):1572-1574
    [228]张顶学,关治洪,刘新芝.基于PSO的RBF神经网络学习算法及其应用[J],计算机工程与应用,2006,(20):13-15
    [229]王俊年,申群太,沈洪远,周鲜成.基于QPSO算法的RBF神经网络参数优化仿真研究[J],计算机应用,2006,26(8):1928-1931
    [230]王俊年,申群太,沈洪远,周鲜成.基于多种群协同进化微粒群算法的径向基神经网络设计[J],控制理论与应用,2006,23(2):251-255
    [231]刘鑫朝,颜宏文.一种改进的粒子群优化RBF网络学习算法[J],计算机技术与发展,2006,16(2):185-187
    [232]魏秀业,潘宏侠,马清峰.粒子群优化的神经网络在故障诊断中的应用[J],振动、测试与诊断,2006,26(2):133-137
    [233]丁宏锴,萧蕴诗,李斌宇,岳继光.基于PSO-RBF NN的非线性系统辨识方法仿真研究[J],系统仿真学报,2005,17(8):1826-1829
    [234]赵辉,刘鲁源,张更新.基于复合适应度微粒群算法的神经网络训练[J],控制与决策,2005,20(8):958-960
    [235]王俊年,申群太,周少武,沈洪远.基于种群小生境魏礼群算法的前向神经网络设计[J],控制与决策,2005,20(9):981-985
    [236]岑翼刚,秦元庆,孙德宝,李宁.粒子群算法在小波神经网络中的应用[J],系统仿真学报,2004,16(12):2783-2786
    [237]李爱国,覃征.基于粒子群优化的积单元网络预测混沌序列[J],小型微型计算机系统,2004,25(6):972-974
    [238]金以慧.过程控制[M].北京,清华大学出版社,1993.4
    [239]刘金琨.先进PID控制及其MATLAB仿真[M].北京,电子工业出版社,2003,92
    [240]陶永华.新型PID控制及其应用[M].北京,机械工业出版社,2002.9
    [241]王爱玲,孔祥菊.不完全微分型PID算法在化工行业中的应用[J].辽宁化工,1997,26(6):349-351
    [242]黄一夫等.微型计算机控制技术[M].机械工业出版社,2000.1
    [243]飞思科技产品研发中心.MATLAB 6.5辅助神经网络分析与设计[M].电子工业出版社,2003.1
    [244]王书宁,戴建设.极小极大拟合准则下的在线参事估计方法[J],华中理工大学学报,1994,22(8):59-63
    [245]王永初,陈庄金,李钟慎.现代控制工程设计基础[M].广州,暨南大学出版社,1997.62-77
    [246]金以慧.过程控制[M],北京,清华大学出版社,2003,48-62
    [247] Zhihong Xiu,Guang Ren.Optimization Design of TS—PID FuzzyControllers Based on Genetic Algorithms[C].Proc.of the 5th World Congresson Intelligent Control and Automation (Hangzhou,China),2004.2476-2480
    [248]王永初,任秀珍.工业过程控制系统设计范例[M],北京,科学出版社,1986,301

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700