【正文】 he biological principles of swarm intelligence [J]. Swarm Intelligence, vol. 30, , 2007, . [3] Eberhart R, Shi Y. Particle swarm optimization: Developments, applications and resources [A]. in: Proc. IEEE Congr. Evol. Comput. [C], vol. 1, , 2001, . [4] Parsopoulos K, Vrahatis M. Recent approaches to global optimization problems through particle swarm optimization [J]. Natural Computing, , no. 1, 2002, . [5] 謝曉鋒, 張文俊, 楊之廉. 微粒群算法綜述[J]. 控制與決策, vol. 18, no. 2, 2003: 129134. [6] Hu X, Shi Y, Eberhart R. Recent advances in particle swarm [A]. in: Proc. IEEE Congr. Evol. Comput.[C], , 2004, . [7] Banks A, Vincent J, Anyakoha C. A review of particle swarm optimization. Part I: background and development [J]. Natural Computing, vol. 45, no. 6, 2007, . [8] 王萬良, 唐宇. 微粒群算法的研究現(xiàn)狀與展望[J]. 浙江工業(yè)大學(xué)學(xué)報, vol. 35, no. 2, 2007: 136141. [9] Poli R, Kennedy J, Blackwell T. Particle swarm optimization: An overview [J]. Swarm Intelligence, , , 2007, . [10] Jelmer Van A, Robert B, Bart De S. Particle swarms in optimization and control [A]. in: Proceedings of the 17th World Congress The International Federation of Automatic Control [C], Seoul, Korea, 2008, . [11] Kennedy J. The particle swarm: Social adaptation of knowledge [A]. in: Proc. IEEE Int. Conf. Evol. Comput. [C], Apr. 1997, pp. 303–308. [12] Langdon W B, Poli R. Evolving problems to learn about particle swarm and other optimizers [A]. in: Proc. CEC2005 [C]. , 2005, . [13] Clerc M. Stagnation analysis in particle swarm optimization or what happens when nothing happens. Online at [14] Ling S H, Iu H. C F, Leung H F, et al. Improved hybrid particle swarm optimized wavelet neural network for modeling the development of fluid dispensing for electronic packaging [J]. IEEE Trans. Ind. Electron., vol. 55, , 2008, . [15] dos Santos Coelho L, Herrera B M. Fuzzy identification based on a chaotic particle swarm optimization approach applied to a nonlinear yoyo motion system [J]. IEEE Trans. Ind. Electron., , , 2007, . [16] Clerc M. Initialisations for particle swarm optimization. Online at , 2008. [17] Richards M, Ventura D. Choosing a starting configuration for particle swarm optimization [A]. in: Proc. IEEE Int. Joint. Conf. Neural Network. [C], vol. 3, 2004, pp. 2309–2312. [18] 薛明志,左秀會,鐘偉才 等. 正交微粒群算法 [J]. 系統(tǒng)仿真學(xué)報, vol. 17, no. 12, 2005, pp. 29082911. [19] Campana E F, Fasano G, Pinto A. Dynamic system analysis and initial particles position in particle swarm optimization [A]. in: Proc. IEEE Swarm Intell. Symp. [C], May, 2006, pp. 202–209. [20] Eberhart R, Shi Y, Kennedy J. Swarm Intelligence [M]. San Mateo, CA: Morgan Kaufmann, 2001. [21] Kennedy J. Small worlds and megaminds: Effects of neighborhood topology on particle swarm performance [A]. in: Proc. IEEE Congr. Evol. Comput. [C], Jul. 1999, vol. 3, pp. 1931–1938. [22] Kennedy J, Mendes R. Population structure and particle swarm performance [A]. in: Proc. IEEE Congr. Evol. Comput. [C], May 2002, vol. 2, pp. 1671–1676. [23] Suganthan P N. Particle swarm optimizer with neighbourhood operator [A]. in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC) [C], Piscataway, NJ, 1999, 19581962. [24] Veeramachaneni K, Peram T, Mohan C, Osadciw L A. Optimization using particle swarms with near neighbor interactions [A]. in: Proc. Genetic and Evolutionary Computation (GECCO 2003) [C], vol. 2723, 2003, pp. 110–121. [25] Abraham A, Guo H, Liu H. Swarm intelligence: foundations, perspectives and applications [A]. Swarm Intelligent Systems, Studies in Computational Intelligence [C], N. Nedjah, L. Mourelle (eds.), Springer Verlag, 2006, . 致謝經(jīng)過半年的忙碌和工作，本次畢業(yè)設(shè)計已經(jīng)接近尾聲，作為一個本科生的畢業(yè)設(shè)計，由于經(jīng)驗的匱乏，難免有許多考慮不周全的地方，如果沒有導(dǎo)師的督促指導(dǎo)，以及一起工作的同學(xué)們的支持，想要完成這個設(shè)計是難以想象的。他的治學(xué)嚴(yán)謹(jǐn)和科學(xué)研究的精神也是我永遠(yuǎn)學(xué)習(xí)的榜樣，并將積極影響我今后的學(xué)習(xí)和工作。 %清除所有變量clc。初始化群體個數(shù)D=10。 %學(xué)習(xí)因子2c12=。 %設(shè)置精度（在已知最小值的時候用）%初始化種群個體（限定位置和速度）x=zeros(N,D)。 %隨機(jī)初始化速度 endend%顯示群位置figure(1)for j=1:D if(rem(D,2)0) subplot((D+1)/2,2,j) else subplot(D/2,2,j) end plot(x(:,j),39。粒子39。第39。 if(j9) tInfo=strcat(39。)。grid on xlabel(39。) tInfo=strcat(39。 if(j9) tInfo=strcat(39。 end title(tInfo)endfigure(3)%第一個圖subplot(1,2,1)%初始化種群個體（在此限定速度和位置）x1=x。for i=1:N pbest1(i)=fitness(x1(i,:),D)。 gbest1=pbest1(i)。 end if(pbest1(j)gbest1) g1=p1(j,:)。 end gb1(i)=gbest1。title(TempStr)。ylabel(39。v2=v。end%初始化種全局最有位置和 最優(yōu)解g2=1000*ones(1,D)。 endendgb2=ones(1,T)。 gbest2=pbest2(j)。endplot(gb2)TempStr=sprintf(39。xlabel(39。適應(yīng)度值39。endresult=sum。 %將數(shù)據(jù)顯示為長整形科學(xué)計數(shù)%給定初始條條件N=40。 %初始化群體最迭代次數(shù)c11=2。w=。for i=1:N for j=1:D x(i,j)=randn。)。初始位置39。維39。,char(floor(j/10)+48)，char(rem(j,10)+48),39。b*39。) ylabel(39。維39。,char(floor(j/10)+48),char(rem(j,10)+48),39。%初始化個體最優(yōu)位置和最優(yōu)值p1=x1。gbest1=1000。%浸入主循環(huán)，按照公式依次迭代直到滿足精度或者迭代次數(shù)for i=1:T for j=1:N if (fitness(x1(j,:),D)pbest1(j)) p1(j,:)=x1(j,:)。 endv1(j,:)=w*v1(j,:)+c11*rand*(p1(j,:)x1(j,:))+c21*rand*(g1x1(j,:))。c1= %g ,c2=%g39。迭代次數(shù)39。)。pbest2=ones(N,1)。for i=1:N if(pbest2(i)gbest2) g2=p2(i,:)。 pbest2(j)=fitness(x2(j,:),D)。 x2(j,:)=x2(j,:)+v2(j,:)。,c12,c22)。)。b）適應(yīng)度函數(shù)%適應(yīng)度函數(shù)（）function result=fitness(x,D)sum=0。 %清除所有變量 clc。初始化群體個數(shù)D=10。 %學(xué)習(xí)因子2c12=2。 %設(shè)置精度（在已知最小值的時候用）%初始化種群個體（限定位置和速度）x=zeros(N,D)。 %隨機(jī)初始化速度 endend%顯示群位置figure(1)for j=1:D if(rem(D,2)0) subplot((D+1)/2,2,j) else subplot(D/2,2,j) end plot(x(:,j),39。粒子39。第39。 if(j9) tInfo=strcat(39。)。grid on xlabel(39。) tInfo=strcat(39。 if(j9)