The rapid advancement in unmanned aerial vehicle (UAV) technology has marked a transformative shift in various industries, with logistics distribution service being one of the prime sectors reaping the benefits. UAVs offer substantial benefits in speed, cost, and reach, promising to revolutionize logistics, especially in remote areas. On the one hand, they are poised to meet demands for quick and versatile delivery options. On the other hand, their deployment comes with challenges. Weather variabilities such as rainfall, wind speed, and the need for safe take‐off intervals can compromise UAV safety and operation. Conventional route optimization often overlooks these dynamic factors, resulting in inefficient or unworkable delivery routes. The repeated time‐consuming calculations are caused by repeated trials when making UAV group distribution plans. Recognizing these gaps, this study proposes a data representation to effectively transform the flight flyable area of UAVs into a time‐varying network that maintains spatiotemporal connectivity and establishes a mathematical model that represents the complexities of UAV group distribution. Then, a multistage dynamic optimization algorithm specifically tailored for large‐scale time‐varying network distribution route search is designed to obtain the stable and optimal solution. Subsequent experimental validations on actual case datasets have confirmed the correctness, effectiveness, and adaptability of the algorithm. Benchmarking against traditional CPLEX methods demonstrated that the algorithm not only rivals the best solutions but does so with a 38.8 times increase in computational speed. When pitted against the shortest path Dijkstra and A ∗ algorithms, the method consistently outperformed, delivering solutions up to 3.5 times faster in large‐scale applications. Moreover, the parameter sensitivity analysis is performed on the algorithm by adjusting the safe flight thresholds of rainfall and wind speed parameters and revealed that the performance of the algorithm has a strong positive correlation with the size of the time‐varying network.

This study identifies critical inefficiencies within a dual-channel operation model employed by a fast fashion company, particularly the independent operation of three logistics distribution systems. These systems result in high operational costs and low resource utilization, primarily due to redundant vehicle dispatches to meet the distinct demands of retail store replenishment, online customer orders, and customer return demands, as well as random and scattered return requests leading to vehicle underutilization. To address these challenges, we propose a novel integrated logistics distribution system design and management method tailored for dual-channel sales and distribution businesses. The approach consolidates the three distribution systems into one cohesive framework, thus streamlining the delivery process and reducing vehicle trips by combining retail and customer visits. An optimization algorithm is introduced to factor in inventory and distribution distance, aiming to achieve global optimization in pairing retail store inventory with online customer orders and unifying the distribution of replenishment products, online products, and returned products. The paper contributes to the field by introducing a new variation of the Vehicle Routing Problem (VRP) that arises from an integrated distribution system, combining common VRP issues with more complex challenges. A custom Branch-and-Price (B&P) algorithm is developed to efficiently find optimal routes. Furthermore, we demonstrate the benefits of the integrated system over traditional, segregated systems through real-world data analysis and assess various factors including return rates and inventory conditions. The study also enhances the model by allowing inventory transfers between retail stores, improving inventory distribution balance, and offering solutions for scenarios with critically low inventory levels. Our findings highlight a significant reduction in total operating cost savings of up to 49.9% and vehicle usage when using the integrated distribution system compared to independent two-stage and three-stage systems. The integrated approach enables the utilization of vacant vehicle space and the dynamic selection and combination of tasks, preventing unnecessary mileage and space wastage. Notably, the integration of inventory sharing among retail stores has proven to be a key factor in generating feasible solutions under tight inventory conditions and reducing operational costs and vehicle numbers, with the benefits amplified in large-scale problem instances.

In-memory caching of intermediate data and eager combining of data in shuffle buffers have been shown to be very effective in minimizing the re-computation and I/O cost in distributed data processing systems like Spark and Flink. However, it has also been widely reported that these techniques would create a large amount of long-living data objects in the heap, which may quickly saturate the garbage collector, especially when handling a large dataset, and hence would limit the scalability of the system. To eliminate this problem, we propose a lifetime-based memory management framework, which, by automatically analyzing the user-defined functions and data types, obtains the expected lifetime of the data objects, and then allocates and releases memory space accordingly to minimize the garbage collection overhead. In particular, we present Deca, a concrete implementation of our proposal on top of Spark, which transparently decomposes and groups objects with similar lifetimes into byte arrays and releases their space altogether when their lifetimes come to an end. An extensive experimental study using both synthetic and real datasets shows that, in comparing to Spark, Deca is able to 1) reduce the garbage collection time by up to 99.9%, 2) to achieve up to 22.7x speed up in terms of execution time in cases without data spilling and 41.6x speedup in cases with data spilling, and 3) to consume up to 46.6% less memory.