This paper introduces a novel multi-strategy enhanced dung beetle optimization (MSDBO) algorithm that is designed to address several issues identified in the standard dung beetle optimization algorithm. Specifically, the MSDBO aims to enhance convergence speed, reduce susceptibility to local optima, and increase search accuracy. By incorporating three strategies: tent chaotic mapping for population initialization, the golden sinusoidal strategy for position updating, and the Lévy flight strategy for balancing exploration and exploitation, the standard dung beetle optimization algorithm is enhanced. The MSDBO algorithm is evaluated using twelve benchmark test functions and compared against five state-of-the-art algorithms. The results consistently show that MSDBO exhibits faster convergence speeds and more accurate solutions than the other algorithms across most of the test functions. In addition, MSDBO is also applied to optimize the parameters of a valve plate, including the close angle, cross angle, triangle groove sizes, and wrap angle. The optimization outcomes reveal that MSDBO effectively minimizes pressure ripples in the piston chamber, resulting in reduced flow rate fluctuations and noise emission compared to the initial design. This study highlights the potential of the MSDBO algorithm in tackling complex nonlinear engineering optimization problems.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

Many empirical and theoretical studies indicate that Brownian motion and diffusion models as its mean field counterpart provide appropriate modelling techniques for individual insect movement. However, this traditional approach has been challenged and conflicting evidence suggests that an alternative movement pattern such as Lévy walks can provide a better description. Lévy walks differ from Brownian motion since they allow for a higher frequency of large steps, resulting in a faster movement. Identification of the ‘correct’ movement model that would consistently provide the best fit for movement data is challenging and has become a highly controversial issue. In this paper, we show that this controversy may be superficial rather than real if the issue is considered in the context of trapping or, more generally, survival probabilities. In particular, we show that almost identical trap counts are reproduced for inherently different movement models (such as the Brownian motion and the Lévy walk) under certain conditions of equivalence. This apparently suggests that the whole ‘Levy or diffusion’ debate is rather senseless unless it is placed into a specific ecological context, e.g. pest monitoring programmes.

Coal is an important resource that is closely related to people’s lives and has an irreplaceable role. However, coal mine safety accidents occur from time to time in the process of working underground. To this end, this paper proposes a coal mine environmental safety early warning model to detect abnormalities and ensure worker safety in a timely manner by assessing the underground climate environment. In this paper, the support vector machine (SVM) parameters are optimized using an improved artificial hummingbird algorithm (IAHA), and its safety level is classified by combining various environmental parameters. To address the problems of insufficient global exploration capability and slow convergence of the artificial hummingbird algorithm during iterations, a strategy incorporating Tent chaos mapping and backward learning is used to initialize the population, a Levy flight strategy is introduced to improve the search capability during the guided foraging phase, and then the simplex method is introduced to replace the worst value before the end of each iteration of the algorithm. The IAHA-SVM safety warning model was established using the improved algorithm to classify and predict the safety of the coal mine environment into four classes. Finally, the performance of the IAHA algorithm and the IAHA-SVM model are simulated separately. The simulation results show that the convergence speed and the search accuracy of the IAHA algorithm are improved, and the performance of the IAHA-SVM model has a significant improvement.