声振论坛

 找回密码
 我要加入

QQ登录

只需一步,快速开始

查看: 6982|回复: 6

[经典算法] 请问粒子群优化算法里的适应度函数怎么写?

[复制链接]
发表于 2007-3-15 10:50 | 显示全部楼层 |阅读模式

马上注册,结交更多好友,享用更多功能,让你轻松玩转社区。

您需要 登录 才可以下载或查看,没有账号?我要加入

x
用matlab编m文件的粒子群算法,适应度函数怎么写?
回复
分享到:

使用道具 举报

发表于 2007-3-20 07:29 | 显示全部楼层
PSO TOOLBOX?
 楼主| 发表于 2007-4-11 10:45 | 显示全部楼层
matlab里有PSO toolbox?请问编完程序之后怎么去优化搭好的SIMULINK模型参数?怎么结合?
发表于 2007-4-12 15:42 | 显示全部楼层
原帖由 faith824206 于 2007-4-11 10:45 发表
matlab里有PSO toolbox?请问编完程序之后怎么去优化搭好的SIMULINK模型参数?怎么结合?


pos toolbox不是matlab自带的,你可以到下面的网站获取
http://psotoolbox.sourceforge.net/

至于如何和simulink混用,个人就不了解了,没用过simulink
发表于 2007-4-12 15:44 | 显示全部楼层
另外,最近在http://www.csdn.net/发现了关于粒子群算法资源的合辑,转过来希望对大家有所帮助,以下为原贴内容
0.Books and dissertations:
Kennedy, J., Eberhart, R. C., and Shi, Y., Swarm intelligence San Francisco: M
organ Kaufmann Publishers, 2001. (PSO的founders所著)

van den Bergh, Frans, "An analysis of particle swarm optimizers." PhD's Disser
tation Department of Computer Science, University of Pretoria, South Africa, 2
002.  (Dr.Bergh的博士论文,详尽的给出了他对PSO的分析和改进,建议通读)


1.Papers
1)原始论文:
Kennedy J,Eberhart R C. Particle Swarm Optimization [C]. Proceedings of IEEE I
nternational Conference on Neural Networks, Perth, Australia, 1995.1942-1948.


R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,”
in Proc. 6th Int. Symp. Micromachine Human Sci., Nagoya,Japan, 1995

2)理论基础:
Clerc, M. and Kennedy, J., "The particle swarm-explosion, stability, and conve
rgence in a multidimensional complex space," IEEE Transactions on Evolutionary
Computation, vol. 6, no. 1, pp. 58-73, 2002. (较完整的给出了PSO的收敛性,并发现
使用压缩因子可以保证收敛,04年IEEE Trans. EVC Best paper award,必读)

Ozcan, E. and Mohan, C. K. Particle swarm optimization: surfing the waves. Pro
ceedings of the IEEE Congress on Evolutionary Computation (CEC 1999), Washingt
on, DC, USA. 1999

Trelea, I. C., "The particle swarm optimization algorithm: convergence analysi
s and parameter selection," Information Processing Letters, vol. 85, no. 6, pp
. 317-325, Mar.2003.  (另一个较小的收敛分析)

3)参数设置:
Shi, Y. and Eberhart, R. C. Parameter selection in particle swarm optimization
. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference o
n Evolutionary Programming, New York. pp. 591-600, 1998

Shi, Y. and Eberhart, R. C. Empirical study of particle swarm optimization. Pr
oceedings of the IEEE Congress on Evolutionary Computation (CEC 1999), Piscata
way, NJ. pp. 1945-1950, 1999  (主要是对惯性权重的试验)

Carlisle, A. and Dozier, G. An off-the-shelf PSO. Proceedings of the Workshop
on Particle Swarm Optimization 2001, Indianapolis, IN. 2001 (各个参数设置的比较
,必读)

4)综述:
Eberhart, R. C. and Shi, Y. Comparison between genetic algorithms and particle
swarm optimization. Evolutionary Programming VII: Proceedings of the Seventh
Annual Conference on Evolutionary Programming, San Diego, CA. 1998  (GA与PSO比
较)

Eberhart, R. C. and Shi, Y. Particle swarm optimization: developments, applica
tions and resources. Proceedings of the IEEE Congress on Evolutionary Computat
ion (CEC 2001), Seoul, Korea. 2001

Parsopoulos, K. E. and Vrahatis, M. N., "Recent approaches to global optimizat
ion problems through particle swarm optimization," Natural Computing, vol. 1,
no. 2-3, pp. 235-306, 2002. (很长的综述,但是比较偏重作者自己提出的几个改进,呵呵
)

5)应用:
Ismail, A. and Engelbrecht, A. P. Training Product Units in Feedforward Neural
Networks using Particle Swarm Optimization. Proceedings of the International
Conference on Artificial Intelligence, Durban, South Africa. pp. 36-40, 1999


van den Bergh, F. and Engelbrecht, A. P., "Cooperative learning in neural netw
orks using particle swarm optimizers," South African Computer Journal, vol. 26
pp. 84-90, 2000.

L. Messerschmidt and A. P. Engelbrecht, “Learning to play games using a PSO-b
ased competitive learning approach,” IEEE Trans. Evol.Comput., vol. 8, pp. 28
0–288, Jun. 2004.

Settles, M. and Rylander, B. Neural network learning using particle swarm opti
mizers. Advances in Information Science and Soft Computing, pp. 224-226, 2002


Tillett, J. C., Rao, R., Sahin, F., and Rao, T. M. Cluster-head identification
in ad hoc sensor networks using particle swarm optimization. Proceedings of 2
002 IEEE International Conference on Personal Wireless Communications, pp. 201
-205, 2002

Coello Coello, C. A., Luna, E. H. n., and Aguirre, A. H. n. Use of particle sw
arm optimization to design combinational logic circuits. Lecture Notes in Comp
uter Science(LNCS) No. 2606, pp. 398-409, 2003

# Tillett, J. C., Rao, R. M., Sahin, F., and Rao, T. M. Particle swarm optimiz
ation for the clustering of wireless sensors. Procedings of SPIE Vol. 5100: Di
gital Wireless Communications V, pp. 73-83, 2003


6)改进与分析_离散域拓展及组合优化:
Kennedy, J. and Eberhart, R. C. A discrete binary version of the particle swar
m algorithm. Proceedings of the World Multiconference on Systemics,Cybernetics
and Informatics 1997, Piscataway, NJ. pp. 4104-4109, 1997  (最早的离散PSO,非常
聪明的改进,值得一看)

Mohan, C. K. and Al-kazemi, B. Discrete particle swarm optimization. Proceedin
gs of the Workshop on Particle Swarm Optimization 2001, Indianapolis, IN. 2001


Laskari, E. C., Parsopoulos, K. E., and Vrahatis, M. N. Particle swarm optimiz
ation for integer programming. Proceedings of the IEEE Congress on Evolutionar
y Computation (CEC 2002), Honolulu, Hawaii USA. 2002 (PSO for 整数规划)

Schoofs, L. and Naudts, B. Swarm intelligence on the binary constraint satisfa
ction problem. Proceedings of the IEEE Congress on Evolutionary Computation (C
EC 2002), Honolulu, Hawaii USA. 2002

Wang, K.-P., Huang, L., Zhou, C.-G., and Pang, W. Particle swarm optimization
for traveling salesman problem. Proceedings of International Conference on Mac
hine Learning and Cybernetics 2003, pp. 1583-1585, 2003  (引入几个新算子,解决T
SP问题)

Clerc, M., "Discrete Particle Swarm Optimization," New Optimization Techniques
in Engineering Springer-Verlag, 2004. (Clerc大拿的DPSO,同样引入了新算子)

7)改进与分析_参数:
Shi, Y. and Eberhart, R. C. A modified particle swarm optimizer. Proceedings o
f the IEEE Congress on Evolutionary Computation (CEC 1998), Piscataway, NJ. pp
. 69-73, 1998  (惯性权重在此文中提出)

Clerc, M. The swarm and the queen: towards a deterministic and adaptive partic
le swarm optimization. Proceedings of the IEEE Congress on Evolutionary Comput
ation (CEC 1999), pp. 1951-1957, 1999  (提出了queen的思想,里面还有个重力场,比较
有意思)

Eberhart, R. C. and Shi, Y. Comparing inertia weigthts and constriction factor
s in particle swarm optimization. Proceedings of the IEEE Congress on Evolutio
nary Computation (CEC 2000), San Diego, CA. pp. 84-88, 2000 (惯性权重与压缩因子
)

Shi, Y. and Eberhart, R. C. Particle swarm optimization with fuzzy adaptive in
erita weight. Proceedings of the Workshop on Particle Swarm Optimization 2001,
Indianapolis, IN. 2001  (为适应动态环境,提出模糊惯性权重)

A. Ratnaweera, S. Halgamuge, and H. Watson, “Self-organizing hierarchical par
ticle swarm optimizer with time varying accelerating coefficients,”IEEE Trans
. Evol. Comput., vol. 8, pp. 240–255, Jun. 2004. (对几个参数做了拓展以及非常详
尽的分析)

8)改进与分析_粒子拓扑方向:
# Kennedy, J. Small worlds and mega-minds: effects of neighborhood topology on
particle swarm performance. Proceedings of IEEE Congress on Evolutionary Comp
utation (CEC 1999), Piscataway, NJ. pp. 1931-1938, 1999  (小世界拓扑对结果的影
响)

Suganthan, P. N. Particle swarm optimiser with neighbourhood operator. Proceed
ings of the IEEE Congress on Evolutionary Computation (CEC 1999), Piscataway,
NJ. pp. 1958-1962, 1999  (引入领域算子)

Kennedy, J. Stereotyping: improving particle swarm performance with cluster an
alysis. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2000
), San Diego, CA. pp. 1507-1512, 2000

Kennedy, J. and Mendes, R. Population structure and particle swarm performance
. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), Hon
olulu, Hawaii USA. 2002

Krink, T., Vesterstroem, J. S., and Riget, J. Particle swarm optimisation with
spatial particle extension. Proceedings of the IEEE Congress on Evolutionary
Computation (CEC 2002), Honolulu, Hawaii USA. 2002

Janson, S. and Middendorf, M. A hierarchical particle swarm optimizer. Proceed
ings of IEEE Congress on Evolutionary Computation 2003 (CEC 2003), Canbella, A
ustralia. pp. 770-776, 2003  (使粒子动态的按照树型排列)

Kennedy, J. and Mendes, R. Neighborhood topologies in fully-informed and best-
of-neighborhood particle swarms. Proceedings of the 2003 IEEE International Wo
rkshop on Soft Computing in Industrial Applications 2003 (SMCia/03), pp. 45-50
, 2003

R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: Simp
ler, maybe better,” IEEE Trans. Evol. Comput., vol. 8, pp. 204–210, Jun. 200
4.  (重要的FIPs模型,所有粒子的信息用来更新一个粒子的信息)

9)改进与分析_多样性提升方向:

Blackwell, T. M. and Bentley, P. J. Don't push me! collision-avoiding swarms.
Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), Honol
ulu, Hawaii USA. 2002

Riget, J. and Vesterstroem, J. S. A diversity-guided particle swarm optimizer
- the ARPSO. Technical Report No. 2002-02. 2002. Dept. of Computer Science, Un
iversity of Aarhus, EVALife.

Peram, T., Veeramachaneni, K., and Mohan, C. K. Fitness-distance-ratio based p
article swarm optimization. Proceedings of the IEEE Swarm Intelligence Symposi
um 2003 (SIS 2003), Indianapolis, Indiana, USA. pp. 174-181, 2003

comments:很多其他类里的paper都可以规类到这来.

10)改进与分析_结合其他算法思想方向:
Angeline, P. J. Using selection to improve particle swarm optimization. Procee
dings of the IEEE Congress on Evolutionary Computation (CEC 1998), Anchorage,
Alaska, USA. 1998  (借鉴GA里的选择优秀染色体思想)

L?vbjerg, M., Rasmussen, T. K., and Krink, T. Hybrid particle swarm optimiser
with breeding and subpopulations. Proceedings of the Genetic and Evolutionary
Computation Conference 2001 (GECCO 2001), 2001

# Higashi, N. and Iba, H. Particle swarm optimization with gaussian mutation.
Proceedings of the IEEE Swarm Intelligence Symposium 2003 (SIS 2003), Indianap
olis, Indiana, USA. pp. 72-79, 2003  (同样也是GA里的思想)

Y.X.Wang, Z.D.Zhao, R.Ren. Hybrid Particle swarm optimizer with tabu strategy.
In submission. (禁忌搜索的思想)

# Juang, C.-F., "A hybrid of genetic algorithm and particle swarm optimization
for recurrent network design," IEEE Transactions on Systems, Man, and Cuberne
tics - Part B: Cybernetics, vol. accepted 2003.

SHi, X., Lu, Y., Zhou, C., Lee, H., Lin, W., and Liang, Y. Hybrid evolutionary
algorithms based on PSO and GA. Proceedings of IEEE Congress on Evolutionary
Computation 2003 (CEC 2003), Canbella, Australia. pp. 2393-2399, 2003

Stacey, A., Jancic, M., and Grundy, I. Particle swarm optimization with mutati
on. Proceedings of IEEE Congress on Evolutionary Computation 2003 (CEC 2003),
Canbella, Australia. pp. 1425-1430, 2003  (GA also)

11)改进与分析_其他
K. E. Parsopoulos, V. P. Plagianakos, G. D. Magoulas, and M. N. Vrahatis, “St
retching technique for obtaining global minimizers through particle swarm opti
mization,” in Proc. Particle Swarm Optimization Workshop, Indianapolis, IN, 2
001, pp. 22–29.(对目标函数的变换)

K.E. Parsopoulos, M.N. Vrahatis, On the computation of all global minimizers t
hrough particle swarm optimization. IEEE Trans. on Evolutionary Computation, 2
004,8(3):211-224. (上文的拓展,可以检测多全局最优,如Nash均衡点)

—, “UPSO—A unified particle swarm optimization scheme,” in Lecture Series
on Computational Sciences, 2004, pp. 868–873. (将全局拓扑和局部拓扑结合)

Al-kazemi, B. and Mohan, C. K. Multi-phase generalization of the particle swar
m optimization algorithm. Proceedings of the IEEE Congress on Evolutionary Com
putation (CEC 2002), Honolulu, Hawaii USA. 2002  (搜索方向改进)

Xie, X., Zhang, W., and Yang, Z. A dissipative particle swarm optimization. Pr
oceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolul
u, Hawaii USA. 2002  (类比为耗散系统,加入负熵使系统脱离平衡态)

Van den Bergh F, Engelbrecht A P. A Cooperative Approach to Particle Swarm Opt
imization [J]. IEEE Transaction on Evolutionary Computation,2004, 8(3):225-239
.
(多粒子群协同优化)

J. J. Liang, A. K. Qin, P. N. Suganthan and S. Baskar, "Comprehensive Learning
Particle Swarm Optimizer for Global Optimization of Multimodal Functions", IE
EE Trans. on Evolutionary Computation, Vol. 10, No. 3, pp. 281-295, June 2006.
  (新的粒子搜索及合作策略)
------------------------------------------------------------------------------
----------------------------
comments:PSO的应用以及改进方向并不止我列出的这些,比如多目标优化这里就没有给出.
但这些paper已经足够入门了,各位如有兴趣可以自己搜索.04年之前一个比较全的bibliog
raphy在http://www.swarmintelligence.org/bibliography.php可以找到,大约300多篇.



2.Websites:
------------------------------------------------------------------------------
-----------
comments:这三个网站关于PSO的资源非常丰富.第3个是clerc大拿的,里面更偏重对算法数
学上的分析.


3.Leading Journals and Confs:
Evolutionary Computation (MIT press)
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Neural Network
IEEE Transactions on Systems, Man, and Cubernetics Part:A,B

Genetic and Evolutionary Computation Conference (GECCO, ACM SIGEVO)
IEEE Congress on Evolutionary Computation(CEC)
Parallel Problem Solving from Nature (PPSN)


4.Homepages

------------------------------------------------------------------------------
-----------
comments:上面是我常去的一些page,主要的PSO学者在http://www.particleswarm.info/p
eople.html上可以找到


5.Benchmarks
files/Page364.htm
6.html

J. G. DIGALAKIS and K. G. MARGARITIS. ON BENCHMARKING FUNCTIONS OR GENETIC ALG
ORITHMS. Inter J Computer Math., Vol. 00, pp. 1-27 (给出了大多数标准无约束测试
函数的性态分析)
------------------------------------------------------------------------------
-----------
Comments:改进或提出一个优化算法需要对其作出性能评测,这里提供一些标准的测试集,包
括DeJong系列函数,Rastrigin系列函数等,以及其他有约束,离散,组合优化标准测试问题.

最近Prof.Suganthan等提出了一套Composition functions,具体参见他的homepage,同样C
EC05上也提出了大约30个测试函数.对这些函数进行rotate,shift,distortion等操作可以
变换为更复杂的函数,具体请参加相关paper.


6.code/software/projects/implementations
e的参与, 重视学科交叉)

(pso matlab toolbox)
ftp://www.china2china.com/ user:pso, passwd:pso   (一些paper可以在这里直接下载
)
------------------------------------------------------------------------------
-----------
comments:各位如果需要几个重要PSO改进的matlab实现,请联系prof.suganthan或直接发邮
件给我.


7.Future work
2004 年IEEE Transactions on Evolutionary Computation出版了Special issue on PSO
,卷首语中指出了当前研究的几个主要方向及热点:
(1) 算法分析. PSO在实际应用中被证明是有效的, 但目前还没有给出完整收敛性、收敛速
度估计等方面的数学证明,已有的工作还远远不够。
(2) 粒子群拓扑结构.不同的粒子群邻居拓扑结构是对不同类型社会的模拟,研究不同拓扑
结构的适用范围,对PSO算法推广和使用有重要意义。
(3) 参数选择与优化.参数w、φ1、φ2的选择分别关系粒子速度的3个部分:惯性部分、社
会部分和感知部分在搜索中的作用.如何选择、优化和调整参数,使得算法既能避免早熟又
能比较快速地收敛,对工程实践有着重要意义.
(4) 与其他演化计算的融合.如何将其它演化的优点和PSO的优点相结合,构造出新的混合算
法是当前算法改进的一个重要方向.
(5) 算法应用.算法的有效性必须在应用中才能体现,广泛地开拓PSO的应用领域,也对深化
研究PSO算法非常有意义.

我在以前的帖子里曾经提到过,PSO是很适合演化计算方向入门的.特别是其算法实现非常简
单,因此建议大家能够先实现基础算法.如果想进一步了解乃至研究,上面列出的除了应用的
几十篇paper基本都是需要看的.PSO从提出到现在已经11年了,大小坑挖的也不少了,各位如
果想在这个领域出新,出好结果,还是需要有一定功力的.对于我们目前的情况,我认为大家
可以主要将精力集中在第(5)点.http://www.particleswarm.info/Problems.html也列出了
一些有意思的open problems,当然,都是有一定难度的 :-)

对于PSO的改进与分析,如何有能力的话,我仍然坚持认为一个突破口是学科交叉,比如粒子
搜索的混沌行为,粒子进化以及合作策略中的博弈,统计物理学在群智能中的应用等等.这也
是我接下来的研究内容.另外Clerc大拿网站上也有一篇经常更新的paper,"Some ideas ab
out Particle Swarm Optimisation",里面记录了很多他对PSO的理解,同样非常值得一看.


原贴地址:http://blog.csdn.net/ctrlcv/archive/2007/02/07/1504741.aspx
发表于 2011-3-4 15:48 | 显示全部楼层
学习粒子群算法的一个很好的介绍,谢谢
发表于 2011-3-27 19:55 | 显示全部楼层
我也正学习呢
您需要登录后才可以回帖 登录 | 我要加入

本版积分规则

QQ|小黑屋|Archiver|手机版|联系我们|声振论坛

GMT+8, 2024-5-23 00:15 , Processed in 0.129272 second(s), 17 queries , Gzip On.

Powered by Discuz! X3.4

Copyright © 2001-2021, Tencent Cloud.

快速回复 返回顶部 返回列表