In the production enterprises, the distributed hybrid flow-shop scheduling problems widely exist in the actual production controlling and decision, especially in the production of steel and aluminum. Considering the uncertain processing time in the actual production environment, the constraint of deteriorated variable processing time is added in some problems. In this paper, the distributed hybrid flow-shop scheduling problem with deterioration effect (DHFSP-DE) is investigated. The framework of evolutionary multitasking memetic algorithm (MTMA) is designed to address the proposed model. In the proposed method, evolutionary transfer learning is utilized to communicate between two independent DHFSP-DE solvers. The implicit knowledge of the scheduling scheme can be transferred into other solvers to guide the evolution of the population. The memetic algorithm combines a strategy of local intensification with a population-based paradigm. These strategies can capture the implicit knowledge of DHFSP-DE. This paper makes the first attempt to work on the framework of evolutionary multitasking learning for DHFSP-DE problems. The experimental results on the different instances show the effectiveness and efficiency of the proposed MTMA algorithm. Note to Practitioners —The distributed hybrid flow-shop scheduling problem with deterioration effect (DHFSP-DE) is modeled based on the production process of aluminum. The DHFSP-DE is also widely used in the production process of various industries. As the processing time of the job is varied with time, the determined scheduling problem is transformed into a scheduling problem with deterioration effect. This transformation makes the problem even more complicated. The problems are more complex than static problems because they require greater computational dimensionality for evolutionary computation, resulting in the use of computational resources. An evolutionary multitasking memetic algorithm is designed to solve DHFSP-DEs cooperatively. The solutions of the solver can be transferred to other solvers through the mapping of DHFSP-DEs. The transferred solution can affect the evolution process. The efficiency and effectiveness of the proposed MTMA are verified by the comparison experiments. In addition, the MTMA framework can be applied to other scheduling problems.

The challenge of optimizing the distribution path for location logistics in the cold chain warehousing of fresh agricultural products presents a significant research avenue in managing the logistics of agricultural products. The goal of this issue is to identify the optimal location and distribution path for warehouse centers to optimize various objectives. When deciding on the optimal location for a warehousing center, various elements like market needs, supply chain infrastructure, transport expenses, and delivery period are typically taken into account. Regarding the routes for delivery, efficient routes aim to address issues like shortening the overall driving distance, shortened travel time, and preventing traffic jams. Targeting the complex issue of optimizing the distribution path for fresh agricultural products in cold chain warehousing locations, a blend of this optimization challenge was formulated, considering factors like the maximum travel distance for new energy trucks, the load capacity of the vehicle, and the timeframe. The Location-Route Problem with Time Windows (LRPTWs) Mathematical Model thoroughly fine-tunes three key goals. These include minimizing the overall cost of distribution, reducing carbon emissions, and mitigating the depletion of fresh agricultural goods. This study introduces a complex swarm intelligence optimization algorithm (MODRL-SIA), rooted in deep reinforcement learning, as a solution to this issue. Acting as the decision-maker, the agent processes environmental conditions and chooses the optimal course of action in the pool to alter the environment and achieve environmental benefits. The MODRL-SIA algorithm merges a trained agent with a swarm intelligence algorithm, substituting the initial algorithm for decision-making processes, thereby enhancing its optimization efficiency and precision. Create a test scenario that mirrors the real situation and perform tests using the comparative algorithm. The experimental findings indicate that the suggested MODRL-SIA algorithm outperforms other algorithms in every computational instance, further confirming its efficacy in lowering overall distribution expenses, carbon emissions, and the depletion of fresh produce in the supply chain of fresh agricultural products.

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.

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.

The rapid advancement of unmanned aerial vehicle (UAV) technology has enabled the coordinated operation of multi-UAV systems, offering significant applications in agriculture, logistics, environmental monitoring, and disaster relief. In agriculture, UAVs are widely utilized for tasks such as ecological restoration, crop monitoring, and fertilization, providing efficient and cost-effective solutions for improved productivity and sustainability. This study addresses the collaborative task allocation problem for multi-UAV systems, using ecological grassland restoration as a case study. A multi-objective, multi-constraint collaborative task allocation problem (MOMCCTAP) model was developed, incorporating constraints such as UAV collaboration, task completion priorities, and maximum range restrictions. The optimization objectives include minimizing the maximum task completion time for any UAV and minimizing the total time for all UAVs. To solve this model, a deep reinforcement learning-based seagull optimization algorithm (DRL-SOA) is proposed, which integrates deep reinforcement learning with the seagull optimization algorithm (SOA) for adaptive optimization. The algorithm improves both global and local search capabilities by optimizing key phases of seagull migration, attack, and post-attack refinement. Evaluation against five advanced swarm intelligence algorithms demonstrates that the DRL-SOA outperforms the alternatives in convergence speed and solution diversity, validating its efficacy for solving the MOMCCTAP.