用户名: 密码: 验证码:
面向动态环境的粒子群算法研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
粒子群算法(Particle Swarm Optimization, PSO)是一种基于群体智能的优化方法,由Kennedy和Eberhart于1995年提出。由于其具有快速收敛和易于实现等特点,因此粒子群算法在智能计算、任务调度、交通优化、电信路由、电路设计等多个领域得以广泛应用,成为计算智能领域研究的新热点。
     虽然粒子群算法及其众多的改进算法已经被成功地运用到一些静态问题的优化上,但是,很多现实问题往往是随时间变化而变化的,这些动态变化的问题要求算法能够对环境的变化快速反应,对变化的最优解快速跟踪。这给粒子群算法以及整个演化计算方法带来了新的挑战。
     本文从理论、方法和应用三个方面对动态环境下粒子群算法进行研究。论文内容主要包括以下三个部分:
     第一部分旨在对粒子的运动行为和粒子群算法的收敛性进行分析。首先构造李雅普诺夫函数,对单个粒子的运动行为进行了分析,给出了粒子运动稳定的条件。然后利用随机过程理论,证明了粒子位置序列均方稳定。在对单个粒子运动行为分析的基础上,分析了粒子群体运动行为,证明了群体运动的稳定性。最后从随机优化算法收敛性判定标准入手,分析了粒子群算法的收敛性,提出了一种保证全局收敛的改进粒子群算法,通过对基准测试函数仿真,验证了改进算法的有效性。
     第二部分主要研究了如何利用改进粒子群算法解决动态环境下单目标、多目标和高维优化问题。
     对于动态单目标优化问题的研究,本文首先对环境的变化模式进行了数学描述,分析了粒子群算法无法有效对动态问题优化的原因,然后提出了一种基于柯西变异和斥力势场的多粒子群改进算法,定量分析了柯西变异优于其它变异的原因。对动态基准测试函数的仿真表明,改进算法能够对动态环境下变化的极值点进行有效跟踪。
     对于动态多目标优化问题的研究,本文首先对动态多目标优化问题的定义进行了描述,分析了算法的性能评价标准,在此基础上,提出了一种基于多种群协同优化的粒子群算法,并从理论上证明了多种群协同搜索优于单种群独自搜索。改进算法采用了竞争模式和协作模式自适应切换的方法对Pareto前端和Pareto最优解集进行跟踪。竞争模式采用了隐式空间分解,主要目的是对整个解空间进行勘探,进行粗粒度的搜索,在竞争产生非支配解集失效后,多种群进行协作搜索,协作搜索采用显式空间分解,其主要目的是对局部搜索空间开采,进行精度搜索。通过对动态多目标测试函数仿真,验证了改进算法可以对变化的Pareto前端和Pareto最优解集快速跟踪。
     对于动态高维优化问题的研究,首先分析了高维优化问题难以优化的原因,并提出了一种基于局部极值点维度自适应学习的粒子群改进算法,随后通过对高维测试函数的仿真,验证了改进算法的有效性。
     第三部分对垃圾焚烧系统PID控制器参数自适应整定进行了研究。垃圾焚烧系统由于系统噪声、设备折旧等因素的影响,系统参数容易发生变化,因此可以看成动态系统的PID控制器的参数要不断进行调整。本部分首先定义了一个包含系统超调量、上升时间和稳态误差指标项的适应度函数,根据控制系统的实际要求对各指标项进行适当加权,利用改进粒子群算法对PID控制器的参数进行优化。随后基于Pareto优化理论,利用改进的多目标粒子群算法,在每次环境变化时给出了完整的Pareto非劣最优解,可供决策者根据超调量和上升时间的不同满意度,选择相应的PID控制参数。
     最后对全文进行总结,对本文存在的不足进行了阐述,并对粒子群算法的发展进行了展望。
Particle Swarm Optimization (PSO) is an optimization method based on swarm intelligence, by Kennedy and Eberhart in 1995. Because of its fast convergence and easy to realize, PSO is widely used in many fields such as computational intelligence, task schedule, traffic optimization, telecommunications routing, circuit design. Now it has become a hot topic in field of computational intelligence research.
     Although PSO and its variants have been successfully applied to static optimization problem, in many real-world optimization problems, the objective function, the problem instance, or constraints may change over time, and thus, the optimum of that problem might change as well. This brings new challenges to PSO even to evolutionary computation as a whole.
     In this paper, theory, method and application of PSO are studied. Paper mainly includes the following three parts:
     The first part is mainly on the theory of PSO. First, by the Lyapunov time-varying model, the movement of single particle is analyzed, and stability condition is given, and then using stochastic processes theory to prove that the particle's position sequences converge in mean square. Furthermore, the movement of the whole swarm is analyzed. Finally according to the convergence criterion of stochastic optimization algorithm, a guaranteed global convergence PSO is proposed, which is tested on a few benchmark functions, the simulation shows the effectiveness of the improved algorithm.
     The second part is on the improved PSO in dynamic environments, mainly including dynamic single-objective PSO, dynamic multi-objective PSO, and dynamic high-dimensional PSO.
     This paper first represents the model of dynamic environment, makes an analysis of the difficulty to solve the dynamic optimization problems by PSO, and then propose a improved multi-swarm PSO based on Cauchy mutation and the repulsion potential field, the new algorithm is tested on CEC09 benchmark functions and the DF1, the simulation shows that the improved algorithm can track the changing extreme points effectively.
     For the dynamic multi-objective problem, the definition is given and performance evaluation criteria is analyzed in detail, then a collaborative multi-swarm PSO is proposed, which adaptively switching from competitive model to cooperative model to track for the Pareto front and Pareto solution set. The purpose of competition is to explore in the search space, on the contrary, the purpose of cooperation is to exploit in the search space. The improved algorithm is compared with the other two algorithms and performs well in tracking performance by tested on moving peaks benchmark and dynamic functions.
     As the dimension of the search space rise, almost all the evolutionary computation suffers "the curse of dimensionality". This paper first makes an analysis of reasons and put forward a dimensional adaptive learning PSO for the local extreme points. The simulation verifies the excellent tracking performance of the improved algorithm.
     The third part is the application of PSO in dynamic environment. This paper proposes an improved PSO to optimize the parameters of PID controller for the dynamic system. First the fitness function is defined by the rising time, overshoot and steady state error with appropriate weighting according to actual control system. Improved PSO is proposed to optimize the parametres of PID controller. Then based on Pareto optimization theory, the improved multi-objective PSO is proposed to provided a complete Pareto nondominated solutions, which could satisfy decision-makers to choose corresponding the parameters of PID controller according to their preference to the overshoot and rise time.
     Finally, the full text of this article is summarized, the deficiencies are explained and the future of PSO is prospected.
引文
[1]Reynolds. Flock, Herd and schools:A distributed behavioral model. Computer graphic,1987,21(4):25-34
    [2]Kennedy, J., Eberhart, R. Particle swarm optimization, Proceedings of the IEEE international Conference on Neural Networks, IV. Piscataway:IEEE Service Center,1995:1942-1948
    [3]Shi Y. H., Eberhart R. C. A Modified Particle Swarm Optimizer[R]. IEEE International Conference on Evolutionary Computation, Anchorage, Alaska,1998: 69-73
    [4]Eberhart, R. C., Shi, Y. Comparing inertia weights and constriction factors in particle swarm optimization. In Proceedings of the IEEE congress on evolutionary computation (CEC) San Diego, CA. Piscataway:IEEE.2000:84-88
    [5]Zheng, Y.-L., Ma, L.-H., Zhang, L.-Y., et al. On the convergence analysis and parameter selection in particle swarm optimization. In Proceedings of the IEEE international conference on machine learning and cybernetics. Piscataway:IEEE. 2003:1802-1807
    [6]Eberhart, R. C., Shi, Y. Tracking and optimizing dynamic systems with particle swarms. In Proceedings of the IEEE congress on evolutionary computation (CEC), Seoul, Korea. Piscataway:IEEE,2001:94-100
    [7]M. Clerc, J. Kennedy. The particle swarm:Explosion, stability, and convergence in a multi-dimensional complex space. IEEE Trans. Evol. Comput.,2002,6(1):58-73
    [8]Mendes, R. Population topologies and their influence in particle swarm performance. PhD thesis, Departamento de Informatica, Escola de Engenharia, Universidade do Minho,2004
    [9]Kennedy, J. Bare bones particle swarms. In Proceedings of the IEEE swarm intelligence symposium (SIS), Indianapolis, IN. Piscataway:IEEE.2003:80-87
    [10]Richer, T., Blackwell, T. M. The Levy particle swarm. In Proceedings of IEEE congress on evolutionary computation, Vancouver. Piscataway:IEEE.2006: 3150-3157
    [11]Kennedy J. Small Worlds and Mega-minds:Effects of Neighborhood Topology on Particle Swarm Performance. In:The 1999 Congress on Evolutionary Computation. Piscataway, NJ:IEEE Press,1999:1931-1938
    [12]Suganthan, P. N. Particle swarm optimiser with neighbourhood operator. In Proceedings of the IEEE congress on evolutionary computation (CEC). Piscataway: IEEE.1999:1958-1962
    [13]Peram, T., Veeramachaneni, K., Mohan, C. Fitness-distance ratio based particle swarm optimization. In Proceedings of the IEEE swarm intelligence symposium (SIS), Indianapolis, IN. Piscataway:IEEE.2003:174-181
    [14]Liang, J. J., Suganthan, P. N. Dynamic multiswarm particle swarm optimizer (DMS-PSO). In Proceedings of the IEEE swarm intelligence symposium (SIS). Piscataway:IEEE.2005:124-129
    [15]Janson, S., Middendorf, M. A hierarchical particle swarm optimizer and its adaptive variant. IEEE Transactions on System Man and Cybernetics B,2005, 35(6):1272-1282
    [16]Clerc, M. Particle swarm optimization. London:ISTE.2006
    [17]Angeline, P. Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences. In V. W. Porto, N. Saravanan, D. Waagen, & A. E. Eiben (Eds.), Proceedings of evolutionary programming VII. Berlin: Springer,1998:601-610
    [18]Miranda, V., Fonseca, N. New evolutionary particle swarm algorithm (EPSO) applied to voltage VAR control. In Proceedings of the 14th power systems computation conference (PSCC) (Session21, Paper 5, Seville, Spain.2002:1-6
    [19]Lo(?)vbjerg, M., Rasmussen, T. K., Krink, T. Hybrid particle swarm optimiser with breeding and subpopulations. In Proceedings of the third genetic and evolutionary computation conference (GECCO). San Francisco:Kaufmann.2001:469-476
    [20]Wei, C., He, Z., Zhang, Y., & Pei, W. Swarm directions embedded in fast evolutionary programming. In Proceedings of the IEEE congress on evolutionary computation (CEC), Honolulu, HI. Piscataway:IEEE.2002:1278-1283
    [21]Noel M. M., Jannett T. C. Simulations of a new hybrid particle swarm optimization algorithm. Proceedings of the Thirty-Sixth Southeastern Symposiumon System theory.2004:150-153
    [22]高鹰,谢胜利.混沌粒子群算法.计算机科学,2004,31(8):13-15
    [23]高鹰,谢胜利.免疫粒子群算法.计算机工程与应用,2004,6:4-6
    [24]高鹰,谢胜利.基于模拟退火的粒子群算法,计算机工程与应用,2004,1:47-50
    [25]Hendtlass, T. A combined swarm differential evolution algorithm for optimization problems. In L. Monostori, J. Vancza & M. Ali (Eds.), Lecture notes in computer science:Vol.2070. Proceedings of the 14th international conference on industrial and engineering applications of artificial intelligence and expert systems (IEA/AIE), Budapest, Hungary. Berlin:Springer.2001:11-18
    [26]Zhang, W.-J., Xie, X.-F. DEPSO:Hybrid particle swarm with differential evolution operator. In Proceedings of the IEEE International conference on systems, man and cybernetics (SMCC), Washington, DC. Piscataway:IEEE.2003: 3816-3821
    [27]Holden, N., Freitas, A. A. A hybrid particle swarm/ant colony algorithm for the classification of hierarchical biological data. In Proceedings of the IEEE swarm intelligence symposium (SIS). Piscataway:IEEE.2005:100-107
    [28]Vesterstro(?)m, J. S., Riget, J.,& Krink, T. Division of labor in particle swarm optimization. In Proceedings of the IEEE congress on evolutionary computation (CEC), Honolulu, HI. Piscataway:IEEE.2002:1570-1575
    [29]Kennedy, J., Eberhart, R. C. A discrete binary version of the particle swarm algorithm. In Proceedings of the conference on systems, man, and cybernetics. Piscataway:IEEE.1997:4104-4109
    [30]Kennedy, J., Spears, W. M. Matching algorithms to problems:an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator. In Proceedings international conference on evolutionary computation. Piscataway:IEEE.1998:78-83
    [31]Clerc, M. Discrete particle swarm optimization, illustrated by the traveling salesman problem. InB. V. Babu & G. C. Onwubolu (Eds.). New optimization techniques in engineering. Berlin:Springer.2004:219-239
    [32]Carlisle A, Dozier G. Adapting particle swarm optimization to dynamic environments[C] Proceedings of International Conference on Artificial Intelligence. Las Vegas, USA,2000:429-434
    [33]Eberhart R C, Shi Y H. Tracking and optimizing dynamic systems with particle swarms[C] Proceedings of the Congress on Evolutionary Computation. Piscataway, USA,2001:94-100
    [34]H. G. Cobb. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments[C]. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA,1990
    [35]F. Vavak, K. Jukes, and T. C. Fogarty. Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search[C]. In Seventh International conference on Genetic Algorithms. Morgan Kaufman,1997
    [36]X. Hu and R. Eberhart, Adaptive particle swarm optimization:Detection and response to dynamic systems, in Proc. Congr. Evol. Comput.,2002:1666-1670
    [37]K. P. Ng, K. C. Wong. A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization of Genetic Algorithms [C]. Proc of the 5th Int Conf on Genetic Algorithms.1995
    [38]J. Lewis, E. Hart, G. Ritchie. A Comparison of Dominance Mechanism and Simple Mutation on Non-Stationary Problems [C]. Parallel Problem Solving from Nature. LNCS1498.1998:139-148
    [39]C. N. Bendtse, T. Krink. Dynamic Memory Model for Non-Stationary Optimization of the Congress of Evolutionary Computation.2002:145-150
    [40]Branke. J Memory enhanced evolutionary algorithms for changing optimization problems[C]. Proc. of the Congress of Evolutionary Computation,1999,3
    [41]J. J. Grefenstette. Genetic algorithms for changing environments[C]. In R. Maenner and B. Manderick (Eds), Parallel Problem Solving from Nature. North Holland,1992:137-144
    [42]N. Mori, H. Kita, and Y. Nishikawa, Adaptation to a changing environment by means of the thermodynamical genetic algorithm, Parallel Problem Solving from Nature. ser. LNCS, H.-M. Voigt, Ed. Berlin, Germany:Springer-Verlag,1996, 1141:513-522
    [43]A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel, Eds. Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm, Parallel Problem Solving from Nature. LNCS, Berlin, Germany: Springer-Verlag,1998,1498:149-158
    [44]J. Vesterstrom T. Krink, J. Riget. Particle swarm optimization with spatial particle extension. In Congress on Evolutionary Computation,2002:1474-1479
    [45]K. E. Parsopoulos, M. N. Vrahatis. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing,2002:235-306
    [46]T. M. Blackwell, P. Bentley. Don't push me! Collision avoiding swarms. In:Proc. of the 2002 Congress on Evolutionary Computation. IEEE Press,2002:1691-1696
    [47]T. M. Blackwell, P. J. Bentley. Dynamic search with charged swarms. In:W. B. Langdon et al., editor, Proc. of the 2002 Genetic and Evolutionary Computation Conference, Morgan Kaufmann,2002:19-26
    [48]T. M. Blackwell, J. Branke. Multi-swarm optimization in dynamic environments. In:G. R. Raidl, editor, Applications of Evolutionary Computing, volume 3005 of Lecture Notes in Computer Science, pages. Springer, Berlin, Germany,2004: 489-500
    [49]T. M. Blackwell, J. Branke. Multi-swarms, exclusion and anti-convergence in dynamic environments. IEEE Transactions on Evolutionary Computation,2006, 10(4):459-472
    [50]T. Richer, T. Blackwell. The Levy particle swarm. In:Proc. of the 2006Congress on Evolutionary Computation, pages. IEEE Press,2006:808-815
    [51]X. Li and K. H. Dam. Comparing particle swarms for tracking extrema in dynamic environments. In:Proc. of the 2003 Congress on Evolutionary Computation,. IEEE Press,2003:1772-1779
    [52]S. Janson, M. Middendorf. A hierarchical particle swarm optimizer for dynamic optimization problems. In:G. R. Raidl, editor, Applications of Evolutionary Computing, volume 3005 of Lecture Notes in Computer Science,. Springer, Berlin, Germany,2004:513-524
    [53]S. Janson, M. Middendorf. A hierarchical particle swarm optimizer for noisy and dynamic environments. Genetic Programming and Evolvable Machines,2006,7(4): 329-354
    [54]王光辉,陈杰,潘峰.多种群协同粒子群算法,求解动态环境优化问题[C].第27届中国控制会议.昆明,2008,5:43-48
    [55]D. Parrott and X. Li, Locating and tracking multiple dynamic optima by a particle swarm model using speciation, IEEE Transactions on Evolutionary Computation, 2006,10(4):440-458
    [56]高平安,蔡自兴,余伶俐.一种基于多子群的动态优化算法.中南大学学报(自然科学版),2009,40(3)
    [57]M. Farina, K. Deb, P. Amato:Dynamic multiobjective optimization problems:Test cases, approximations, and applications. IEEE Transactions on Evolutionary Computation,2004,8(5):425-442
    [58]Jacqueline Moore, Richard Chapman. Application of particle swarm to multiobjective optimization. Department of Computer Science and Software Engineering, Auburn University,1999
    [59]K. E. Parsopoulos, M. N. Vrahatis. Particle swarm optimization method in multiobjective problems. In Proceedings of the 2002 ACM Symposium on Applied Computing SAC'2002, Madrid, Spain, ACM Press.2002:603-607
    [60]U. Baumgartner, Ch. Magele, W. Renhart. Pareto optimality and particle swarm optimization. IEEE Transactions on Magnetics,2004,40(2):1172-1175
    [61]Xiaohui Hu and Russell Eberhart. Multiobjective optimization using dynamic neighborhood particle swarm optimization. In Congress on Evolutionary Computation (CEC), volume 2, Piscataway, New Jersey,. IEEE Service Center, 2002(5):1677-1681
    [62]Chi-kin Chow and Hung-tat Tsui. Autonomous agent response learning by a multi-species particle swarm optimization. In Congress on Evolutionary Computation (CEC), volume 1, Portland, Oregon, USA,. IEEE Service Center, 2004(6):778-785
    [63]K. E. Parsopoulos, D. K. Tasoulis, M. N. Vrahatis. Multiobjective optimization using parallel vector evaluated particle swarm optimization. In Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA 2004), volume 2, Innsbruck, Austria. ACTA Press,2004(2):823-828
    [64]Tapabrata Ray and K. M. Liew. A swarm metaphor for multiobjective design optimization. Engineering Optimization,2002,34(2):141-153
    [65]Jonathan E. Fieldsend and Sameer Singh. A multiobjective algorithm based upon particle swarm optimisation, an efficient data structure and turbulence. In Proceedings of the 2002 U. K. Workshop on Computational Intelligence, Birmingham, UK, September 2002:37-44
    [66]Carlos A. Coello Coello and Maximino Salazar Lechuga. MOPSO:A proposal for multiple objective particle swarm optimization. In Congress on Evolutionary Computation (CEC), volume 2, Piscataway, New Jersey,. IEEE Service Center. May 2002:1051-1056
    [67]Carlos A. Coello Coello, Gregorio Toscano Pulido, and Maximino Salazar Lechuga. Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation,2004,8(3):256-279
    [68]Dipti Srinivasan, Tian Hou Seow. Particle swarm inspired evolutionary algorithm (PSO-EA) for multiobjective optimization problem. In Congress on Evolutionary Computation (CEC), volume 3, Canberra, Australia, IEEE Press, December 2003: 2292-2297
    [69]Mahdi Mahfouf, Min-You Chen, Derek Arturh Linkens. Adaptive weighted particle swarm optimization for multi-objective optimal design of alloy steels. In Parallel Problem Solving from Nature-PPSN VIII, Birmingham, UK,. Springer-Verlag. Lecture Notes in Computer Science Vol.3242. September 2004: 762-771
    [70]Zhang Xiao-hua, Meng Hong-yun, and Jiao Li-cheng. Intelligent particle swarm optimization in multiobjective optimization. In Congress on Evolutionary Computation (CEC), Edinburgh, Scotland, UK. IEEE Press. September 2005: 714-719
    [71]Xiaodong Li. Better spread and convergence:Particle swarm multiobjective optimization using the maximin fitness function. In Kalyanmoy Deb et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Seattle, Washington, USA,. Springer-Verlag, Lecture Notes in Computer Science Vol.3102. June 2004:117-128
    [72]L. B. Zhang, C. G Zhou, X. H. Liu, et al. Solving multi objective optimization problems using particle swarm optimization. In Congress on Evolutionary Computation (CEC), volume 3, Canberra, Australia, IEEE Press. December 2003: 2400-2405
    [73]J. Mehnen, T. Wagner, and G. Rudolph. Evolutionary Optimization of Dynamic Muli-Objective Test Functions. In Proc. of 2nd Italian Workshop on Evolutionary Computation and 3rd Italian Workshop on Artificial Life,2006
    [74]Min Tang, Zhangcan Huang, and Guangxi Chen. The Construction of Dynamic Multi-objective Optimization Test Functions, The 2nd International Symposium on Intelligence Computation and Applications, Springer Lecture Notes in Computer Science (LNCS),2007
    [75]S-U. Guan, Q. Chen, and W. Mo. Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement. Artificial Intelligence Review,2005,23(3): 267-293
    [76]D. A. van Veldhuizen and G B. Lamont. On Measuring Multiobjective Evolutionary Algorithm Performance. In Proc. of Congress on Evolutionary Computation (CEC), July 2000:204-211
    [77]S-Y. Zheng et al. A Dynamic Multi-Objective Evolutionary Algorithm Based on an Orthogonal Design. In Proc. of IEEE Congress on Evolutionary Computation (CEC), July 2006:573-580
    [78]Li, X., Branke, J. and Kirley, M. On Performance Metrics and Particle Swarm Methods for Dynamic Multiobjective Optimization Problems, in Proceeding of Congress of 2007 Evolutionary Computation (CEC), IEEE Service Center, Piscataway, NJ 08855-1331,2007:1635-1643
    [79]Van Veldhuizen, D. Multiobjective Evolutionary Algorithms:Classifications, Analysis, and New Innovations, Ph. D. Thesis, Dayton, OH:AirForce Institute of Technology. Technical Report No. AFIT/DS/ENG/99-01,1999
    [80]B. Zheng. A New Dynamic Multi-Objective Optimization Evolutionary Algorithm. In Proc. of third International Conference on Natural Computation (ICNC), volume V,2007:565-570
    [81]C. K. Goh and K. C. Tan. An Investigation on Noisy Environments in Evolutionary Multiobjective Optimization. IEEE Transactions on Evolutionary Computation, 2007,11(3):354-381
    [82]Camara M, Ortega J, de Toro F. Performance Measures for Dynamic Multi-Objective Optimization,10th International Work-Conference on Artificial Neural Networks (IWANN), Salamanca, SPAIN, JUN 10-12,2009:760-767
    [83]Greeff, M., Engelbrecht, A. P. Solving dynamic multi-objective problems with vector evaluated particle swarm optimization, IEEE Congress on Evolutionary Computation (CEC),2008:2917-2924
    [84]Talukder AKMKA, Kirley M. A Pareto Following Variation Operator For Evolutionary Dynamic Multi-objective Optimization:IEEE Congress on Evolutionary Computation, JUN 01-06,2008 Hong Kong, PEOPLES R CHINA, 2008:2270-2277
    [85]Chi-Keong Goh, Kay Chen Tan. A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization. IEEE Transactions on Evolutionary Computation,2009,13(1):103-127
    [86]Ozcan, E., Mohan, C. K. Analysis of a simple particle swarm optimization system. Intelligent Engineering Systems Through Artificial Neural Networks,1998,8: 253-258
    [87]Ozcan, E., Mohan, C. Particle swarm optimization:sur_ng the waves. Proc.1999 Congress on Evolutionary Computation, Piscataway, NJ:IEEE Service Center, 1999:1939-1944
    [88]Van den Bergh, F. An Analysis of Particle Swarm Optimizers. PhD thesis, Department of Computer Science. University of Pretoria, Pretoria, South Africa. 2002
    [89]Yasuda, K., Ide, A., Iwasaki, N. Adaptive particle swarm optimization. In Proceedings of the IEEE international conference on systems, man and cybernetics. Piscataway:IEEE.2003:1554-1559
    [90]T. M. Blackwell. Particle swarms and population diversity. Soft Computing,2005: 793-802
    [91]Trelea, I. C. The particle swarm optimization algorithm:convergence analysis and parameter selection. Information Processing Letters,2003,85(6):317-325
    [92]Campana, E. F., Fasano, G, and Pinto, A. Dynamic system analysis and initial particles position in particle swarm optimization. In IEEE Swarm Intelligence Symposium, Indianapolis,2006
    [93]Kadirkamanathan, V., Selvarajah, K., and Fleming, P. J. Stability analysis of the particle dynamics in particle swarm optimizer. IEEE Trans. Evolutionary Computation,2006,10(3):245-255
    [94]Clerc, M. Stagnation analysis in particle swarm optimization or what happens when nothing happens. Technical Report CSM-460, Department of Computer Science, University of Essex, August 2006
    [95]Solis F, Wets R. Minimization by random search techniques [J]. Mathematics of Operations Research,1981,6(1):19-30
    [96]曾建潮,崔志华.微粒群算法的统一模型及分析.计算机研究与发展,2006(43):96-100
    [97]李宁.粒子群算法的理论分析与应用研究:[工学博士论文].华中科技大学,2006.3
    [98]金欣磊,马龙华,吴铁军等.基于随机过程的PSO收敛性分析.自动化学报,2007,33(12)
    [99]Hu Chengyu, Wu Xiangning, Wangyongji. Particle Swarm Optimization with Dynamic Dimension Crossover for High Dimensional Problems, ISICA2008
    [100]Solis F, Wets R. Minimization by Random Search Techniques. Mathematics of Operations Research,1981,6:19-30
    [101]Liang J. J., Qin A. K. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans on Evolutionary Computation, 2006,10(3):281-295
    [102]Parsopoulos K. E, Vrahatis M. N. UPSO:A unified particle swarm optimization scheme. In:Proc. Of the ICCMSE 2004. Attica:VSP Int'l Science Publishers, 2004:868-873
    [103]J. Branke. Evolutionary Approaches to Dynamic Optimization Problems: Introduction and Recent Trends[C]. In GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems,2001:27-30
    [104]J. Branke. Memory enhanced evolutionary algorithms for changing optimization problems. Proc. of the 1999 Congr. On Evol. Comput,1999:1875-1882
    [105]R. W. Morrison and K. A. De Jong. A test problem generator for non-stationary environments, Proc. of the 1999 Congr. On Evol. Comput.,1999:2047-2053
    [106]J. J. Liang, P. N. Suganthan and K. Deb. Novel composition test functions for numerical global optimization. Proc. of IEEE Int. Swarm Intelligence Symp.,2005: 68-75
    [107]P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger and S. Tiwari. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report, Nanyang Technological University, Singapore,2005
    [108]R. W. Morrison, Performance Measurement in Dynamic Environments'In GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, J. Branke,Ed.,2003:5-8
    [109]R. W. Morrison, Designing evolutionary algorithms for dynamic environments [M]: Springer Verlag,2004
    [110]J. Branke and H. Schmeck. Designing evolutionary algorithms for dynamic optimization problems. Advances in Evolutionary Computing:Theory and Applications,2003:239-262
    [111]王晖.基于柯西变异的混合粒子群算法研究:[硕士学位论文].中国地质大学,2008.7
    [112]吕艳萍等.自适应扩散混合变异机制微粒群算法.软件学报.2007,18(11):2740-2751
    [113]Peter Korosec, Jurij Silc. The Differential Ant-Stigmergy Algorithm Applied to Dynamic Optimization Problems. Proc. of the 2009 Congr. On Evol. Comput, 2009:407-414
    [114]M. A. Potter. The design and analysis of a computational model of cooperative coevolution. Ph. D. dissertation, George Mason Univ., Fairfax, VA,1997
    [115]F. van den Bergh and A. P. Engelbrecht. A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation,2004,8(3): 225-239
    [116]F. van den Bergh, A. P. Engelbrecht, Effect of swarm size on cooperative particle swarm optimizaters. in Proc. Genetic and Evolutionary Computation Conference, 2001
    [117]S. Baskar and P. N. Suganthan. A novel concurrent particle swarm optimization. in Proc. IEEE Congress on Evolutionary Computation,2004,1:792-796
    [118]J.-F. Chang, S.-C. Chu, J. F. Roddick, et al. A parallel particle swarm optimization algorithm with communication strategies. Journal of Information Science and Engineering,2005,21(4):809-818
    [119]S.-C. Chang and J.-S. Pan. Intelligent parallel particle swarm optimization algorithm. in Parallel Evolutionary Computations, N. Nedjah, E. Alba, and L. de Macedo Mourelle, Eds. Studies in Computational Intelligence, Springer Berlin, 2006,22:159-175
    [120]M. El-Abd and M. S. Kamel. A hierarchal cooperative particle swarm optimizer. in Proc. IEEE swarm intelligence symposium,2006:43-47
    [121]G. Yen and M. Daneshyari. Diversity-based information exchange among multiple swarms in particle swarm optimization. in Proc. IEEE Congress on Evolutionary Computation,2006:6150-6157
    [122]B. Niu, Y. Zhu, and X. He. Multi-population cooperative particle swarm optimization. in Proc. European Conference on Artificial Life, M. C. et al., Ed., 2005:874-883
    [123]G. Toscano, A. C. C. Coello. Using clustering techniques to improve the performance of a multi-objective particle swarm optimizer. in Proc. Genetic and Evolutionary Computation Conference,2004:225-237
    [124]Sanaz Mostaghim, Juergen Branke, Karlsruhe, et al. Multi-objective particle swarm optimization on computer grids. Proceedings of the 9th annual conference on Genetic and evolutionary computation,2007:869-875
    [125]K. C. Tan, Y. J. Yang, and C. K. Goh: A distributed cooperative coevolutionary algorithm for multiobjective optimization. IEEE Trans. Evol. Comput.,2006,10: 527-549
    [126]Deb, K. and Horn. J. Introduction to the special issue:Multicriterion optimization. Evolutionary Computation Journal,2000,8(2):3-15
    [127]刘静.协同进化算法及其应用研究.西安电子科技大学,2004.9
    [128]张桂娟.适应协同进化模型及应用:[硕士学位论文].山东师范大学,2006.4
    [129]曹先彬,罗文坚,王煦法.基于生态种群竞争模型的协同进化.软件学报,2001,12(4):556-562
    [130]郑浩然.基于生态特征的进化与协同研究:[硕士学位论文].中国科学技术大学,2000
    [131]V. L. Huang, P. N. Suganthan, J. J. Liang. Comprehensive Learning Particle Swarm Optimizer for Solving Multiobjective Optimization Problems. International Journal of Intelligent Systems,2006:209-226
    [132]Bellman, R. E. Adaptive Control Processes. Princeton University Press, Princeton, NJ,1961
    [133]Potter M A, De Jong K A. A cooperative co-evolutionary approach to function optimization[C], The Third Parallel Problem Solving from Nature. Berlin, Germany:Springer-Verlag,1994:249-257
    [134]Tony Huanga, Ananda S. M. Micro-particle swarm optimizer for solving high dimensional optimization problems [J]. Applied Mathematics and Computation, 2006,181(2):1148-1154
    [135]Zhenyu Yang, Ke Tang and Xin Yao. Multilevel Cooperative Coevolution for Large Scale Optimization. in Proceedings of the 2008 IEEE Congress on Evolutionary Computation (CEC), Hongkong, China,2008:1663-1670
    [136]Zhenyu Yang, Ke Tang and X. Yao. Large Scale Evolutionary Optimization Using Cooperative Coevolution. Information Sciencs,2008,178(15):2985-2999
    [137]Zhenyu Yang, Ke Tang and Xin Yao. Differential Evolution for High-Dimensional Function Optimization. Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC), Singapore,2007
    [138]雷开友,邱玉辉,贺一.一种优化高维复杂函数的PSO算法[J].计算机科学,2006,33
    [139]张晶伟,胡安炎,关焕梅.基于PSO及SA的高维优化方法研究及应用[J].水力发电,2008,34(3)
    [140]高浩,须文波,孙俊.一种优化高维函数的量子—粒子群算法[J].计算机应用,2007,27(12)
    [141]李莉,李洪奇.基于混合粒子群算法的高维复杂函数求解[J].计算机应用,2007,27(7)
    [142]谭璐.高维数据的降维理论及应用:[博士学位论文].国防科学技术大学,2005,4
    [143]Janez Brest, Ales Zamuda. Dynamic Optimization using Self-Adaptive Differential Evolution. Proc. of the 2009 Congr. On Evol. Comput,2009:415-422
    [144]M. Annunziato M, I. Bertini, A. Pannicelli, et al. Evolutionary control and optimization:An industrial application for combustion processes. in Proc. EUROGEN, Athens, Greece, Sept.2001:367-372
    [145]蔡正裕.Da Type Fuzzy PID之焚化炉燃烧控制:[硕士学位论文].国立中山大学,2005
    [146]郑金华.多目标进化算法及其应用.科学出版社,2007.2
    [147]Back, T. Evolutionary Algorithms in Theory and Practice. New York:Oxford University Press,1996.
    [148]Van Veldhuizen David A, Gary B Lamont. Evolutionary Computation and Convergence to a Pareto Front. In John R Koza (editor). Late Breaking Papers at the Genetic Programming 1998 Conference, Stanford University, California. Stanford Bookstore.1998:221-228
    [149]Fabr'icio Olivetti de Franc, Fernando J. Von Zuben. Dynamic Artificial Immune Algorithm Applied to Challenging Benchmarking Problems. Proceedings of 2009 IEEE Congress on Evolutionary Computation,2009:423-430
    [150]X Li, K.H Dam. Comparing particle swarms for tracking extrema in dynamic environments, Congresson Evolutionary Computation,2003,3:1772-1779

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

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

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