SearcharxivSearch

arXiv · 2609.19048

Integrated Optimization of Automated Warehouse Operations and Last-Mile Transport for Differentiated On-Demand Delivery

Abstract

In the context of differentiated on-demand goods delivery services, this study proposes an integrated optimization method for automated guided vehicles (AGVs) based smart warehouse operations and the last-mile multi-modal transport. A deep reinforcement learning algorithm for multi-objective joint scheduling is designed to establish a dynamic connection between two systems, solving key challenges such as achieving high-throughput continuous order scheduling, meeting competing requirements, and improving the overall system sensitivity and adaptability. For warehouse optimization within this framework, we propose an improved algorithm based on multi-objective, Multi-Reward Machines-A* Guided Deep Q-Network (MORM-AGDQN), which combines service level, system cost, and external transportation demand. For external optimization, we propose an improved algorithm based on a Multi-Reward, Multi Head attention-Heterogeneous Capacity Vehicle Routing Problem (MRMH-HCVRP) framework, which incorporates the optimized scheduling order sequence and grouping, combined with customer location, demand, and priority, vehicle capacity, speed, and service range. The results show that the proposed framework significantly outperforms traditional methods, achieving 100% on-time delivery rate for warehousing operations. After joint optimization, the average delivery time for the last mile was reduced by 29.3% to 53.2%, the total transportation distance was reduced by 46.4%, the high-priority service rate was increased to over 92%, and a balance was maintained between operating costs and customer satisfaction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaozhu Sun, Bilal Farooq. 2026-07-21. Integrated Optimization of Automated Warehouse Operations and Last-Mile Transport for Differentiated On-Demand Delivery. https://arxiv.org/abs/2609.19048

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG