蚁群算法在连续空间寻优问题求解中的应用

被引:92
作者
汪镭
吴启迪
不详
机构
[1] 同济大学电子与信息工程学院
[2] 同济大学电子与信息工程学院 上海
[3] 上海
基金
国家高性能计算基金;
关键词
蚁群算法; 连续空间寻优; 信息量分布函数;
D O I
10.13195/j.cd.2003.01.45.wangl.009
中图分类号
TP301.6 [算法理论];
学科分类号
081202 ;
摘要
将蚁群算法引入连续空间的函数寻优问题求解 ,通过将传统蚁群算法中的“信息量留存”过程拓展为连续空间中的“信息量分布函数”,定义了相应的求解算法。对多极值函数和非线性连续函数的寻优实例仿真取得了良好的结果 ,显示了蚁群算法在连续空间优化问题中的应用前景。
引用
收藏
页码:45 / 48+57 +57
页数:5
相关论文
共 11 条
[1]  
Ant colony system: A cooperative learning approach to the travelling salesman problem. Dorigo M,Gambardella L M. IEEE Transactions on Computers . 1997
[2]  
Ant system: Optimization by a colony of cooperating agents. Dorigo M,Maniezzo V,Colorni A. I EEE Trans SMC: Part B . 1996
[3]  
Solving symmetric and asymmetric TSPs by ant colonies. Gambardella L M,Dorigo M. Proc IEEE Int Conf Evol Comp . 1996
[4]  
Generative policies in ant systems for scheduling. Boryczka U,Boryczka M. 6th European Congr Intell Tech Soft Comp . 1998
[5]  
Learning with delayed rewards in ant systems for the job-shop scheduling problem. Boryczka U. First Int Conf Rough Sets Current Trends Comp . 1998
[6]  
Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem. Maniezzo V,Dorigo M,Colorni A. European Journal of Operational Research . 1995
[7]  
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. Maniezzo V. Informs Journal on Computing . 1999
[8]  
Ant system applied to the quadratic assignment problem. Maniezzo V,Colorni A. IEEE Transactions on Knowledge and Data Engineering . 1999
[9]  
A new version of ant system for subset problems. Leguizamon G,Michalewicz Z. Proc Congr Evol Comp . 1999
[10]  
A clustering method using genetic algorithm and ant system. Douzono H,Hara S,Kawamoto S,et al. J oint Conf Intell Syst[C] . 1998