Coordinating metaheuristic agents with swarm intelligence

被引:40
作者
Aydin, Mehmet Emin [1 ]
机构
[1] Univ Bedfordshire, Dept Comp Sci & Technol, Luton, Beds, England
关键词
Metaheuristic agents; Swarm intelligence; Particle swarm optimization; Simulated annealing; VARIABLE NEIGHBORHOOD SEARCH; OPTIMIZATION ALGORITHM;
D O I
10.1007/s10845-010-0435-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Coordination of multi agent systems remains as a problem since there is no prominent method suggests any universal solution. Metaheuristic agents are specific implementations of multi-agent systems, which imposes working together to solve optimisation problems using metaheuristic algorithms. An idea for coordinating metaheuristic agents borrowed from swarm intelligence is introduced in this paper. This swarm intelligence-based coordination framework has been implemented as swarms of simulated annealing agents collaborated with particle swarm optimization for multidimensional knapsack problem. A comparative performance analysis is also reported highlighting that the implementation has produced much better results than the previous works.
引用
收藏
页码:991 / 999
页数:9
相关论文
共 25 条
[1]  
Aydin M. E, 2008, P IMS 2008 14 16 OCT
[2]   A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems [J].
Aydin, ME ;
Fogarty, TC .
JOURNAL OF HEURISTICS, 2004, 10 (03) :269-292
[3]  
Aydin ME, 2007, LECT NOTES ARTIF INT, V4659, P185
[4]  
Beasley J. E, 1990, J GLOBAL OPTIMISATIO, V8, P429
[5]   Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem [J].
Chen A.-L. ;
Yang G.-K. ;
Wu Z.-M. .
Journal of Zhejiang University-SCIENCE A, 2006, 7 (4) :607-614
[6]  
Colorni A., 1994, JORBEL-Belgian J. Oper. Res. Stat. Comput. Sci, V34, P39
[7]  
Dong CJ, 2006, INT J COMPUT SCI NET, V6, P152
[8]  
Farooq M., 2008, Bee-Inspired Protocol Engineering: From Nature to Networks
[9]  
Hammami M, 2005, LECT NOTES ARTIF INT, V3684, P647
[10]   Variable neighborhood search for the maximum clique [J].
Hansen, P ;
Mladenovic, N ;
Urosevic, D .
DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) :117-125