Logistics Picking Job Optimization via Random Array Selection

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing warehouse management systems struggle to efficiently plan picking job sequences that minimize travel distances within logistics warehouses, leading to increased time and effort in processing orders.

Innovation Solution

A method and device for organizing logistics picking jobs that involve generating multiple picking job arrays with random assignments, comparing their suitability based on travel distances, and updating the solution with the array having the highest suitability, while also incorporating modules for employee and onlooker modules to search and select the most efficient picking job arrays.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If a warehouse management system is used to check goods locations, then goods can be found and quantities checked, but planning picking job sequences to minimize travel distances becomes difficult

Engineering Contradiction:

Improvegoods location checking accuracyVSAvoidpicking job sequence planning complexity

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent replaces manual or basic system-based sequence planning with an algorithmic optimization approach. The system automatically generates multiple picking job arrays through random initialization and evaluates their suitability using travel distance calculations, then selects the optimal sequence without requiring complex manual planning processes.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent changes the approach from checking goods locations statically to dynamically optimizing picking sequences based on travel distance parameters. By evaluating multiple possible sequences and selecting the one with minimum total travel distance, the system transforms location data into optimized action sequences.

Inventive Principle:

Principle #35Parameter changes

2Productivity

If optimization is performed by determining the number of locations and minimum travel distances, then picking efficiency improves, but calculation time becomes considerable

Engineering Contradiction:

Improvepicking job processing efficiencyVSAvoidcalculation time

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

Instead of evaluating all possible picking sequences (which would be computationally exhaustive), the patent generates a limited number of random picking job arrays and selects the best among them. This partial evaluation approach provides sufficient optimization without the time cost of complete enumeration.

Inventive Principle:

Principle #16Partial or excessive action

Solution Approach 2:

The system performs preliminary random initialization to create multiple picking job arrays before final selection. By pre-generating and evaluating several candidate sequences, the system prepares optimized solutions in advance, reducing the need for time-consuming real-time optimization calculations.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS20250182044A1Method and device for organizing logistics picking jobs

Publication Date: 2025.06.05 COLOSSEUM CORP INC

AI summary

A method and device for organizing logistics picking jobs is proposed. The proposed relates to a method for organizing logistics picking jobs in response to a plurality of orders, and relates to a device for executing the method. The method includes a source initialization step of generating a plurality of picking job arrays whose elements are set as random picking jobs and a solution selection step of comparing suitabilities of the plurality of picking job arrays with each other and updating a picking job array having the highest suitability as a solution.