Firefly algorithm with division of roles for complex optimal scheduling  

作　　者：Jia ZHAO Wenping CHEN Renbin XIAO Jun YE 

机构地区：[1]School of Information Engineering,Nanchang Institute of Technology,Nanchang 330099,China [2]Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing,Nanchang 330099,China [3]School of Artificial Intelligence and Automation,Huazhong University of Science and Technology,Wuhan 430074,China

出　　处：《Frontiers of Information Technology & Electronic Engineering》2021年第10期1311-1333,共23页信息与电子工程前沿（英文版）

基　　金：Project supported by the National Science and Technology Innovation 2030 Major Project of the Ministry of Science and Technology of China(No.2018AAA0101200);the National Natural Science Foundation of China(Nos.52069014 and 51669014);the Science Foundation for Distinguished Young Scholars of Jiangxi Province,China(No.2018ACB21029)。

摘　　要：A single strategy used in the firefly algorithm(FA)cannot effectively solve the complex optimal scheduling problem.Thus,we propose the FA with division of roles(DRFA).Herein,fireflies are divided into leaders,developers,and followers,while a learning strategy is assigned to each role:the leader chooses the greedy Cauchy mutation;the developer chooses two leaders randomly and uses the elite neighborhood search strategy for local development;the follower randomly selects two excellent particles for global exploration.To improve the efficiency of the fixed step size used in FA,a stepped variable step size strategy is proposed to meet different requirements of the algorithm for the step size at different stages.Role division can balance the development and exploration ability of the algorithm.The use of multiple strategies can greatly improve the versatility of the algorithm for complex optimization problems.The optimal performance of the proposed algorithm has been verified by three sets of test functions and a simulation of optimal scheduling of cascade reservoirs.

关 键 词：Firefly algorithm(FA) Division of roles Cauchy mutation Elite neighborhood search Optimal scheduling 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]