An Chaotic Firefly Algorithm to Solve Quadratic Assignment Problem

被引:0
|
作者
Guo, Meng-Wei [1 ]
Wang, Jie-Sheng [2 ,3 ]
Yang, Xue [1 ]
机构
[1] Univ Sci & Technol Liaoning, Sch Elect & Informat Engn, Anshan 114044, Peoples R China
[2] Univ Sci & Technol Liaoning, Sch Elect & Informat Engn, Anshan 114051, Peoples R China
[3] Univ Sci & Technol Liaoning, Natl Financial Secur & Syst Equipment Engn Res Ct, Anshan, Peoples R China
关键词
Firefly algorithm; Quadratic Assignment Problem; Chaos;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The firefly algorithm (FA) is a swarm intelligence optimization algorithm based on the glow behavior of fireflies in nature. The classic firefly algorithm has the problem that it is easy to fall into the local optimum and the search accuracy is not high in the later stage. An improved firefly algorithm based on chaos mapping strategy was proposed to solve the quadratic assignment problem (QAP). The egocentricity of chaos just avoids the firefly algorithm from falling into the local optimum, enhances its search ability and solves the convergence prematurely phenomenon of the firefly algorithm. The improved algorithm is compared with genetic algorithm (GA), particle swarm optimization (PSO) algorithm and the classic firefly algorithm to solve the same quadratic assignment problems. The simulation experiments results verify the effectiveness of the proposed algorithm.
引用
收藏
页码:337 / 342
页数:6
相关论文
共 50 条