Firefly algorithm with neighborhood attraction

详细信息    查看全文

• 作者：Hui Wang ; ^a ; ^b ; ^{huiwang@whu.edu.cn} ; Wenjun Wang^c ; ^{wangwenjun881@126.com} ; Xinyu Zhou^d ; ^{xyzhou@jxnu.edu.cn} ; Hui Sun^a ; ^b ; ^{sun_hui2006@163.com} ; Jia Zhao^a ; ^b ; ^{zhaojia925@163.com} ; Xiang Yu^a ; ^b ; ^xyuac@ust.hk ; Zhihua Cui^e ; ^{zhihuacui@gmail.com}
• 关键词：Firefly algorithm (FA) ; Attraction ; Neighborhood attraction ; Random attraction ; Optimization
• 刊名：Information Sciences
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：382-383
• 期：Complete
• 页码：374-387
• 全文大小：1019 K
• 卷排序：382

文摘

The search of FA is determined by the attractions among fireflies. Too many attractions may result in the oscillations of search and high complexity. A neighborhood attraction model is proposed in this paper. The proposed approach can effectively improve the performance of FA.