Biogeography-based optimization (BBO) cannot effectively solve high-dimensional global optimization problems due to its single migration mechanism and random mutation operator. To overcome these limitations, this paper propose a dual BBO based on sine cosine algorithm (SCA) and dynamic hybrid mutation, named SCBBO. Firstly, the Latin hypercube sampling method is innovatively used to improve the initial population ergodicity. Secondly, a nonlinear transformation parameter and a inertia weight adjustment factor are designed into the position update formula of SCA to make SCBBO suitable for high dimensional environments. Then, a dynamic hybrid mutation operator is designed by combining Laplacian and Gaussian mutation, which helps the algorithm to escape from local optima and balance the exploration and exploitation. Finally, the dual learning strategy is integrated, so the convergence accuracy is further improved by generating dual individuals. Meanwhile, A sequence convergence model is established to prove the algorithm can converge to the global optimal solution with probability 1. Compared with other state-of-the-art evolutionary algorithms, SCBBO effectively improves the optimization accuracy and convergence speed for high-dimensional optimization problems. To further show the superiority of SCBBO, the performance is compared on 1000, 2000, 5000 and 10000 dimensions, respectively. The comparsions show that SCBBO's optimization results on these dimensions are basically the same. SCBBO also applied to engineering design problems, and the simulation results demonstrate that the proposed method is also effective on constrained optimization problems.

No abstract

In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.

Biogeography-based optimization (BBO) is not suitable for solving high-dimensional or multi-modal problems. To improve the optimization efficiency of BBO, this study proposes a novel BBO variant, which is named ZGBBO. For the selection operator, an example learning method is designed to ensure inferior solution will not destroy the superior solution. For the migration opeartor, a convex migration is proposed to increase the convergence speed, and the probability of finding the optimal solution is increased by using opposition-based learning to generate opposite individuals. The mutation operator of BBO is deleted to eliminate the generation of poor solutions. A differential evolution with feedback mechanism is merged to improve the convergence accuracy of the algorithm for multi-modal and irregular problems. Meanwhile, the greedy selection is used to make the population always moves in the direction of a better area. Then, the global convergence of ZGBBO is proved with Markov model and sequence convergence model. Quantitative evaluations, compared with three self-variants, seven improved BBO variants and six state-of-the-art evolutionary algorithms, experimental results on 24 benchmark functions show that every improved strategy is indispensable, and the overall performance of ZGBBO is better. Besides, the complexity of ZGBBO is analyzed by comparing with BBO, and ZGBBO has less computation and lower complexity.