A binary logical operation algorithm for solving the 0-1 programming problem

Based on population and logical operation, a binary logical operation algorithm is proposed to solve the 0-1 programming problem. Introduce the uniform initialization operator to improve the survival rate and diversity of the population and avoid premature death; Introduce logical operations and construct the model of retention probability and decay coefficient, and intro-duce dynamic update operators to adaptively balance the ability of exploration and exploitation. In order to verify the effectiveness of the algorithm, the convergence of the algorithm is analyzed based on the martingale method, and the classical 0-1 knapsack problem public data set is selected and divided into two groups of experimental data sets of different sizes. The BLOA algorithm is compared with genetic algorithm, particle swarm optimization algorithm, binary flying eagle algorithm and other algorithms. The experimental results show that the time cost of the BLOA algorithm is reduced by 90.36%, and the average accuracy of the solution is improved by 15.59%. Finally, through the ablation experiment, the effectiveness of the uniform initialization operator generation algorithm and the dynamic adjustment update operator strategy designed by BLOA is verified.