Dynamic Sorting Destination Assignment for Distribution Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing sorting methods in distribution networks are inefficient due to the static assignment of sorting destinations to delivery points, leading to underutilization of sorting equipment and increased operational costs, as many destinations do not receive items on a given day, requiring multiple passes and resulting in empty or unused sorting destinations.
Innovation Solution
Implementing a system that dynamically assigns sorting destinations to delivery points based on expected item information and historical data, using delivery point compression to optimize the use of sorting equipment by omitting unused delivery points and assigning destinations based on item frequency scores and prioritization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sorting destinations are statically assigned to all delivery points, then complete coverage of all possible destinations is achieved, but sorting equipment is underutilized with many empty destinations on given days
Solution Approach 1:
The patent implements dynamic assignment of sorting destinations to delivery points based on expected item information. The system determines which delivery points are expected to receive items on a given day and assigns sorting destinations only to those active delivery points, rather than maintaining static assignments to all possible delivery points. This dynamic approach ensures complete coverage of needed destinations while maximizing equipment utilization by eliminating empty sorting destinations.
2Reliability
If multiple sorting passes are performed to handle all delivery points, then all items are eventually sorted, but operational time and costs increase
Solution Approach 1:
The system performs preliminary determination of expected delivery points using expected item information before the sorting operation begins. By identifying in advance which delivery points will be active on a given day and assigning sorting destinations only to those points, the system enables all items to be sorted in a single pass rather than requiring multiple passes, thereby reducing operational time and costs while maintaining complete sorting coverage.
3Reliability
If sorting destinations are assigned to unused delivery points, then all possible destinations are covered, but space utilization in the processing facility decreases
Solution Approach 1:
The system discards assignments to unused delivery points by determining which delivery points are expected to receive items and assigning sorting destinations only to those active points. This approach recovers space that would otherwise be occupied by empty sorting destinations, improving space utilization in the processing facility while maintaining availability of sorting destinations for all needed delivery points through dynamic reassignment.
Data Source
AI summary
Systems and methods for sorting items for delivery to delivery points, using delivery point compression. Items can be sorted and sequenced for delivery by a sorting machine having a finite number of sorting destinations. For routes having more delivery points than the number of sorting destinations, delivery point compression allows sorting destination assignments that eliminate delivery points not likely to receive any items. Sorting destination assignments can be performed by a processor of the sorting machine based on expected item information and delivery point item frequency scores.