CN117892897B - Logistics scheduling management method and system for intelligent storage - Google Patents
Logistics scheduling management method and system for intelligent storage Download PDFInfo
- Publication number
- CN117892897B CN117892897B CN202410298034.7A CN202410298034A CN117892897B CN 117892897 B CN117892897 B CN 117892897B CN 202410298034 A CN202410298034 A CN 202410298034A CN 117892897 B CN117892897 B CN 117892897B
- Authority
- CN
- China
- Prior art keywords
- path
- comparison
- total length
- transport
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 19
- 238000000034 method Methods 0.000 claims abstract description 27
- 238000005259 measurement Methods 0.000 claims description 3
- 238000005457 optimization Methods 0.000 abstract description 2
- 238000005215 recombination Methods 0.000 description 2
- 230000006798 recombination Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Abstract
The invention discloses a logistics scheduling management method and a logistics scheduling management system for intelligent storage, which relate to the technical field of logistics sorting and conveying, and are characterized in that all transport paths currently running are obtained, the target times, the target single times and the target lengths of all transport paths in an observation period are obtained, then the transport value of each day is determined according to the target single times and the target lengths of the transport paths, the considered value of the corresponding transport paths is determined according to the transport value of each day, and after the high-frequency path is determined according to the considered value of all transport paths; updating the main path and determining whether to replace the path; according to the invention, the optimization of the sorting paths in the sorting process aiming at unmanned conveying can be determined according to the real-time condition of the current sorting conveying point, and the paths are ensured to be combined more efficiently, so that the sorting process is more reasonable, and the method is simple and effective, and is easy and practical.
Description
Technical Field
The invention belongs to the technical field of logistics sorting, and particularly relates to a logistics scheduling management method and system for intelligent storage.
Background
The patent with publication number CN115599063A discloses a warehouse logistics scheduling method and system, comprising a warehouse subsystem, a scheduling subsystem, a security management subsystem and a logistics subsystem; the storage subsystem receives the order task and marks storage position information and sends the information to the scheduling subsystem, the scheduling subsystem generates a scheduling planning path according to the storage position information, the order task information and the environmental state information and transmits the scheduling planning path to the logistics vehicle to travel according to the planning path, and the logistics vehicle performs obstacle avoidance or detour travel according to the obstacle diagnosed by the safety management subsystem in the traveling process; and the logistics subsystem records and processes logistics information of the order task completed in each system link, and generates storage logistics log report storage and display of the order task. The invention can redetermine the sequencing according to the priority level of the task under the condition of multi-task scheduling, thereby avoiding the conflict problem existing in the multi-task scheduling; in the process of dispatching and carrying, an autonomous obstacle avoidance strategy and path re-planning are adopted to quickly solve the obstacle problem.
However, for the intelligent warehousing system of logistics, particularly for logistics objects, particularly for small articles, when the express packages are involved, sorting is required for each warehouse, and intelligent sorting is generally adopted; when the sorting conveying system of the intelligent sorting center is used, whether the line setting is reasonable or not is judged, the problem that the line setting is not necessary to be changed is solved, and the line setting is not changed after the line setting is finished in the earlier stage, so that a device for timely adjusting the line according to the sorting condition is needed, and a solution is provided based on the device.
Disclosure of Invention
The present invention aims to solve at least one of the technical problems existing in the prior art; therefore, the invention provides a logistics scheduling management method and system for intelligent warehouse.
A logistics scheduling management method for intelligent warehouse comprises the following steps:
acquiring all transport paths currently running, and acquiring target times, target single times and target lengths of all transport paths in an observation period;
The transportation path comprises a start mark and a final mark, wherein the start mark is the start point, and the final mark is the end point in the corresponding sorting process; the number of times of transporting the package in the corresponding transport path in the corresponding observation period is denoted by the target number of times, the package forms a target number of times, the target number of times is denoted by the number of days in the corresponding observation period, and the target length is denoted by the length of the corresponding transport path;
Determining a daily transport value according to the target single time and the target length of the transport path, determining the considered value of the corresponding transport path according to the daily transport value, obtaining a path sequence according to the descending order of the considered values of all the transport paths, and marking the transport paths of the first three of the path sequences as high-frequency paths;
sequentially taking the shortest path from the final mark to the start mark in the high-frequency path as a main path, sequentially determining other paths according to the main path and the path sequence, and carrying out path reconstruction to obtain a comparison path I, a comparison path II and a comparison path III;
And confirming whether the transportation path is changed or not according to the length relation among the current path, the comparison path I, the comparison path II and the comparison path III, and determining an updated path.
Further, the specific way of determining the daily transport value according to the target single time and the target length of the transport path is as follows:
first, the transport paths are marked as Li, i=1, &, n, representing that n transport paths exist, each transport path corresponding to one target sub-set and a group of target single sub-sets;
Optionally, a transport path is selected, all target single times are obtained, and the formula is utilized: transportation measurement value = 0.6 x target single +0.4 x target length, resulting in daily transportation values Yj, j = 1,..m; the value of m here depends on the number of days of the observation period;
the average value of Yj is obtained, the average value is marked as P, the standard deviation of Yj is automatically calculated, and when the standard deviation is less than or equal to X1, the P is marked as a value;
If the standard deviation is greater than X1, at the moment, a value greater than P in Yj is obtained, the value is marked as an average value, the number smaller than P is marked as an average value, when the average value exceeds the average value, the value obtained by multiplying P by 1.25 is marked as a value, otherwise, the value obtained by multiplying P by 0.85 is marked as a value;
And obtaining the considered value of the corresponding transportation path, and then carrying out the same treatment on all other transportation paths to obtain the considered value of all the transportation paths.
Further, the specific way of path reconstruction is as follows:
The method comprises the steps of obtaining a first high-frequency path sequenced in a path sequence, marking the shortest path from a final destination to a start destination as a main path, obtaining the final destination corresponding to a second high-frequency path, obtaining the shortest path from the final destination to the main path, marking the shortest path as a branch path, sequentially marking the shortest paths from the final destination to the main path of the transport path or the high-frequency path sequenced in the corresponding path sequence to form all new transport paths, and marking the shortest paths as comparison paths I;
Then, the second high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a third high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; sequentially forming all the shortest paths of the final destination of the transport paths sequenced in the corresponding path sequences to the main path, and marking the shortest paths as comparison paths II;
then, the third high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a second high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; and then sequentially forming the shortest path of the final destination of the transport paths sequenced in the corresponding path sequence to the main path to form all new transport paths, and marking the new transport paths as comparison paths III.
Further, the specific way of determining the update path is:
According to the target times and the target lengths corresponding to the current paths, multiplying the target times commonly used by each transport path by the target lengths, and marking the obtained numerical value as the current total length;
The first new comparison path is obtained again, the target length of each new transport path is corresponding, and the target secondary value of each new transport path is assigned as the target secondary value of the corresponding final target transport path consistent with the final target transport path of the transport paths in the current path; that is, the first comparison path contains a plurality of new transport paths, each transport path is to mark its target number as the target number of the same transport path as the final target number of the transport path in the current path in use, and the two transport paths are simulated by the same numerical value, and the total length of one point of the comparison path can be obtained, and the obtained numerical value is marked as one longer than the total length of the comparison path;
obtaining a second comparison total length and a third comparison total length of the second comparison path and the third comparison path according to the first comparison path;
and determining an updating path according to the magnitude relation between the current total length and the comparison total length I, the comparison total length II and the comparison total length III.
Further, determining the update path setting time is performed once.
Further, according to the size relation between the current total length and the comparison total length I, the comparison total length II and the comparison total length III, the specific mode for determining the updating path is as follows:
And if the current total length is larger than any two numerical values of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum numerical value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path.
Further, according to the size relation between the current total length and the comparison total length I, the comparison total length II and the comparison total length III, the specific mode for determining the updating path is as follows:
If the current total length is larger than any one of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path;
At this time, the total length of the transportation path saved by the updated path running in comparison with the current path in the analysis period with the set time length is obtained, the updated path is marked as the saved length, when the saved length exceeds X2, a replacement signal is automatically generated, and at the moment, the current path is required to be modified into the updated path for sorting and transportation of logistics.
Further, when the saving length does not exceed X2, the specific way of determining the update path is:
if the current total length is larger than any two values of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path, otherwise, not processing.
Compared with the prior art, the invention has the beneficial effects that:
According to the method, all the transport paths currently running are obtained, the target times, the target single times and the target lengths of all the transport paths in an observation period are obtained, then the daily transport value is determined according to the target single times and the target lengths of the transport paths, the considered value of the corresponding transport paths is determined according to the daily transport value, and the high-frequency path is determined according to the considered value of all the transport paths; updating the main path and determining whether to replace the path;
According to the invention, the optimization of the sorting paths in the sorting process aiming at unmanned conveying can be determined according to the real-time condition of the current sorting conveying point, and the paths are ensured to be combined more efficiently, so that the sorting process is more reasonable, and the storage process is more intelligent; the invention is simple and effective, and is easy and practical.
Drawings
FIG. 1 is a schematic diagram of a transportation path in a warehouse of the present invention;
fig. 2 is a flow chart of a sorting and conveying method for logistics scheduling according to the present invention.
Detailed Description
The technical solutions of the present invention will be clearly and completely described in connection with the embodiments, and it is obvious that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, the application provides a logistics scheduling management method for intelligent warehouse, which specifically comprises the following steps:
Step one: firstly, acquiring past data in an observation period, wherein the past data comprises a target time, a target single time and a target length corresponding to a transportation path; as shown in fig. 1, the past data is the data generated in the process of starting from the start mark and conveying the package to the final mark of the package in the past logistics sorting processes, the start mark is the starting point, and the final mark is the end point in the corresponding sorting process; the number of times of transporting the package in the corresponding transport path in the corresponding observation period is denoted by the target number of times, the package forms a target number of times, the target number of times is denoted by the number of days in the corresponding observation period, and the target length is denoted by the length of the corresponding transport path; the observation period is a preset time length, and the dimension is a day;
The transport path comprises a plurality of transport paths, each transport path should be from one start label to one end label; step two: carrying out superposition analysis on the past data, wherein the specific mode of the superposition analysis is as follows:
first, the transport paths are marked as Li, i=1, &, n, representing that n transport paths exist, each transport path corresponding to one target sub-set and a group of target single sub-sets;
Optionally, a transport path is selected, all target single times are obtained, and the formula is utilized: transportation measurement value = 0.6 x target single +0.4 x target length, resulting in daily transportation values Yj, j = 1,..m; the value of m here depends on the number of days of the observation period;
the average value of Yj is obtained, the average value is marked as P, the standard deviation of Yj is automatically calculated, and when the standard deviation is less than or equal to X1, the P is marked as a value;
If the standard deviation is greater than X1, at the moment, a value greater than P in Yj is obtained, the value is marked as an average value, the number smaller than P is marked as an average value, when the average value exceeds the average value, the value obtained by multiplying P by 1.25 is marked as a value, otherwise, the value obtained by multiplying P by 0.85 is marked as a value;
Obtaining the considered value of the corresponding transport path, and then carrying out the same treatment on all other transport paths to obtain the considered value of all transport paths;
The transportation paths are arranged in descending order according to the size of the considered value, a path sequence is obtained, and the transportation paths in the first three paths of the path sequence are marked as high-frequency paths;
The method is characterized by comprising the following steps of carrying out path recombination aiming at a high-frequency path, wherein the specific mode of path recombination is as follows:
The method comprises the steps of obtaining a first high-frequency path sequenced in a path sequence, marking the shortest path from a final destination to a start destination as a main path, obtaining the final destination corresponding to a second high-frequency path, obtaining the shortest path from the final destination to the main path, marking the shortest path as a branch path, sequentially marking the shortest paths from the final destination to the main path of the transport path or the high-frequency path sequenced in the corresponding path sequence to form all new transport paths, and marking the shortest paths as comparison paths I;
Then, the second high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a third high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; sequentially forming all the shortest paths of the final destination of the transport paths sequenced in the corresponding path sequences to the main path, and marking the shortest paths as comparison paths II;
Then, the third high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a second high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; sequentially forming all the shortest paths of the final destination of the transport paths sequenced in the corresponding path sequences to the main path, and marking the shortest paths as comparison paths III;
step three: obtaining a comparison path I, a comparison path II and a comparison path III, and then obtaining a transport path combination currently in use, and marking the transport path combination as a current path; the path switching analysis is carried out by the following specific analysis modes:
According to the target times and the target lengths corresponding to the current paths, multiplying the target times commonly used by each transport path by the target lengths, and marking the obtained numerical value as the current total length;
The first new comparison path is obtained again, the target length of each new transport path is corresponding, and the target secondary value of each new transport path is assigned as the target secondary value of the corresponding final target transport path consistent with the final target transport path of the transport paths in the current path; that is, the first comparison path contains a plurality of new transport paths, each transport path is to mark its target number as the target number of the same transport path as the final target number of the transport path in the current path in use, and the two transport paths are simulated by the same numerical value, and the total length of one point of the comparison path can be obtained, and the obtained numerical value is marked as one longer than the total length of the comparison path;
obtaining a second comparison total length and a third comparison total length of the second comparison path and the third comparison path according to the first comparison path;
If the current total length is larger than any two values of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path;
And (3) in the analysis process from the first step to the third step, setting the time length for one time.
Step four: and finishing new path planning according to the transportation sorting channel with the updated path modification.
As an embodiment two of the present application, the present application is performed based on the embodiment one, and is different in that if the current total length is larger than any one of the first comparison total length, the second comparison total length and the third comparison total length, a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length is automatically marked as an update path;
At this time, the total length of the transportation path saved by the updated path running in comparison with the current path in the analysis period with the set time length is obtained, the updated path is marked as the saved length, when the saved length exceeds X2, a replacement signal is automatically generated, and at the moment, the current path is required to be modified into the updated path for sorting and transportation of logistics.
As an embodiment three of the present invention, the present embodiment is to combine the first embodiment and the second embodiment, and is different in that the present embodiment updates the path in the manner provided in the second embodiment, and if the saving length in the second embodiment does not exceed X2, the manner in the first embodiment is adopted to determine whether to update the path.
The application also provides a logistics scheduling management system of the intelligent warehouse, which adopts the logistics sorting and conveying method in the first to third embodiments to carry out logistics sorting and conveying.
The above embodiments are only for illustrating the technical method of the present invention and not for limiting the same, and it should be understood by those skilled in the art that the technical method of the present invention may be modified or substituted without departing from the spirit and scope of the technical method of the present invention.
Claims (7)
1. The logistics scheduling management method for intelligent storage is characterized by comprising the following steps of:
acquiring all transport paths currently running, and acquiring target times, target single times and target lengths of all transport paths in an observation period;
The transportation path comprises a start mark and a final mark, wherein the start mark is the start point, and the final mark is the end point in the corresponding sorting process; the number of times of transporting the package in the corresponding transport path in the corresponding observation period is denoted by the target number of times, the package forms a target number of times, the target number of times is denoted by the number of days in the corresponding observation period, and the target length is denoted by the length of the corresponding transport path;
Determining a daily transport value according to the target single time and the target length of the transport path, determining the considered value of the corresponding transport path according to the daily transport value, obtaining a path sequence according to the descending order of the considered values of all the transport paths, and marking the transport paths of the first three of the path sequences as high-frequency paths;
sequentially taking the shortest path from the final mark to the start mark in the high-frequency path as a main path, sequentially determining other paths according to the main path and the path sequence, and carrying out path reconstruction to obtain a comparison path I, a comparison path II and a comparison path III;
Confirming whether to change the transportation path according to the length relation among the current path, the comparison path I, the comparison path II and the comparison path III, and determining an updated path;
The specific mode for determining the daily transport value according to the target single time and the target length of the transport path is as follows:
first, the transport paths are marked as Li, i=1, &, n, representing that n transport paths exist, each transport path corresponding to one target sub-set and a group of target single sub-sets;
optionally, a transport path is selected, all target single times are obtained, and the formula is utilized: transportation measurement value = 0.6 x target single +0.4 x target length, resulting in daily transportation values Yj, j = 1,..m; the value of m here depends on the number of days of the observation period;
the average value of Yj is obtained, the average value is marked as P, the standard deviation of Yj is automatically calculated, and when the standard deviation is less than or equal to X1, the P is marked as a value;
If the standard deviation is greater than X1, at the moment, a value greater than P in Yj is obtained, the value is marked as an average value, the number smaller than P is marked as an average value, when the average value exceeds the average value, the value obtained by multiplying P by 1.25 is marked as a value, otherwise, the value obtained by multiplying P by 0.85 is marked as a value;
Obtaining the considered value of the corresponding transport path, and then carrying out the same treatment on all other transport paths to obtain the considered value of all transport paths;
The specific path reconstruction method comprises the following steps:
The method comprises the steps of obtaining a first high-frequency path sequenced in a path sequence, marking the shortest path from a final destination to a start destination as a main path, obtaining the final destination corresponding to a second high-frequency path, obtaining the shortest path from the final destination to the main path, marking the shortest path as a branch path, sequentially marking the shortest paths from the final destination to the main path of the transport path or the high-frequency path sequenced in the corresponding path sequence to form all new transport paths, and marking the shortest paths as comparison paths I;
Then, the second high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a third high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; sequentially forming all the shortest paths of the final destination of the transport paths sequenced in the corresponding path sequences to the main path, and marking the shortest paths as comparison paths II;
then, the third high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the start destination is marked as a main path, then, the final destination corresponding to the first high-frequency path sequenced in the path sequence is obtained, the shortest path from the final destination to the main path is obtained, and the transportation path of the first corresponding final destination is obtained; then, obtaining a final destination corresponding to a second high-frequency path in the path sequence, and obtaining a shortest path of the final destination reaching the main path to obtain a transport path corresponding to the final destination; and then sequentially forming the shortest path of the final destination of the transport paths sequenced in the corresponding path sequence to the main path to form all new transport paths, and marking the new transport paths as comparison paths III.
2. The logistics scheduling management method for intelligent warehousing according to claim 1, wherein the specific manner of determining the update path is:
According to the target times and the target lengths corresponding to the current paths, multiplying the target times commonly used by each transport path by the target lengths, and marking the obtained numerical value as the current total length;
The first new comparison path is obtained again, the target length of each new transport path is corresponding, and the target secondary value of each new transport path is assigned as the target secondary value of the corresponding final target transport path consistent with the final target transport path of the transport paths in the current path; that is, the first comparison path contains a plurality of new transport paths, each transport path is to mark its target number as the target number of the same transport path as the final target number of the transport path in the current path in use, and the two transport paths are simulated by the same numerical value, and the total length of one point of the comparison path can be obtained, and the obtained numerical value is marked as one longer than the comparison total length;
obtaining a second comparison total length and a third comparison total length of the second comparison path and the third comparison path according to the first comparison path;
and determining an updating path according to the magnitude relation between the current total length and the comparison total length I, the comparison total length II and the comparison total length III.
3. The logistics scheduling management method for intelligent warehousing of claim 1, wherein determining the updated path set time is performed once.
4. The logistic scheduling management method for intelligent warehouse according to claim 2, wherein the specific way of determining the update path is as follows according to the magnitude relation between the current total length and the comparison total length one, the comparison total length two and the comparison total length three:
And if the current total length is larger than any two numerical values of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum numerical value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path.
5. The logistic scheduling management method for intelligent warehouse according to claim 2, wherein the specific way of determining the update path is as follows according to the magnitude relation between the current total length and the comparison total length one, the comparison total length two and the comparison total length three:
If the current total length is larger than any one of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path;
At this time, the total length of the transportation path saved by the updated path running in comparison with the current path in the analysis period with the set time length is obtained, the updated path is marked as the saved length, when the saved length exceeds X2, a replacement signal is automatically generated, and at the moment, the current path is required to be modified into the updated path for sorting and transportation of logistics.
6. The logistic scheduling management method for intelligent warehouse according to claim 5, wherein when the saving length is not more than X2, the specific way of determining the update path is:
if the current total length is larger than any two values of the first comparison total length, the second comparison total length and the third comparison total length, automatically marking a path corresponding to the minimum value of the first comparison total length, the second comparison total length and the third comparison total length as an updated path, otherwise, not processing.
7. A logistics scheduling management system for intelligent storage, characterized in that the system adopts a logistics scheduling management method for intelligent storage according to any one of claims 1-6 to determine a logistics sorting path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410298034.7A CN117892897B (en) | 2024-03-15 | 2024-03-15 | Logistics scheduling management method and system for intelligent storage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410298034.7A CN117892897B (en) | 2024-03-15 | 2024-03-15 | Logistics scheduling management method and system for intelligent storage |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117892897A CN117892897A (en) | 2024-04-16 |
| CN117892897B true CN117892897B (en) | 2024-06-21 |
Family
ID=90641553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410298034.7A Active CN117892897B (en) | 2024-03-15 | 2024-03-15 | Logistics scheduling management method and system for intelligent storage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117892897B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117073706A (en) * | 2023-08-24 | 2023-11-17 | 腾讯科技（深圳）有限公司 | Path planning method, path planning device, electronic equipment, storage medium and program product |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106971244A (en) * | 2017-03-30 | 2017-07-21 | 华为技术有限公司 | A kind of logistics route planning method and equipment |
| CN115829476A (en) * | 2022-12-27 | 2023-03-21 | 合肥工业大学 | AR augmented reality-based intelligent logistics storage management method and system |
| CN117151482A (en) * | 2023-08-03 | 2023-12-01 | 国网河南省电力公司郑州供电公司 | Emergency material scheduling and path planning method based on multi-objective optimization |
| CN117670198A (en) * | 2023-12-13 | 2024-03-08 | 江苏菲达宝开电气股份有限公司 | Smart bin Chu Yunwei method and system |
-
2024
- 2024-03-15 CN CN202410298034.7A patent/CN117892897B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117073706A (en) * | 2023-08-24 | 2023-11-17 | 腾讯科技（深圳）有限公司 | Path planning method, path planning device, electronic equipment, storage medium and program product |
Non-Patent Citations (1)
| Title |
|---|
| 禁忌搜索算法下求解TTRP的邻域算子研究;边星驰;;武汉理工大学学报(信息与管理工程版);20200815(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117892897A (en) | 2024-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107168316B (en) | Multi-AGV dispatching system based on single-direction and two-direction mixed paths | |
| CN111596658A (en) | Multi-AGV collision-free operation path planning method and scheduling system | |
| CN111026128B (en) | Avoidance method of multi-laser AGV | |
| CN110471417B (en) | Multi-AGV collision prevention method based on load balancing | |
| CN111882215B (en) | Personalized customization flexible job shop scheduling method containing AGV | |
| CN107179773A (en) | A kind of AGV avoidance dispatch control method and system | |
| CN109782757A (en) | A kind of path dispatching method of more AGV systems based on subsection scheduling | |
| CN116050690B (en) | OHT trolley path planning method, OHT trolley path planning device and terminal | |
| CN109976320A (en) | A kind of more AGV paths planning methods based on time window on-line amending | |
| CN111007862B (en) | Path planning method for cooperative work of multiple AGVs | |
| CN111768629B (en) | Vehicle scheduling method, device and system | |
| CN112036756A (en) | Double-load multi-AGV scheduling method | |
| CN108985497A (en) | A kind of method and system for planning of AGV intelligent transport vehicle quantity and charging pile quantity | |
| CN105527947A (en) | Slab-yard tracking and management system | |
| CN104346658A (en) | Automatic trolley storage system scheduling method based on improved dynamic banker's algorithm | |
| CN117314283B (en) | Material distribution method, device and system for mixed flow assembly workshop and storage medium | |
| CN108596385A (en) | The queuing strategy and device of vehicle, readable medium, logistics system | |
| CN109144051A (en) | The more AGV dispatching methods of integrality and system under warehouse logistics environment | |
| CN117635000B (en) | LMS production logistics scheduling method based on industrial Internet | |
| CN117892897B (en) | Logistics scheduling management method and system for intelligent storage | |
| CN115983603A (en) | Intelligent scheduling algorithm, system, equipment and storage medium for container port transshipment | |
| CN113762597A (en) | Intelligent AGV (automatic guided vehicle) scheduling system and method based on cloud platform management | |
| Homayouni et al. | Integrated scheduling of SP-AS/RS and handling equipment in automated container terminals | |
| CN113743788A (en) | Industrial vehicle scheduling method based on improved genetic algorithm | |
| CN114418400A (en) | Intelligent dynamic dispatching system for freight vehicle |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |