Dynamic Double Subgroups Cooperative Fruit Fly Optimization Algorithm
Han Jun · 2013
In order to overcome the demerits of basic Fruit Fly Optimization Algorithm(FOA),such as low convergence precision and easily relapsing into local optimum,a dynamic double subgroup cooperative Fruit Fly Optimization Algorithm(DDSCFOA) is presented.Firstly,the whole group is dynamically divided into advanced subgroup and backward subgroup according to its own evolutionary level.Secondly,a finely local searching is made for advanced subgroup in the neighborhood of local optimum with Chaos algorithm,and a global search with FOA is made for backward subgroup,so that the whole group keeps in good balance between the global searching ability and local searching ability.Finally,two subgroups exchange information by updating the overall optimum and recombining the subgroups.DDSCFOA can jump out of local optimum and avoid falling into local optimum.The experimental results show that the strategy of dynamic double subgroup cooperative evolution is effective and feasible,DDSCFOA is much better than basic FOA in convergence velocity and convergence precision.