Sorting Slot Allocation With Bag Replacement Timing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing sorting systems are inefficient due to manual labor, high costs, and unpredictable throughput, particularly in handling small-lot, multi-variety shipments, and do not optimally manage bag replacements, leading to potential delays and decreased throughput.
Innovation Solution
A method and system that calculates optimal order-slot allocation and issues timely bag replacement instructions using order and slot data to minimize total time and maximize throughput by predicting bag replacement needs, incorporating mixed integer programming and escape slots to manage bag replacement efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If distance-based sorting method is used to select target supply station, then total delivery distance is minimized, but throughput decreases due to bag replacement requirements not being considered
Solution Approach 1:
The patent changes the selection criteria from solely distance-based to a composite parameter that includes both delivery distance and bag replacement frequency. By introducing bag replacement timing as a new parameter in the decision-making process, the system optimizes for overall efficiency rather than just distance, thereby maintaining high throughput while minimizing delivery energy consumption.
Solution Approach 2:
The system performs preliminary calculations of bag replacement timing and frequency for each potential target supply station before making the final selection. By anticipating future bag replacement needs and incorporating them into the decision-making process, the system avoids delays and maintains continuous operation, thus preserving throughput while selecting optimal destinations based on comprehensive criteria.
2Reliability
If bag replacement is performed frequently to maintain optimal sorting, then system reliability is maintained, but throughput decreases due to time lost during replacement
Solution Approach 1:
The patent calculates and anticipates bag replacement timing in advance, determining the optimal moment to replace bags before they become full during the sorting process. By performing preliminary assessments of bag fill rates and replacement needs, the system schedules bag replacements to minimize interruption to the overall sorting operation, thereby maintaining both reliability and throughput.
Solution Approach 2:
The system continuously monitors bag fill status and uses this feedback to dynamically adjust sorting operations. When bags approach capacity or when optimal replacement timing is detected, the system receives feedback and automatically initiates bag replacement procedures, ensuring continuous operation without unnecessary delays. This feedback mechanism maintains system reliability while minimizing throughput loss.
3Ease of operation
If manual labor is used for bag replacement and sorting, then operational flexibility is maintained, but productivity decreases and errors increase
Solution Approach 1:
The patent implements an automated sorting system that performs bag replacement and item sorting without requiring manual intervention. The automated system independently monitors bag status, calculates optimal replacement timing, executes sorting decisions based on pre-computed algorithms, and manages the entire workflow. This self-service capability dramatically increases productivity and reduces errors while maintaining operational flexibility through programmable control.
Data Source
AI summary
A method for sorting a plurality of items and slot allocation in association with the plurality of items. The method may include collecting order data and slot data, wherein the slot data is information associated with a plurality of slots, each slot of the plurality of slots allows for placement of item bag over slot, and the plurality of items is to be sorted and inserted into bags associated with the plurality of slots; calculating combinations of order-slot allocation based on the order data and the slot data to estimate total time; and selecting a combination of the combinations of order-slot allocation with minimal total time and applying the selected combination.