Introduction: Mastitis in dairy cows is a significant challenge faced by the global dairy industry, significantly affecting the quality and output of milk from dairy enterprises and causing them to suffer severe economic losses. With the increasing public concern over food safety and the rational use of antibiotics, how to identify cows at risk of disease early has become a key issue that needs to be urgently addressed. Especially subclinical mastitis, due to the lack of obvious external symptoms, makes detection more difficult, so early warning of it is particularly important.Methods: In this study, a time series prediction method, combined with machine learning techniques, was used to predict the risk of mastitis in dairy cows. The study data were obtained from the production records of 4000 dairy cows in a large farm in Hexi region of Gansu. By constructing time-series features, production indicators such as milk yield, fat rate and protein rate of each cow in two consecutive months, April and May, were utilized to predict its health status in June. To fully exploit the value of the time series features, we designed a multidimensional feature set that included raw indicator values, monthly change rates, and statistical features. After data preprocessing and sample balancing, data from 2821 cows were selected for model training. Finally, the applicability of each model was assessed by comparing and analyzing the prediction performance of six models, namely eXtreme Gradient Boosting(XGBoost), Gradient Boosting Decision Tree (GBDT), Support Vector Machine (SVM), K Nearest Neighbors (KNN), Logistic Regression, and Long Short-Term Memory Network (LSTM).Results: The XGBoost model demonstrated optimal performance, achieving an area under the ROC curve (AUC) of 0.75 with an accuracy rate of 71.36%. Feature importance analysis revealed three key temporal indicators significantly influencing prediction outcomes: May milk yield (22.29%), standard deviation of fat percentage (20.27%), and fat percentage change rate (19.87%). SHapley Additive exPlanations (SHAP) value analysis further validated the predictive value of these temporal features, providing dairy farm managers with clearly defined monitoring priorities.Discussion: The XGBoost model demonstrates strong potential as an accurate predictive tool for subclinical mastitis in dairy cows. This study presents an effective early-warning approach through time-series modeling that offers significant practical value for mastitis prevention in dairy farm management.

This paper proposes an improved Harmony Search algorithm, and gives the definition of the Global Sharing Factor of the Harmony Search (HS) algorithm. In the definition, the number of creations of the HS algorithm is applied to the sharing factor and calculated. In this algorithm, the natural harmony encoding method is used to encode the initial harmony, and the total path length of all vehicles is taken as the optimization objective function. A new harmony generation strategy is proposed as follows: each tone component in an evolution is calculated separately using the new learning strategy and update strategy. In the calculation process, the tone component is judged by whether it needs to be adjusted according to the adjustment strategy. In this way, the problems of singularity and randomness of the new harmony generation strategy of basic HS are solved to improve the diversity of algorithm solutions. Then, a new Harmony Search method with Global Sharing Factor based on natural number coding and decoding for the Vehicle Routing Problem (GSF-HS-VRP) is proposed. The improved Global Sharing Factor-Harmony Search-Vehicle Routing Problem (GSF-HS-VRP) algorithm is applied to capacity-limited vehicle path optimization problems compared with the HS, Improved Harmony Search (IHS), Global-best Harmony Search (GHS), and Self-adaptive Global Best Harmony Search (SGHS) algorithms. The small-scale data and Solomon examples were adopted as the experimental data. Compared with the other four algorithms, the GSF-HS-VRP algorithm has the shortest running time, more rapid convergence speed, and higher efficiency. In the multi-vehicle test, with the increase of the number of vehicles, the optimized path of the vehicle is more satisfied in relation to the actual needs of customers. The results showed that this method could effectively improve the optimization performance of the capacity-limited vehicle routing problem.

We propose the adaptive t-distribution spiral search Dung Beetle Optimization (TSDBO) Algorithm to address the limitations of the vanilla Dung Beetle Optimization Algorithm (DBO), such as vulnerability to local optima, weak convergence speed, and poor convergence accuracy. Specifically, we introduced an improved Tent chaotic mapping-based population initialization method to enhance the distribution quality of the initial population in the search space. Additionally, we employed a dynamic spiral search strategy during the reproduction phase and an adaptive t-distribution perturbation strategy during the foraging phase to enhance global search efficiency and the capability of escaping local optima. Experimental results demonstrate that TSDBO exhibits significant improvements in all aspects compared to other modified algorithms across 12 benchmark tests. Furthermore, we validated the practicality and reliability of TSDBO in robotic path planning applications, where it shortened the shortest path by 5.5–7.2% on a 10 × 10 grid and by 11.9–14.6% on a 20 × 20 grid.

High-dimensional biomedical data contained many irrelevant or weakly correlated features, which affected the efficiency of disease diagnosis. This manuscript presented a feature selection method for high-dimensional biomedical data based on the chemotaxis foraging-shuffled frog leaping algorithm (BF-SFLA). The performance of the BF-SFLA based feature selection method was further improved by introducing chemokine operation and balanced grouping strategies into the shuffled frog leaping algorithm, which maintained the balance between global optimization and local optimization and reduced the possibility of the algorithm falling into local optimization. To evaluate the proposed method’s effectiveness, we employed the K-NN (k-nearest Neighbor) and C4.5 decision tree classification algorithm with a comparative analysis. We compared our proposed approach with improved genetic algorithms, particle swarm optimization, and the basic shuffled frog leaping algorithm. Experimental results showed that the feature selection method based on BF-SFLA obtained a better feature subset, improved classification accuracy, and shortened classification time.

With the rapid advancement of unmanned aerial vehicle technology, the extensive application of multiple unmanned aerial vehicle systems in agriculture has led to significant innovations and benefits. Addressing the challenge of task allocation for multiple unmanned aerial vehicles, the primary objective is to minimize the total time required for unmanned aerial vehicles to return to their starting point after task completion. To tackle this issue, a mathematical model for the multi-constrained multiple unmanned aerial vehicle collaborative task allocation problem is developed. To efficiently solve this model, we propose an enhanced Seagull Optimization Algorithm, which integrates the Tent chaotic mapping strategy and the Lévy flight strategy. The Tent chaotic mapping helps the algorithm avoid becoming trapped in local optima, while the Lévy flight strategy, employed during the seagull attack phase, enhances the algorithm’s diversity and its ability to escape local optima. Additionally, the spiral coefficient is refined to balance the coordination between global and local searches. Simulation experiments demonstrate that the proposed algorithm can swiftly and effectively identify a reasonable task allocation scheme for solving the multi-constrained multi-UAV collaborative task allocation problem.

Sheep face recognition technology is critical in key areas such as individual sheep identification and behavior monitoring. Existing sheep face recognition models typically require high computational resources. When these models are deployed on mobile or embedded devices, problems such as reduced model recognition accuracy and increased recognition time arise. To address these problems, an improved Parameter Fusion Lightweight You Only Look Once (PFL-YOLO) sheep face recognition model based on YOLOv8n is proposed. In this study, the Efficient Hybrid Conv (EHConv) module is first integrated to enhance the extraction capability of the model for sheep face features. At the same time, the Residual C2f (RC2f) module is introduced to facilitate the effective fusion of multi-scale feature information and improve the information processing capability of the model; furthermore, the Efficient Spatial Pyramid Pooling Fast (ESPPF) module was used to fuse features of different scales. Finally, parameter fusion optimization work was carried out for the detection head, and the construction of the Parameter Fusion Detection (PFDetect) module was achieved, which significantly reduced the number of model parameters and computational complexity. The experimental results show that the PFL-YOLO model exhibits an excellent performance–efficiency balance in sheep face recognition tasks: mAP@50 and mAP@50:95 reach 99.5% and 87.4%, respectively, and the accuracy is close to or equal to the mainstream benchmark model. At the same time, the number of parameters is only 1.01 M, which is reduced by 45.1%, 83.7%, 66.6%, 71.4%, and 61.2% compared to YOLOv5n, YOLOv7-tiny, YOLOv8n, YOLOv9-t, and YOLO11n, respectively. The size of the model was compressed to 2.1 MB, which was reduced by 44.7%, 82.5%, 65%, 72%, and 59.6%, respectively, compared to similar lightweight models. The experimental results confirm that the PFL-YOLO model maintains high accuracy recognition performance while being lightweight and can provide a new solution for sheep face recognition models on resource-constrained devices.