Dynamic Cart Optimization in Warehouse Picking Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The packaging and shipping industries face challenges in efficiently managing the picking process in warehouses, which affects the speed, cost, and efficiency of order fulfillment due to the need for technological improvements in picking systems.
Innovation Solution
A computer system is used to optimize node and edge selections within a digital graph model of a warehouse location, allowing for the dynamic generation of pick requests and optimized routes to efficiently fill picking carts, thereby improving the efficiency of the picking process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If traditional picking processes are used in warehouses, then the picking system is simple to operate, but the order fulfillment speed and efficiency are insufficient to meet current market demands for same-day or two-day delivery
Solution Approach 1:
The system performs preliminary actions by pre-calculating optimal picking routes and cart assignments before picking operations begin. The digital graph model is pre-built with all nodes and edges representing warehouse locations and pathways, allowing the system to quickly determine optimal routes without real-time calculation delays.
Solution Approach 2:
The picking system is made dynamic through real-time cart assignment optimization and route adjustment. The system dynamically assigns items to carts based on current cart utilization levels and dynamically determines picking routes based on multiple order consolidations, allowing the system to adapt to changing conditions during order fulfillment.
2Productivity
If more picking carts are used to increase order fulfillment capacity, then the speed of order processing improves, but the complexity of managing and optimizing cart assignments increases
Solution Approach 1:
The system implements self-service through automated cart assignment optimization. Rather than requiring manual management of cart assignments, the system automatically determines which items should be assigned to which carts based on consolidation opportunities and cart utilization metrics, eliminating the need for complex manual coordination.
Solution Approach 2:
The system uses feedback mechanisms by continuously monitoring cart utilization levels and using this information to optimize subsequent item assignments. The digital graph model tracks the state of each cart and uses this feedback to dynamically adjust routing and assignment decisions to maximize consolidation efficiency.
3Productivity
If items are consolidated across multiple orders to fill picking carts more efficiently, then the productivity of the picking system improves, but the complexity of determining optimal item consolidation increases
Solution Approach 1:
The system applies segmentation by dividing the warehouse into a digital graph model with discrete nodes representing locations and edges representing pathways. This segmentation allows the system to systematically evaluate consolidation opportunities by analyzing items grouped by their physical locations and the routes required to access them.
Solution Approach 2:
The system adds another dimension to the picking optimization problem by incorporating the physical spatial relationships between items through the digital graph model. Rather than simply consolidating items based on order overlap, the system considers the spatial dimension of warehouse locations and pathway distances to determine optimal consolidation strategies.
Data Source
AI summary
A computer system for optimizing node and edge selections within a digital graph model accesses a digital graph model of a physical warehouse location. The digital graph model comprises information indicating a location of multiple specific items of inventory among shelves in the physical warehouse location. The computer system identifies a set of orders that each comprise one or more items and an order priority. The computer system then maps each item in each order selected from the set or orders to the multiple nodes within the digital graph model. The computer system identifies a ranking node from the multiple nodes. The computer system then traverses one or more edges that extend from the ranking node to identify a shortest path within the digital graph model to fill a digital model of a picking cart above a packing threshold level.