Park warehouse management system based on sorting base

Abstract

The invention discloses a park warehouse management system based on a sorting base, which relates to the technical field of warehouse management and comprises a data acquisition module, a sorting priority acquisition module, a warehouse sorting scheduling sequence table generation module, a distance acquisition module, a path point acquisition module and a cargo sorting scheduling path acquisition module. The technical problems that due to the fact that the real-time requirements of all sorting operations in a sorting base are different, processing of high-value goods is delayed, meanwhile, due to the fact that path planning is lacked, sorting equipment moves blindly in the operation process, the sorting equipment needs to frequently move back and forth between different operation areas, and energy consumption and time cost are increased are solved. The path points are sequenced and connected according to the warehouse sorting scheduling sequence table to obtain a cargo sorting scheduling path, a specific driving path is provided for sorting equipment, and it is ensured that all execution allocation tasks are efficiently completed; and the efficiency and the accuracy of logistics warehouse management are further improved.

Description

Technical Field

[0001] The invention belongs to the technical field of warehouse management, and in particular is a park warehouse management system based on a sorting base. Background Art

[0002] In modern logistics warehousing management, sorting operations are a key link. With the continuous growth and diversification of logistics business, sorting bases are facing more and more complex situations. Different warehouse sorting operations have significant differences in cargo value, urgency (which can be reflected by the remaining execution time), etc. However, existing technologies are insufficient in many aspects.

[0003] The patent publication number CN117755833A discloses an intelligent sorting and palletizing robot and control method. The device includes a sorting mechanism, a pallet distribution mechanism, a finished product conveying mechanism and a robot palletizing mechanism. The multi-degree-of-freedom operation is realized by a combination of a truss mechanical structure and two sets of manipulators. In the process, the shortest path station after the product is picked out is calculated through an intelligent palletizing algorithm, and the products are intelligently sorted and palletized according to different specifications along the optimal path. The present invention can meet the online mixed-line production of 1-8 products, and can sort and palletize up to 8 products at the same time, realizing online flexible production. In addition, it can adapt to changes in the types of sorted products during the production process, thereby improving the palletizing efficiency and the service life of the equipment.

[0004] However, due to the differences in real-time demands of various sorting operations in the sorting base, in actual operation, if the priority of the sorting operation is not considered, high-value goods will be delayed in processing, or urgent tasks will not be completed in time. At the same time, the lack of path planning will cause the sorting equipment to move blindly during the operation, resulting in the need for the sorting equipment to frequently travel back and forth between different operating areas, which not only increases the energy consumption of the equipment, but also wastes a lot of time, reducing the operating efficiency of the entire logistics warehousing system. Based on this, a park warehousing management system based on the sorting base is proposed. Summary of the invention

[0005] The purpose of the present invention is to provide a park warehouse management system based on a sorting base, which solves the technical problems that the processing of high-value goods is delayed due to differences in real-time demands of various sorting operations in the sorting base. At the same time, the lack of path planning will cause the sorting equipment to move blindly during the operation, resulting in the sorting equipment needing to frequently travel back and forth between different operating areas, increasing energy consumption and time costs.

[0006] The park warehouse management system based on the sorting base includes:

[0007] The data acquisition module acquires the real-time demand data of each warehouse sorting operation in the logistics system;

[0008] The sorting priority acquisition module obtains the sorting priority corresponding to each warehouse sorting operation;

[0009] The warehouse sorting scheduling sequence table generation module arranges all the warehouse sorting jobs in descending order according to the numerical values ​​of the sorting priorities of all the warehouse sorting jobs, and then obtains the warehouse sorting scheduling sequence table;

[0010] The distance acquisition module obtains the distances between the sorting device and each execution allocation task according to the position coordinates of the sorting device and the position coordinates of each execution allocation task;

[0011] The path point acquisition module obtains the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point;

[0012] The cargo sorting and scheduling path acquisition module connects each path point in sequence to obtain the cargo sorting and scheduling path.

[0013] As a further solution of the present invention: the specific method of obtaining the sorting priority corresponding to each storage sorting operation is:

[0014] The cargo value VDj and the remaining execution time Xj corresponding to each warehouse sorting operation are obtained, and the sorting priority Aj corresponding to each warehouse sorting operation is calculated by the priority calculation formula, where j refers to different sorting operations, j=1, 2,..., n, where n is the number of sorting operations, n is a positive integer and n>1.

[0015] As a further solution of the present invention: the priority calculation formula is specifically:

[0016] ;

[0017] Where VDmax is the maximum value of the goods in all the sorting operations, Xmax is the maximum value of the remaining execution time in all the sorting operations, β1 and β2 are both preset weight coefficients, and β1+β2=1 is satisfied.

[0018] As a further solution of the present invention: the specific method of obtaining the warehouse sorting scheduling sequence table is:

[0019] According to the sorting priorities corresponding to all warehouse sorting jobs, all the sorting jobs are arranged in descending order according to the numerical values ​​of the sorting priorities Aj of all warehouse sorting jobs, so as to obtain a warehouse sorting scheduling sequence table.

[0020] As a further solution of the present invention, the method of obtaining the distances between the sorting equipment and each assigned task is as follows:

[0021] The initial position coordinates corresponding to the sorting device are obtained and marked as (XA, YA). Meanwhile, the position coordinates corresponding to each execution allocation task of the sorting device are obtained and marked as (XBj, YBj). The distance Dsj between the sorting device and each execution allocation task is calculated by the distance calculation formula.

[0022] As a further solution of the present invention: the specific method of obtaining the path points corresponding to each execution assignment task is:

[0023] According to the initial position coordinates (XA, YA) of the sorting equipment, in accordance with the order of each execution assignment task in the warehouse sorting scheduling sequence table, each execution assignment task is processed in turn. According to the position coordinates (XBj, YBj) corresponding to each execution assignment task of the sorting equipment, starting from the initial position of the sorting equipment, the expected driving direction of the sorting equipment is determined according to the three-point collinearity theorem. First, the initial position coordinates of the sorting equipment are used as the first point, the next preset path point is the second point, and the location of the execution assignment task is the third point. The current possible path point that meets the judgment formula is determined as the actual path point. If the judgment formula is not met, it is necessary to reselect the next possible path point for judgment until a path point that meets the conditions is found or the location of the execution assignment task is reached and its positioning coordinates are recorded. This process is repeated until all execution assignment tasks are processed, and the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point can be obtained.

[0024] As a further solution of the present invention: the determination formula is specifically:

[0025] (XB j -XB j-1 )×(XB j-1 -YB j-1 )=(XB j-1 -YB j-1 )×(XB j+1 -XB j-1 ).

[0026] As a further solution of the present invention: the specific method of obtaining the cargo sorting and scheduling path is:

[0027] According to the order of each execution assignment task in the warehouse sorting scheduling sequence table, the path points corresponding to each execution assignment task are sorted to ensure that the order of the path points is consistent with the warehouse sorting scheduling sequence. At the same time, starting from the first path point corresponding to the first execution assignment task, each path point is connected in sequence to obtain the cargo sorting scheduling path.

[0028] As a further solution of the present invention: the larger the value of the sorting priority is, the higher the sorting priority of the corresponding storage to be sorted operation is, and vice versa.

[0029] Compared with the prior art, the present invention has the following beneficial effects:

[0030] (1) The present invention, by considering the value of goods and the remaining execution time, can reasonably arrange the execution order of the jobs to be sorted, give priority to high-value jobs with a short remaining execution time, improve the overall efficiency of the logistics system, ensure that high-value goods can be processed as soon as possible, reduce the residence time of goods in the warehouse, and reduce inventory costs. The preset weight coefficient can be adjusted according to actual conditions to meet the needs of different warehouse management priorities;

[0031] (2) The present invention obtains a cargo sorting and scheduling path by sorting and connecting the path points according to the warehouse sorting and scheduling sequence table, thereby avoiding blind driving and providing a specific driving path for the sorting equipment to ensure efficient completion of each execution assignment task; the path points are determined by considering the three-point collinearity theorem and the judgment formula to ensure the rationality and feasibility of the path. At the same time, the path points can be connected by straight lines or curves according to actual conditions to adapt to different environmental requirements. Combined with sorting priority and path planning, the comprehensive optimization of the logistics system is achieved, and the efficiency and accuracy of logistics warehousing management are further improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 It is a schematic diagram of the system framework structure of the present invention;

[0033] Figure 2 A schematic diagram of the process of obtaining a cargo sorting and scheduling path for the present invention. DETAILED DESCRIPTION

[0034] The technical solution of the present invention will be clearly and completely described below in conjunction with the embodiments. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0035] Embodiment 1

[0036] See also Figure 1-Figure 2 ,This application provides a park warehouse management system based on a sorting base, including;

[0037] The data acquisition module is used to acquire the real-time demand data of each storage sorting operation in the logistics system. The real-time demand data includes the value of goods and the remaining execution time corresponding to each storage sorting operation;

[0038] The sorting priority acquisition module is used to analyze the cargo value and remaining execution time corresponding to each warehouse sorting operation, and calculate the sorting priority corresponding to each warehouse sorting operation according to the analysis results. The specific method is as follows:

[0039] Obtain the cargo value and remaining execution time corresponding to each warehouse sorting operation, and mark them as VDj and Xj, respectively, where j refers to different sorting operations, j=1, 2, ..., n, where n is the number of sorting operations, n is a positive integer and n>1;

[0040] By formula: ; Calculate and obtain the sorting priority Aj corresponding to each warehouse sorting operation;

[0041] Among them, VDmax is the maximum value of the goods in all the sorting operations, Xmax is the maximum value of the remaining execution time in all the sorting operations, β1 and β2 are both preset weight coefficients, and β1+β2=1 is satisfied. The relative importance of the goods value and the remaining execution time in the priority calculation is adjusted by the preset weight coefficients β1 and β2;

[0042] It should be noted that the preset weight coefficients β1 and β2 can be determined according to actual conditions. For example, if the warehouse management attaches more importance to the value of the goods, β1>β2 can be set; if the timely completion of the sorting operation is more important, β2>β1 can be set;

[0043] The greater the value of the goods to be sorted in the warehouse and the smaller the remaining execution time, the higher the sorting priority, and vice versa;

[0044] For example, suppose there are 5 jobs to be sorted in a logistics warehouse, each of which has its corresponding cargo value VDj and remaining execution time Xj; the following is the data of these 5 jobs to be sorted:

[0045] Job 1: Goods value VD1 = $10,000, remaining execution time X1 = 2 hours

[0046] Operation 2: Goods value VD2 = $8,000, remaining execution time X2 = 1 hour

[0047] Operation 3: Goods value VD3 = $12,000, remaining execution time X3 = 3 hours

[0048] Operation 4: Value of goods VD4 = $6,000, remaining execution time X4 = 2 hours

[0049] Operation 5: The value of the goods is VD5 = $9,000, and the remaining execution time is X5 = 1.5 hours;

[0050] Assume that according to the focus of warehouse management, we set the weight coefficients as follows: β1=0.6, β2=0.4, then the maximum value of the goods in all sorting operations is: VDmax=$12,000, the maximum remaining execution time of all sorting operations is: Xmax=3 hours;

[0051] Then the sorting priority corresponding to each warehouse sorting operation is calculated. The sorting priority of operation 1 is: 0.2333, the sorting priority of operation 2 is: 0.2667, the sorting priority of operation 3 is: 0.2, the sorting priority of operation 4 is: 0.0333, and the sorting priority of operation 5 is: 0.25;

[0052] Therefore, during the scheduling process, we should prioritize job 2 for sorting, followed by job 5, and so on. This arrangement ensures that high-value goods can be processed as quickly as possible and takes into account the impact of the remaining execution time, thereby optimizing the operational efficiency of the entire logistics system;

[0053] Arrange all warehouse sorting jobs in descending order of priority. During the scheduling process, give priority to sorting warehouse sorting jobs with higher sorting priorities. Calculate the sorting priority of each warehouse sorting job based on the value of the goods and the remaining execution time, and determine the priority of the sorting jobs, so that high-priority jobs can be processed first during the scheduling process to improve the operating efficiency of the logistics system.

[0054] The warehouse sorting scheduling sequence table generation module arranges all the warehouse sorting jobs in descending order according to the sorting priorities corresponding to all the warehouse sorting jobs and the numerical values ​​of the sorting priorities Aj of all the warehouse sorting jobs, thereby obtaining the warehouse sorting scheduling sequence table;

[0055] For example, the sorting priority of job 1 is calculated to be 0.2333, the sorting priority of job 2 is calculated to be 0.2667, the sorting priority of job 3 is calculated to be 0.2, the sorting priority of job 4 is calculated to be 0.0333, and the sorting priority of job 5 is calculated to be 0.25. We can sort the jobs from high to low in terms of priority: job 2, job 5, job 1, job 3, job 4, and then obtain the warehouse sorting scheduling sequence table.

[0056] All the jobs to be sorted are arranged in descending order according to the sorting priority, and a warehouse sorting scheduling sequence table is generated to provide a clear job execution order for the scheduling of sorting equipment.

[0057] The distance acquisition module takes each storage sorting operation in the storage sorting scheduling sequence as an execution allocation task, obtains the position coordinates of the sorting equipment and the position coordinates corresponding to each execution allocation task, and calculates the distance between the sorting equipment and each execution allocation task according to the position coordinates of the sorting equipment and the position coordinates corresponding to each execution allocation task. The specific method is as follows:

[0058] The initial position coordinates of the sorting device are obtained and marked as (XA, YA), and the position coordinates of each execution assignment task of the sorting device are obtained and marked as (XBj, YBj);

[0059] By formula, ; Calculate and obtain the distance Dsj corresponding to each sorting device and each execution distribution task;

[0060] Calculate the distance between the sorting equipment and each execution distribution task, and provide distance information for path planning, so as to determine the path length of the sorting equipment to each task point.

[0061] By considering the value of the goods and the remaining execution time, the execution order of the sorting operations can be reasonably arranged, and high-value operations with a short remaining execution time can be given priority, thereby improving the overall efficiency of the logistics system, ensuring that high-value goods can be processed as quickly as possible, reducing the residence time of goods in the warehouse, and reducing inventory costs. The preset weight coefficient can be adjusted according to actual conditions to meet the needs of different warehouse management priorities.

[0062] Embodiment 2

[0063] As the second embodiment of the present invention, when the present application is implemented, compared with the first embodiment, the technical solution of the present embodiment is different from the first embodiment only in that the present embodiment further includes a path point acquisition module and a cargo sorting and scheduling path acquisition module;

[0064] The path point acquisition module analyzes and obtains the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point according to the distances corresponding to each sorting device and each execution assignment task. The specific method is as follows:

[0065] According to the initial position coordinates (XA, YA) of the sorting equipment, each execution assignment task is processed in turn according to the order of each execution assignment task in the warehouse sorting scheduling sequence table. According to the position coordinates corresponding to each execution assignment task of the sorting equipment, they are marked as: (XBj, YBj). Starting from the initial position of the sorting equipment, the expected driving direction of the sorting equipment is determined according to the three-point collinearity theorem. First, the initial position coordinates of the sorting equipment are used as the first point, the next preset path point is the second point, and the position of the execution assignment task is the third point.

[0066] If the judgment formula is satisfied: (XB j -XB j-1 )×(XB j-1 -YB j-1 )=(XB j-1 -YB j-1 )×(XB j+1 -XB j-1 );

[0067] This means that the expected direction of the sorting device does not change, and the current possible path point can be determined as the actual path point, and its positioning coordinates can be recorded. If the judgment formula is not satisfied, it is necessary to reselect the next possible path point for judgment until a path point that meets the conditions is found or the location of the execution assignment task is reached and its positioning coordinates are recorded, and so on, until all the execution assignment tasks are processed, the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point can be obtained;

[0068] According to the distance between the sorting equipment and the execution distribution task, the three-point collinearity theorem and the judgment formula are used to determine the path points and positioning coordinates corresponding to each execution distribution task, providing specific path point information for the planning of the cargo sorting and scheduling path.

[0069] The cargo sorting and scheduling path acquisition module sorts the path points corresponding to each execution assignment task according to the order of each execution assignment task in the warehouse sorting scheduling sequence table to ensure that the order of the path points is consistent with the warehouse sorting scheduling sequence. At the same time, starting from the first path point corresponding to the first execution assignment task, each path point is connected in sequence. Straight line connection or curve connection can be used according to actual conditions to obtain the cargo sorting and scheduling path to ensure the rationality and feasibility of the path.

[0070] When there are multiple optimal subnodes with the same cost, the direction is identified and the direction of travel corresponding to the selected subnode is corrected. According to the above process, the positioning results of each path point of the cargo sorting scheduling can be obtained until the sorting equipment completes the last cargo storage task, connects each path point, and obtains the planning result of the cargo sorting scheduling path;

[0071] According to the warehouse sorting scheduling sequence table, the path points are sorted and connected to obtain the cargo sorting scheduling path, which provides a specific driving path for the sorting equipment to ensure the efficient completion of each execution assignment task; it can provide a specific driving path for the sorting equipment to avoid blind driving and improve the operating efficiency of the sorting equipment. By considering the three-point collinearity theorem and the judgment formula to determine the path points, the rationality and feasibility of the path are ensured. At the same time, the path points can be connected by straight lines or curves according to actual conditions to adapt to different environmental requirements. Combined with sorting priority and path planning, it realizes the comprehensive optimization of the logistics system and further improves the efficiency and accuracy of logistics warehousing management.

[0072] Embodiment 3

[0073] As the third embodiment of the present invention, when the present application is specifically implemented, compared with the first and second embodiments, the technical solution of this embodiment is to combine the solutions of the first and second embodiments mentioned above for implementation.

[0074] The above formulas are all dimensionless and numerical calculations. The formula is a formula for the most recent real situation obtained by collecting a large amount of data and performing software simulation. The preset parameters and thresholds in the formula are set by technicians in this field according to actual conditions.

[0075] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. The park warehouse management system based on the sorting base is characterized by: include: The data acquisition module acquires the real-time demand data of each warehouse sorting operation in the logistics system; The sorting priority acquisition module obtains the sorting priority corresponding to each warehouse sorting operation; The warehouse sorting scheduling sequence table generation module arranges all the warehouse sorting jobs in descending order according to the numerical values ​​of the sorting priorities of all the warehouse sorting jobs, and then obtains the warehouse sorting scheduling sequence table; The distance acquisition module obtains the distances between the sorting device and each execution allocation task according to the position coordinates of the sorting device and the position coordinates of each execution allocation task; The path point acquisition module obtains the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point; The cargo sorting and scheduling path acquisition module connects each path point in sequence to obtain the cargo sorting and scheduling path.

2. The park warehouse management system based on the sorting base according to claim 1 is characterized in that: The specific method of obtaining the sorting priority corresponding to each warehouse sorting operation is: The cargo value VDj and the remaining execution time Xj corresponding to each warehouse sorting operation are obtained, and the sorting priority Aj corresponding to each warehouse sorting operation is calculated by the priority calculation formula, where j refers to different sorting operations, j=1, 2,..., n, where n is the number of sorting operations, n is a positive integer and n>1.

3. The park warehouse management system based on the sorting base according to claim 2 is characterized in that: The priority calculation formula is as follows: ; Where VDmax is the maximum value of the goods in all the sorting operations, Xmax is the maximum value of the remaining execution time in all the sorting operations, β1 and β2 are both preset weight coefficients, and β1+β2=1 is satisfied.

4. The park warehouse management system based on the sorting base according to claim 2 is characterized in that: The specific method to obtain the warehouse sorting scheduling sequence table is as follows: According to the sorting priorities corresponding to all warehouse sorting jobs, all the sorting jobs are arranged in descending order according to the numerical values ​​of the sorting priorities Aj of all warehouse sorting jobs, so as to obtain a warehouse sorting scheduling sequence table.

5. The park warehouse management system based on the sorting base according to claim 2 is characterized in that: The method of obtaining the distances between the sorting equipment and each execution distribution task is as follows: The initial position coordinates corresponding to the sorting device are obtained and marked as (XA, YA). Meanwhile, the position coordinates corresponding to each execution allocation task of the sorting device are obtained and marked as (XBj, YBj). The distance Dsj between the sorting device and each execution allocation task is calculated by the distance calculation formula.

6. The park warehouse management system based on the sorting base according to claim 5 is characterized in that: The specific method of obtaining the path points corresponding to each execution assignment task is: According to the initial position coordinates (XA, YA) of the sorting equipment, in accordance with the order of each execution assignment task in the warehouse sorting scheduling sequence table, each execution assignment task is processed in turn. According to the position coordinates (XBj, YBj) corresponding to each execution assignment task of the sorting equipment, starting from the initial position of the sorting equipment, the expected driving direction of the sorting equipment is determined according to the three-point collinearity theorem. First, the initial position coordinates of the sorting equipment are used as the first point, the next preset path point is the second point, and the location of the execution assignment task is the third point. The current possible path point that meets the judgment formula is determined as the actual path point. If the judgment formula is not met, it is necessary to reselect the next possible path point for judgment until a path point that meets the conditions is found or the location of the execution assignment task is reached and its positioning coordinates are recorded. This process is repeated until all execution assignment tasks are processed, and the path points corresponding to each execution assignment task and the positioning coordinates corresponding to each path point can be obtained.

7. The park warehouse management system based on the sorting base according to claim 6 is characterized in that: The specific determination formula is: (XB j -XB j-1 )×(XB j-1 -YB j-1 )=(XB j-1 -YB j-1 )×(XB j+1 -XB j-1 )。 8. The park warehouse management system based on the sorting base according to claim 6 is characterized in that: The specific method of obtaining the cargo sorting and scheduling path is: According to the order of each execution assignment task in the warehouse sorting scheduling sequence table, the path points corresponding to each execution assignment task are sorted to ensure that the order of the path points is consistent with the warehouse sorting scheduling sequence. At the same time, starting from the first path point corresponding to the first execution assignment task, each path point is connected in sequence to obtain the cargo sorting scheduling path.

9. The park warehouse management system based on the sorting base according to claim 2 is characterized in that: The larger the value of the sorting priority is, the higher the sorting priority of the corresponding warehouse sorting operation is, and vice versa.

Images