Affiliations: [a] School of Artificial Intelligence, Guangxi Minzu University, Nanning, China
| [b] Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Nanning, China
| [c] Deparment of Computer Science and Software Engineering, University of Wisconsin-Platteville, Platteville, WI, USA
Abstract: Optimization problems in the field of industrial engineering usually involve massive amounts of information and complex scheduling process with the characteristics of high-dimension and non-convexity, which bring many challenges to finding an optimal solution. We proposed an improved beetle swarm optimization (IBSO) algorithm demonstrating the potential to solve different problems of path planning in static environment with good performance. Firstly, the algorithm is an upgrade of the original beetle antennae search (BAS) algorithm and the search strategy is improved by replacing a single beetle by multiple beetles. Secondly, the global search ability gets enhanced, and the diversity of optimization is improved through introducing nonlinear sinusoidal disturbance with Levy flight mechanism in beetles’ position. Finally, the search performance of beetle swarm is improved by simulating the characteristics of employment bees to search for a better solution near the honey source field in the Artificial Bee Colony (ABC) algorithm. Our experiment results show that IBSO algorithm can achieve higher search efficiency and wider search ranges through well balancing the advantages of local search and fast optimization of the BAS algorithm with the global search of the improved mechanism. The IBSO algorithm has shown the potential to provide a new solution for several optimization problems in path planning in static environment.
