Warehouse storage and retrieval optimization via clustering, dynamic systems modeling, and GPU-accelerated routing
Preprint
Abstract
This paper introduces a warehouse optimization procedure aimed at enhancing the efficiency of product storage and retrieval. By representing product locations and order flows within a time-evolving graph structure, we employ unsupervised clustering to define and refine compact order regions, effectively reducing picking distances. We describe the procedure using a dynamic mathematical model formulated using tools from random dynamical systems theory, enabling a principled analysis of the system's behavior over time even under random operational variations. For routing within this framework, we implement a parallelized Bellman-Ford algorithm, utilizing GPU acceleration to evaluate path segments efficiently. To address scalability challenges inherent in large routing graphs, we introduce a segmentation strategy that preserves performance while maintaining tractable memory requirements. Our results demonstrate significant improvements in both operational efficiency and computational feasibility for large-scale warehouse environments.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Algorithm for Robotic Picking in Amazon Fulfillment Centers Enables Humans and Robots to Work Together EffectivelyINFORMS Journal on Applied Analytics, 2023
- Alibaba Vehicle Routing Algorithms Enable Rapid Pick and DeliveryINFORMS Journal on Applied Analytics, 2022
- The impact of integrated cluster-based storage allocation on parts-to-picker warehouse performanceTransportation Research Part E: Logistics and Transportation Review, 2021
- Integrating storage location and order picking problems in warehouse planningTransportation Research Part E: Logistics and Transportation Review, 2020
- Optimization of Warehouse Operations with Genetic AlgorithmsApplied Sciences, 2020
- An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU ArchitecturesIEEE Transactions on Parallel and Distributed Systems, 2015
- Reverse logistics and closed-loop supply chain: A comprehensive review to explore the futureEuropean Journal of Operational Research, 2015
- Parallel Implementations for Solving Shortest Path Problem using Bellman-FordInternational Journal of Computer Applications, 2014
- Ergodic Theory of Random Transformations.Journal of the American Statistical Association, 1988
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962