Bioinspired Bare Bones Mayfly Algorithm for Large-Scale Spherical Minimum Spanning Tree.

Tian Zhang,Qifang Luo,Wu Deng,Guo Zhou,Yongquan Zhou

doi:10.3389/fbioe.2022.830037

Abstract

Mayfly algorithm (MA) is a bioinspired algorithm based on population proposed in recent years and has been applied to many engineering problems successfully. However, it has too many parameters, which makes it difficult to set and adjust a set of appropriate parameters for different problems. In order to avoid adjusting parameters, a bioinspired bare bones mayfly algorithm (BBMA) is proposed. The BBMA adopts Gaussian distribution and Lévy flight, which improves the convergence speed and accuracy of the algorithm and makes better exploration and exploitation of the search region. The minimum spanning tree (MST) problem is a classic combinatorial optimization problem. This study provides a mathematical model for solving a variant of the MST problem, in which all points and solutions are on a sphere. Finally, the BBMA is used to solve the large-scale spherical MST problems. By comparing and analyzing the results of BBMA and other swarm intelligence algorithms in sixteen scales, the experimental results illustrate that the proposed algorithm is superior to other algorithms for the MST problems on a sphere.

Highlights

Tree is a connected graph with simple structure which contains no loops and widely applied in graph theory (Diestel, 2000)
Handling Cross-Border Mayflies In the early stage of population evolution, the distance between the historical optimal position and the global optimal position of different individuals is far away, and the standard deviation σ of Gaussian distribution used for updating positions is relatively large, resulting in a greater opportunity for the new position to cross the boundary of the search space
A large number of cases with different number of points are used to test the ability of bare bones mayfly algorithm (BBMA) in solving minimum spanning tree (MST) problems

Summary

INTRODUCTION

Tree is a connected graph with simple structure which contains no loops and widely applied in graph theory (Diestel, 2000). The minimum spanning tree (MST) problem is a practical, wellknown, and widely studied problem in the field of combinatorial optimization (Graham and Hell, 1985). This problem has a long history, which was first put forward by Borüvka in 1926. Bi and Zhou have applied the improved artificial electric field algorithm to the spherical MST problem (Bi et al, 2021). To obtain a group of more perfect minimum spanning trees or subminimum spanning trees on a sphere in finite time, a bare bones mayfly algorithm (BBMA) is proposed to solve spherical MST problems.

RELATED WORK

EXPERIMENTAL RESULTS AND DISCUSSION

Experimental Setup

CONCLUSION AND FUTURE WORK

DATA AVAILABILITY STATEMENT