A Warehouse Shortest Path Optimization Method Based on Simultaneous Picking by Multiple People

Abstract

The invention proposes a warehouse shortest path optimization method based on simultaneous picking by multiple people. Taking the shortest picking path based on simultaneous picking by multiple people as the optimization goal, the warehouse operation environment is assumed and a mathematical model is established, and the number of people required to pick is determined according to the information of the outbound goods; the separator is introduced in the genetic operation of the genetic algorithm Concept, combined with the selection operator based on the improvement of cumulative probability to improve the algorithm and solve the objective function, obtain the optimal picking path set for multiple people to pick at the same time; use the picking path conflict elimination strategy based on time window to compare the obtained paths Collect and plan, adopt a priority-based waiting strategy to eliminate path conflicts, and obtain the picking time of each path; finally compare the picking time of each path, and select the path with the shortest time as the optimization result. The invention can improve the picking efficiency of the warehouse.

Description

technical field [0001] The invention relates to the technical field of shortest path and intelligent warehouse management, in particular to a warehouse shortest path optimization method based on simultaneous picking by multiple people. Background technique [0002] In recent years, with the rapid development of computer technology and other advanced technologies, the research on warehouse management system (WMS) is also in full swing. In this process, the shortest path optimization problem of goods picking has always been the research focus. Most of the traditional shortest path optimization problems for goods picking are solved by ant colony algorithm, genetic algorithm, particle swarm optimization algorithm and simulated annealing algorithm. There will be many people picking goods at the same time in the warehouse, which has certain limitations. As the number of goods to be picked increases, the demand for pickers also increases. The current algorithm cannot be directly a...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to propose a warehouse shortest path optimization method based on simultaneous picking by multiple people. In view of the fact that the existing algorithm only considers the problem of single-person single-line picking path planning, a method suitable for simultaneous picking by multiple people is proposed. The optimization algorithm of goods considers the shortest path optimization goal based on multiple people picking at the same time, determines the number of pickers required according to the outbound order, and establishes an objective function based on the shortest picking path; in the genetic operation of genetic algorithm Introduce the concept of separator and improve the algorithm by combining the selection operator based on the improvement of cumulative probability to solve the problem that the current algorithm cannot be directly applied to solve the problem of the shortest path optimization objective function based on simultaneous picking by multiple people; The picking path conflict elimination strategy eliminates the path conflicts that may exist in the simultaneous picking path planning of multiple people, so as to obtain the picking path with the shortest time for multiple people to pick at the same time. The specific technical scheme is as follows:

Images