In this study, we present and discuss a variant of the classical vehicle routing problem (VRP), namely the heterogeneous multitype fleet green automated guided vehicle (AGV) routing problem with time windows (HFGVRPTW) applied in the workshops of flexible manufacturing systems (FMS). Specifically, based on the analysis of AGV body structure and motion state, transport distance and energy consumption are selected as two optimization objectives. According to the characteristics and application context of the problem, this paper designs a hybrid genetic algorithm with large neighborhood search (GA-LNS) considering the farthest insertion heuristic. GA-LNS is improved by increasing the local search ability of genetic algorithm to enhance the solution optimal quality. Extensive computational experiments which are generated from Solomon’s benchmark instances and a real case of FMS are designed to evaluate and demonstrate the efficiency and effectiveness of the proposed model and algorithm. The experimental results reveal that compared with using the traditional homogeneous fleet, the heterogeneous multitype AGV fleet transportation mode has a huge energy-saving potential in workshop intralogistics.

In this study, we propose a novel improved Dung Beetle Optimizer called Environment-aware Chaotic Force-field Dung Beetle Optimizer (ECFDBO). To address DBO’s existing tendency toward premature convergence and insufficient precision in high-dimensional, complex search spaces, ECFDBO integrates three key improvements: a chaotic perturbation-based nonlinear contraction strategy, an intelligent boundary-handling mechanism, and a dynamic attraction–repulsion force-field mutation. These improvements reinforce both the algorithm’s global exploration capability and its local exploitation accuracy. We conducted 30 independent runs of ECFDBO on the CEC2017 benchmark suite. Compared with seven classical and novel metaheuristic algorithms, ECFDBO achieved statistically significant improvements in multiple performance metrics. Moreover, by varying problem dimensionality, we demonstrated its robust global optimization capability for increasingly challenging tasks. We further conducted the Wilcoxon and Friedman tests to assess the significance of performance differences of the algorithms and to establish an overall ranking. Finally, ECFDBO was applied to a 3D path planning simulation in UAVs for safe path planning in complex environments. Against both the Dung Beetle Optimizer and a multi-strategy DBO (GODBO) algorithm, ECFDBO met the global optimality requirements for cooperative UAV planning and showed strong potential for high-dimensional global optimization applications.

In this study, we present and discuss a variant of the classic vehicle routing problem (VRP), the green automated guided vehicle (AGV) routing problem, which involves simultaneous pickup and delivery with time windows (GVRPSPDTW) in an intelligent workshop. The research object is AGV energy consumption. First, we conduct a comprehensive analysis of the mechanical forces present during AGV transportation and evaluate the overall operational efficiency of the workshop. Then, we construct a green vehicle path planning model to minimize the energy consumption during AGV transportation and the standby period. Hence, the problems considered in this study are modeled based on asymmetry, making the problem solving more complex. We also design a hybrid differential evolution algorithm based on large neighborhood search (DE-LNS) to increase the local search ability of the algorithm. To enhance the optimal quality of solutions, we design an adaptive scaling factor and use the squirrel migration operator to optimize the population. Last, extensive computational experiments, which are generated from the VRPSPDTW instances set and a real case of an intelligent workshop, are designed to evaluate and demonstrate the efficiency and effectiveness of the proposed model and algorithm. The experimental results show that DE-LNS yields competitive results, compared to advanced heuristic algorithms. The effectiveness and applicability of the proposed algorithm are verified. Additionally, the proposed model demonstrates significant energy-saving potential in workshop logistics. It can optimize energy consumption by 15.3% compared with the traditional VRPSPDTW model. Consequently, the model proposed in this research carries substantial implications for minimizing total energy consumption costs and exhibits promising prospects for real-world application in intelligent workshops.

Two-sided assembly lines are designed to produce large and complex products, where workers can perform on both sides at the same time. This paper establishes a mathematical model for the multi-objective two-sided assembly line balancing problems with additional constraints (MOATALBP). The model considers both workers skills and the balance of the assembly line, aiming to maximize efficiency and minimize workers cost and smoothness index. A harmony search algorithm (HS) based on Pareto entropy (PE-MHS) is proposed to solve MOATALBP. The difference entropy of Pareto solutions is employed to adjust the algorithm parameters to enhance the optimization ability of PE-MHS. Moreover, a fine-tuning operation combining insertion and inverse sequence is utilized to avoid the algorithm from falling into local optima. Ultimately, non-dominated sorting ensures a set of well-distributed Pareto solutions. The experimental results of different problems indicate that the proposed algorithm can achieve better solutions than three classical algorithms (NSGAII, SPEA2 and HS) for the MOATALBP.

Multi-UAV three-dimensional (3D) path planning is formulated as a high-dimensional multi-constraint optimization problem involving costs such as path length, flight altitude, avoidance cost, and smoothness. To address this challenge, we propose an Adaptive Strategy Hybrid Secretary Bird Optimization Algorithm (ASHSBOA), an enhanced variant of the Secretary Bird Optimization Algorithm (SBOA). ASHSBOA integrates a weighted multi-direction dynamic learning strategy, an adaptive strategy-selection mechanism, and a hybrid elite-guided boundary-repair scheme to enhance the ability to identify local optima and balance exploration and exploitation. The algorithm is tested on benchmark suites CEC-2017 and CEC-2022 against nine classic or state-of-the-art optimizers. Non-parametric tests show that ASHSBOA consistently achieves superior performance and ranks first among competitors. Finally, we applied ASHSBOA to a multi-UAV 3D path planning model. In Scenario 1, the path cost planned by ASHSBOA decreased by 124.9 compared to the second-ranked QHSBOA. In the more complex Scenario 2, this figure reached 1137.9. Simulation results demonstrate that ASHSBOA produces lower-cost flight paths and more stable convergence behavior compared to comparative methods. These results validate the robustness and practicality of ASHSBOA in UAV path planning.

With the increasing application of unmanned aerial vehicle (UAV) in multiple fields, the path planning problem has become a key challenge in the optimization domain. This paper proposes an Improved Artificial Lemming Algorithm (IALA), which incorporates three strategies: the optimal information retention strategy based on individual historical memory, the hybrid search strategy based on differential evolution operators, and the local refined search strategy based on directed neighborhood perturbation. These strategies are designed to enhance the algorithm’s global exploration and local exploitation capabilities in tackling complex optimization problems. Subsequently, comparative experiments are conducted on the CEC2017 benchmark suite across three dimensions (30D, 50D, and 100D) against eight state-of-the-art algorithms proposed in recent years, including SBOA and DBO. The results demonstrate that IALA achieves superior performance across multiple metrics, ranking first in both the Wilcoxon rank-sum test and the Friedman ranking test. Analyses of convergence curves and data distributions further verify its excellent optimization performance and robustness. Finally, IALA and the comparative algorithms are applied to eight 3D UAV path planning scenarios and two amphibious UAV path planning models. In the independent repeated experiments across the eight scenarios, IALA attains the optimal performance 13 times in terms of the two metrics, Mean and Std. It also ranks first in the Monte Carlo experiments for the two amphibious UAV path planning models.