CN112785212A - Transportation equipment management method and device - Google Patents
Transportation equipment management method and device Download PDFInfo
- Publication number
- CN112785212A CN112785212A CN201911076134.0A CN201911076134A CN112785212A CN 112785212 A CN112785212 A CN 112785212A CN 201911076134 A CN201911076134 A CN 201911076134A CN 112785212 A CN112785212 A CN 112785212A
- Authority
- CN
- China
- Prior art keywords
- task
- target
- carrying
- tasks
- equipment
- 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.)
- Pending
Links
- 238000007726 management method Methods 0.000 title claims abstract description 21
- 238000003860 storage Methods 0.000 claims abstract description 24
- 238000000034 method Methods 0.000 claims abstract description 18
- 238000005520 cutting process Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 9
- 230000000694 effects Effects 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000012546 transfer Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000011144 upstream manufacturing Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012856 packing Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
Abstract
The invention discloses a transportation equipment management method and device, and relates to the field of storage logistics. One embodiment of the method comprises: acquiring a carrying task, and determining a target task from a set formed by all the carrying tasks; determining a target equipment matched with the target task from the set of all available transport equipment, and determining a target point matched with the target task from the set of all unloading points; and executing the target task matched with the target equipment by using the target equipment, and after the target task is completed, moving to a target point matched with the target task for unloading. According to the implementation mode, the technical means that the target carrying task is determined firstly, and then the transport equipment and the unloading point matched with the carrying task are determined by adopting the preset matching algorithm is adopted, so that the transport equipment can have the shortest total driving distance under the condition that the maximum carrying tasks are executed currently, the efficiency of carrying operation is improved, and the technical effect of ex-warehouse efficiency is further improved.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a transportation equipment management method and device.
Background
In the storage and picking link, after the upstream system issues the carrying task, the transport equipment carries according to the carrying task, namely, according to the required articles in the carrying task, the transport equipment goes to a corresponding picking point to pick the articles, when all the articles in the picking task are picked, the transport equipment goes to a discharging point in the warehouse to discharge the articles, and the carrying task of the transport equipment is finished.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
in the prior art, the mode of sequentially scheduling the carrying tasks and randomly matching the transportation equipment, the carrying tasks and the unloading points may cause the travel path of the transportation equipment to be lengthened, and further cause the order delivery efficiency to be lowered.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for managing transportation equipment, which can provide an efficient algorithm for matching transportation equipment, a transportation task, and an unloading point, so that a total travel path of the transportation equipment for performing the transportation task is shortened, and further, efficiency of transportation operation is improved, and efficiency of delivery is improved.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a transportation device management method including:
acquiring a carrying task, and determining a target task from a set formed by all the carrying tasks;
determining a target equipment matched with the target task from the set of all available transport equipment, and determining a target point matched with the target task from the set of all unloading points;
and executing the target task matched with the target equipment by using the target equipment, and after the target task is completed, moving to a target point matched with the target task for unloading.
Optionally, determining the target task from the set of all the transport tasks includes:
obtaining the number value N of available transport equipment from the carrying task information1And a total number of transporting tasks value N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
Alternatively, N1≤N2Then, N is selected from all the transport tasks1The transport task, as the target task, includes:
based on the order cutting time of each carrying task in all the carrying tasks, arranging the carrying tasks in the order of the order cutting time from first to last to obtain a first initial task sequence;
traversing the first initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time exists, arranging each carrying task in the subsequence according to the sequence of the task issuing time of each carrying task in the subsequence from first to last to obtain a second initial task sequence;
traversing the second initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time and the same task issuing time exists, determining a congestion value of each carrying task in the subsequence based on the total roadway pre-occupation information of all the carrying tasks in the subsequence and the estimated occupied roadway information of each carrying task, and arranging each carrying task in the subsequence according to the sequence of the congestion values from small to large to obtain a third initial task sequence;
selecting top N from the third initial sequence of tasks1And taking the individual carrying task as the target task.
Optionally, determining a congestion value of each carrying task in the subsequence based on the total pre-occupation information of the lanes and the expected occupation lane information in the carrying tasks, including:
determining a total pre-occupied roadway number value according to the roadway total pre-occupied information, and determining a task pre-occupied roadway number value expected to be occupied in each carrying task according to the expected occupied roadway information;
and determining the coincidence degree of the task pre-occupation roadway and the total pre-occupation roadway of each carrying task as the congestion value of each carrying task according to the total pre-occupation roadway number value and the task pre-occupation roadway number value.
Optionally, based on preset constraint conditions, determining a target device matched with the target task from a set of all available transport devices, and determining a target point matched with the target task from a set of all unloading points;
the constraint conditions are as follows:
the total distance from each target task to the target equipment matched with the target task and the total distance from the target task to the target point matched with the target task are minimum; and the number of the first and second electrodes,
the matching number of the target tasks and the target equipment is equal to the matching number of the target tasks and the target points; and the number of the first and second electrodes,
each target task has a target device uniquely matched with the target task and a target point uniquely matched with the target task.
Optionally, the following algorithm is adopted to determine the task center point information of the target task:
wherein X represents a set formed by coordinates of all picking points in the task, | X | represents the number of all picking points in the task, and X represents the coordinate of the xth picking point in X; r represents the task center point coordinates of the target task.
According to still another aspect of an embodiment of the present invention, there is provided a transportation device management apparatus including:
the task determining module is used for acquiring the carrying tasks and determining a target task from a set formed by all the carrying tasks;
a matching module for determining a target device matching the target task from a set of all available transport devices and a target point matching the target task from a set of all unloading points;
and the execution module is used for executing the target task matched with the target equipment by using the target equipment and going to a target point matched with the target task for unloading after the target task is completed.
Optionally, the task determining module determines the target task from a set of all the transportation tasks, including:
from the carrierObtaining the number value N of available transport equipment in the transport task information1And a total number of transporting tasks value N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
Alternatively, N1≤N2Then, the task determination module selects N from all the transport tasks1The transport task, as the target task, includes:
based on the order cutting time of each carrying task in all the carrying tasks, arranging the carrying tasks in the order of the order cutting time from first to last to obtain a first initial task sequence;
traversing the first initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time exists, arranging each carrying task in the subsequence according to the sequence of the task issuing time of each carrying task in the subsequence from first to last to obtain a second initial task sequence;
traversing the second initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time and the same task issuing time exists, determining a congestion value of each carrying task in the subsequence based on the total roadway pre-occupation information of all the carrying tasks in the subsequence and the estimated occupied roadway information of each carrying task, and arranging each carrying task in the subsequence according to the sequence of the congestion values from small to large to obtain a third initial task sequence;
selecting top N from the third initial sequence of tasks1And taking the individual carrying task as the target task.
Optionally, the task determining module determines a congestion value of each transport task in the subsequence based on the total pre-occupation information of the lanes and the information of the expected occupied lanes in the transport tasks, and includes:
determining a total pre-occupied roadway number value according to the roadway total pre-occupied information, and determining a task pre-occupied roadway number value expected to be occupied in each carrying task according to the expected occupied roadway information;
and determining the coincidence degree of the task pre-occupation roadway and the total pre-occupation roadway of each carrying task as the congestion value of each carrying task according to the total pre-occupation roadway number value and the task pre-occupation roadway number value.
Optionally, the matching module determines a target device matched with the target task from a set of all available transport devices and a target point matched with the target task from a set of all unloading points based on preset constraint conditions;
the constraint conditions are as follows:
the total distance from each target task to the target equipment matched with the target task and the total distance from the target task to the target point matched with the target task are minimum; and the number of the first and second electrodes,
the matching number of the target tasks and the target equipment is equal to the matching number of the target tasks and the target points; and the number of the first and second electrodes,
each target task has a target device uniquely matched with the target task and a target point uniquely matched with the target task.
Optionally, the matching module determines task center point information of the target task by using the following algorithm:
wherein X represents a set formed by coordinates of all picking points in the task, | X | represents the number of all picking points in the task, and X represents the coordinate of the xth picking point in X; r represents the task center point coordinates of the target task.
According to another aspect of an embodiment of the present invention, there is provided a transportation device management electronic device including:
one or more processors;
a storage device for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors implement the transportation device management method provided by the present invention.
According to still another aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing the transportation device management method provided by the present invention.
One embodiment of the above invention has the following advantages or benefits: because the technical means of firstly determining the target carrying task and then determining the transport equipment and the unloading point matched with the carrying task by adopting the preset matching algorithm is adopted, the technical problem that in the prior art, the carrying tasks are sequentially scheduled and randomly matched with the transport equipment and the unloading point for the carrying task, so that the task execution efficiency is low is solved, the transport equipment can have the shortest total driving distance under the condition of currently executing the most carrying tasks, and the technical effects of improving the carrying operation efficiency and further improving the ex-warehouse efficiency are achieved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic view of a main flow of a transportation device management method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the major modules of a transport equipment management apparatus according to an embodiment of the present invention;
FIG. 3 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 4 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of a main flow of a transportation device management method according to an embodiment of the present invention, as shown in fig. 1, including:
s101, acquiring a carrying task, and determining a target task from a set formed by all the carrying tasks;
step S102, determining target equipment matched with the target task from a set of all available transport equipment, and determining a target point matched with the target task from a set of all unloading points;
and S103, executing the matched target task by using the target equipment, and after the target task is finished, moving to a target point matched with the target task for unloading.
The carrying task can be a carrying task which is automatically generated and assigned by the warehousing and scheduling system and is not executed;
task items involved in a carrying task can be task items on different picking points or task items on the same picking point; for example: commodities in a supermarket warehouse, books in a library, and products in a factory warehouse.
The transportation equipment can be intelligent and automatic storage equipment and can be used for positioning, loading articles and/or automatically driving to a preset destination according to a set route; for example: a conveyor, an AGV (Automated Guided Vehicle), and the like;
the available transportation device may be a transportation device that is currently not tasked and that can function properly.
The unloading point can be a preset place where the transportation equipment needs to go to unload after completing a carrying task so as to carry out the next storage operation; for example: an automatic/manual packing workbench, an automatic/manual goods inspection area, an article transfer and storage area and the like.
The process of the transportation equipment performing the carrying task and going to the unloading point for unloading can be as follows: after the matching relation of the transport equipment, the transport task and the unloading point is determined, the upstream system calculates the running route of the transport equipment, so that the transport equipment can pick up the goods related to the transport task according to the running route, and when the goods in the transport task are confirmed to be picked up completely, the transport equipment goes to the unloading point according to the running route to unload the goods.
According to the invention, by adopting the technical means of firstly determining the target carrying task and then determining the transport equipment and the unloading point matched with the carrying task by adopting the preset matching algorithm, the transport equipment can have the shortest total driving distance under the condition of currently executing the most carrying tasks, so that the technical effects of improving the carrying operation efficiency and further improving the ex-warehouse efficiency are achieved.
In some embodiments, determining the target task from the set of all handling tasks comprises:
obtaining the number value N of available transport equipment from the carrying task information1And a total number of transporting tasks value N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
Comparing the number of available transport equipment with the number of handling tasks; when the number of available transportation equipment is large, all current carrying tasks can be used as target tasks to be executed; when the number of the carrying tasks is large, the carrying tasks with the number of the available transport equipment can be selected from the carrying tasks to be executed; therefore, the carrying tasks with the maximum number can be ensured to be determined as the target tasks, so that the corresponding transportation equipment can be found for each target task, and the situation that the transportation equipment matched with the carrying tasks cannot be found can not occur.
In some embodiments, N1≤N2Then, N is selected from all the transport tasks1The transport task, as the target task, includes:
based on the order cutting time of each carrying task in all the carrying tasks, arranging the carrying tasks in the order of the order cutting time from first to last to obtain a first initial task sequence;
traversing the first initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time exists, arranging each carrying task in the subsequence according to the sequence of the task issuing time of each carrying task in the subsequence from first to last to obtain a second initial task sequence;
traversing the second initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time and the same task issuing time exists, determining a congestion value of each carrying task in the subsequence based on the total roadway pre-occupation information of all the carrying tasks in the subsequence and the estimated occupied roadway information of each carrying task, and arranging each carrying task in the subsequence according to the sequence of the congestion values from small to large to obtain a third initial task sequence;
selecting top N from the third initial sequence of tasks1And taking the individual carrying task as the target task.
The principle of selecting the target task from all the transportation tasks can be regarded as follows: sorting all the carrying tasks according to three priorities of order intercepting time, issuing time and congestion value of the carrying tasks, and selecting the top N1Taking the individual carrying task as the target task;
specifically, the order cutting time of the carrying tasks is compared firstly, and the carrying tasks are sequenced according to the order from first to last of the order cutting time; when the order-intercepting time is the same, comparing the task issuing time of the carrying tasks, and sequencing the carrying tasks according to the sequence of the task issuing time of the carrying tasks from first to last for the carrying tasks with the same order-intercepting time; when the order intercepting time and the task issuing time are the same, comparing the congestion conditions of the transport tasks, which are expected to be generated for the roadway, namely comparing congestion values, and carrying the tasks in the sequence from small to large according to the congestion values of the transport tasksSorting is carried out; and then obtaining a final ordered sequence of the carrying tasks, and taking the first N of the sequence1And taking the individual carrying task as the target task.
The three types of the sorting of the carrying tasks are considered, so that the selection of the target task can be more reasonable.
In some embodiments, determining the congestion value for each of the transport tasks in the subsequence based on the total occupancy information for the lanes and the expected occupancy lane information in the transport tasks comprises:
determining a total pre-occupied roadway number value according to the roadway total pre-occupied information, and determining a task pre-occupied roadway number value expected to be occupied in each carrying task according to the expected occupied roadway information;
and determining the coincidence degree of the task pre-occupation roadway and the total pre-occupation roadway of each carrying task as the congestion value of each carrying task according to the total pre-occupation roadway number value and the task pre-occupation roadway number value.
In some practical application scenarios, the following algorithm may be adopted to determine the coincidence degree of each transport task in the subsequence as the congestion value of each transport task:
wherein, W0Can represent the total pre-occupation vector, W, corresponding to the roadway total pre-occupation informationpCan represent the pre-occupation vector corresponding to the predicted occupation roadway information in the p-th transport task, d (W)0,Wp) The congestion value of the p-th transport task may be represented. In an actual application scenario, each element in the total pre-occupation vector can be regarded as a tunnel, and for the tunnel in the warehouse, if the tunnel is occupied currently, the tunnel is set to be 1, otherwise, the tunnel is set to be 0; whether the roadway is occupied or not can be executed according to whether a carrying task where the picking point is located exists in the roadway or not;
for example: a storage area having 5 lanes, wherein the transfer tasks of the first and third lanes having picking points are determined to be performed, W0＝{1,0,1,0,0}；
Now there are two tasks A and B, where A is going to the first and second lane for picking, then WA1, {1,1,0,0,0 }; if task B needs to go to the fourth and fifth lanes for picking, then WB＝{0,0,0,1,1}；
Then, the congestion value for task A, i.e., tasks A and W0Cosine similarity d (W) of0,WA) Comprises the following steps:
congestion values for task B, tasks B and W are similarly calculated0Cosine similarity d (W) of0,WB)＝0；
Due to d (W)0,WA)＞d(W0,WB) For the current warehouse roadway condition, the task A is more likely to cause a congestion condition than the task B, and therefore during the production scheduling, the task B is preferentially scheduled.
It should be noted that: if all the roadways in the current warehouse are unoccupied, the congestion values of all the carrying tasks can be considered to be equal.
In some embodiments, based on preset constraints, a target equipment matched with the target task is determined from the set of all available transport equipment, and a target point matched with the target task is determined from the set of all unloading points;
the constraint conditions are as follows:
the total distance from each target task to the target equipment matched with the target task and the total distance from the target task to the target point matched with the target task are minimum; and the number of the first and second electrodes,
the matching number of the target tasks and the target equipment is equal to the matching number of the target tasks and the target points; and the number of the first and second electrodes,
each target task has a target device uniquely matched with the target task and a target point uniquely matched with the target task.
In some practical application scenarios, the constraint may be embodied by the following task matching algorithm:
min∑i∈I∑j∈Jdijxij+∑j∈J∑k∈Kcjkyjk；
therein, sigmaj∈Jxij≤1,
∑i∈Ixij≤1,
∑i∈I∑j∈Jxij≥min(N1,N2)；
∑k∈Kyjk≤1,
∑i∈Ixij＝∑k∈Kyjk,
xij∈{0,1},yjk∈{0,1},
k∈K；
Where I denotes the set of all available transport devices, N1Representing the number of all available transportation equipment, wherein I represents the ith available transportation equipment in I; j denotes the set of all target tasks, N2Representing the number of all target tasks, wherein J represents the jth target task in J; k represents a set formed by all unloading points, and K represents the kth unloading point in K; dijRepresenting the distance of the ith available transport device to the task center point of the jth target task, cjkRepresenting the distance from the task center point of the jth target task to the kth unloading point; if the ith available transportation equipment is the same as the jth target taskMatch then xij1, otherwise xij0; y if the jth target task matches the kth unload pointij1, otherwise yij＝0。
By applying the task matching algorithm, one target task can be matched with one transport device at most, one transport device can be matched with one target task at most, one target task can be matched with one unloading point at most, the finally determined matching number is the smaller value of the number of the target tasks and the number of the available transport devices, and the storage resources can be fully utilized;
for example, assuming that the number of target tasks is N, N target devices and M target points matched with the N target tasks may be calculated at one time by using the matching algorithm; wherein M is less than or equal to N, the target tasks are in one-to-one correspondence with the target devices, one target task has a unique target point corresponding to the target task, and one target point can correspond to one or more target tasks;
the task matching algorithm can determine the final matching result from all available transportation equipment and all unloading points at one time according to the determined target task, and the result is the shortest total route under the condition of ensuring the maximum matching quantity in all possible matching results, so that the running cost in the carrying operation is reduced, the efficiency of the carrying operation can be improved, and the technical effect of improving the ex-warehouse efficiency can be achieved.
In some embodiments, the task center point information of the target task is determined using the following algorithm:
wherein X represents a set formed by coordinates of all picking points in the task, | X | represents the number of all picking points in the task, and X represents the coordinate of the xth picking point in X; r represents the task center point coordinates of the target task.
When the center point of the conveying task is determined, the average value of the coordinates can be used as task center point information according to the coordinates of each sorting point in the conveying task; thus, the coordinate information of a conveying task can be obtained simply and quickly.
Fig. 2 is a schematic diagram of main modules of a transportation device management apparatus according to an embodiment of the present invention, as shown in fig. 2, including:
a task determining module 201, configured to obtain the transport tasks and determine a target task from a set of all the transport tasks;
a matching module 202 for determining a target equipment matching the target task from the set of all available transport equipments and a target point matching the target task from the set of all unloading points;
and the execution module 203 is configured to execute the target task matched with the target equipment by using the target equipment, and after the target task is completed, go to a target point matched with the target task to unload the target equipment.
The carrying task can be a carrying task which is automatically generated and assigned by the warehousing and scheduling system and is not executed;
task items involved in a carrying task can be task items on different picking points or task items on the same picking point; for example: commodities in a supermarket warehouse, books in a library, and products in a factory warehouse.
The transportation equipment can be intelligent and automatic storage equipment and can be used for positioning, loading articles and/or automatically driving to a preset destination according to a set route; for example: a conveyor, an AGV (Automated Guided Vehicle), and the like;
the available transportation device may be a transportation device that is currently not tasked and that can function properly.
The unloading point can be a preset place where the transportation equipment needs to go to unload after completing a carrying task so as to carry out the next storage operation; for example: an automatic/manual packing workbench, an automatic/manual goods inspection area, an article transfer and storage area and the like.
The process of the transportation equipment performing the carrying task and going to the unloading point for unloading can be as follows: after the matching relation of the transport equipment, the transport task and the unloading point is determined, the upstream system calculates the running route of the transport equipment, so that the transport equipment can pick up the goods related to the transport task according to the running route, and when the goods in the transport task are confirmed to be picked up completely, the transport equipment goes to the unloading point according to the running route to unload the goods.
According to the invention, by adopting the technical means of firstly determining the target carrying task and then determining the transport equipment and the unloading point matched with the carrying task by adopting the preset matching algorithm, the transport equipment can have the shortest total driving distance under the condition of currently executing the most carrying tasks, so that the technical effects of improving the carrying operation efficiency and further improving the ex-warehouse efficiency are achieved.
In some embodiments, the determine task module 201 determines the target task from a set of all handling tasks, including:
obtaining the number value N of available transport equipment from the carrying task information1And a total number of transporting tasks value N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
Comparing the number of available transport equipment with the number of handling tasks; when the number of available transportation equipment is large, all current carrying tasks can be used as target tasks to be executed; when the number of the carrying tasks is large, the carrying tasks with the number of the available transport equipment can be selected from the carrying tasks to be executed; therefore, the carrying tasks with the maximum number can be ensured to be determined as the target tasks, so that the corresponding transportation equipment can be found for each target task, and the situation that the transportation equipment matched with the carrying tasks cannot be found can not occur.
In some embodiments, N1≤N2Said determining taskThe module 201 selects N from all the transfer tasks1The transport task, as the target task, includes:
based on the order cutting time of each carrying task in all the carrying tasks, arranging the carrying tasks in the order of the order cutting time from first to last to obtain a first initial task sequence;
traversing the first initial task sequence, and if a sub-sequence formed by the carrying tasks with the same order cutting time exists; for each sub-sequence of the carrying tasks with the same order intercepting time, based on the task issuing time of each carrying task in the sub-sequence, arranging each carrying task in the sub-sequence according to the sequence of the task issuing time from first to last; obtaining a second initial task sequence;
traversing the second initial task sequence, and if a sub-sequence formed by the carrying tasks with the same order intercepting time and the same task issuing time exists; for each sub-sequence formed by the carrying tasks with the same order intercepting time and the same task issuing time, determining the congestion value of each carrying task in the sub-sequence based on the total pre-occupation information of the roadway and the estimated occupation roadway information in the carrying tasks, and arranging each carrying task in the sub-sequence according to the sequence of the congestion values from small to large; obtaining a third initial task sequence;
selecting top N from the third initial sequence of tasks1And taking the individual carrying task as the target task.
The principle of selecting the target task from all the transportation tasks can be regarded as follows: sorting all the carrying tasks according to three priorities of order intercepting time, issuing time and congestion value of the carrying tasks, and selecting the top N1Taking the individual carrying task as the target task;
specifically, the order cutting time of the carrying tasks is compared firstly, and the carrying tasks are sequenced according to the order from first to last of the order cutting time; when the order-intercepting time is the same, comparing the task issuing time of the carrying tasks, and sequencing the carrying tasks according to the sequence of the task issuing time of the carrying tasks from first to last for the carrying tasks with the same order-intercepting time; when the order intercepting time and the task issuing time are the same, comparing the transport taskThe method comprises the steps that traffic congestion conditions which are expected to be generated in a roadway are compared, and carrying tasks are sequenced according to the sequence of the congestion values of the carrying tasks from small to large; and then obtaining a final ordered sequence of the carrying tasks, and taking the first N of the sequence1And taking the individual carrying task as the target task.
The three types of the sorting of the carrying tasks are considered, so that the selection of the target task can be more reasonable.
In some embodiments, the task determining module 201 determines the congestion value of each transport task in the subsequence based on the total lane occupancy information and the expected occupancy lane information in the transport tasks, including:
determining a total pre-occupied roadway number value according to the roadway total pre-occupied information, and determining a task pre-occupied roadway number value expected to be occupied in each carrying task according to the expected occupied roadway information;
and determining the coincidence degree of the task pre-occupation roadway and the total pre-occupation roadway in each task as the congestion value of each carrying task according to the total pre-occupation roadway number value and the task pre-occupation roadway number value.
In some practical application scenarios, the following algorithm may be adopted to determine the coincidence degree of each transport task in the subsequence as the congestion value of each transport task:
wherein, W0Can represent the total pre-occupation vector, W, corresponding to the roadway total pre-occupation informationpCan represent the pre-occupation vector corresponding to the predicted occupation roadway information in the p-th transport task, d (W)0,Wp) The congestion value of the p-th transport task may be represented. In the context of a practical application,
each element in the total pre-occupation vector can be regarded as a tunnel, and for the tunnel in the warehouse, if the tunnel is occupied currently, the tunnel is set as 1, otherwise, the tunnel is set as 0; whether the roadway is occupied or not can be executed according to whether a carrying task where the picking point is located exists in the roadway or not;
for example: a storage area having 5 lanes, wherein the transfer tasks of the first and third lanes having picking points are determined to be performed, W0＝{1,0,1,0,0}；
Now there are two tasks A and B, where A is going to the first and second lane for picking, then WA1, {1,1,0,0,0 }; if task B needs to go to the fourth and fifth lanes for picking, then WB＝{0,0,0,1,1}；
Then, the congestion value for task A, i.e., tasks A and W0Cosine similarity d (W) of0,WA) Comprises the following steps:
congestion values for task B, tasks B and W are similarly calculated0Cosine similarity d (W) of0,WB)＝0；
Due to d (W)0,WA)＞d(W0,WB) For the current warehouse roadway condition, the task A is more likely to cause a congestion condition than the task B, and therefore during the production scheduling, the task B is preferentially scheduled.
It should be noted that: if all the roadways in the current warehouse are unoccupied, the congestion values of all the carrying tasks can be considered to be equal.
In some embodiments, the matching module 202 determines a target device matching the target task from the set of all available transport devices and a target point matching the target task from the set of all unloading points based on preset constraints;
the constraint conditions are as follows:
the distance from each target task to the target equipment matched with the target task is added with the distance from each target task to the target point matched with the target task, and the obtained total distance value is minimum; and the number of the first and second electrodes,
the matching number of the target tasks and the target equipment is equal to the matching number of the target tasks and the target points; and the number of the first and second electrodes,
each target task has a target device uniquely matched with the target task and a target point uniquely matched with the target task.
In some practical application scenarios, the constraint may be embodied by the following task matching algorithm:
min∑i∈I∑j∈Jdijxij+∑j∈J∑k∈Kcjkyjk；
therein, sigmaj∈Jxij≤1,
∑i∈Ixij≤1,
∑i∈I∑j∈Jxij≥min(N1,N2)；
∑k∈Kyjk≤1,
∑i∈Ixij＝∑k∈Kyjk,
xij∈{0,1},yjk∈{0,1},
k∈K；
Where I denotes the set of all available transport devices, N1Representing the number of all available transportation equipment, wherein I represents the ith available transportation equipment in I; j denotes the set of all target tasks, N2Representing the number of all target tasks, wherein J represents the jth target task in J; k represents the set of all unloading points, and K represents the kth unloading point in KA discharge point; dijRepresenting the distance of the ith available transport device to the task center point of the jth target task, cjkRepresenting the distance from the task center point of the jth target task to the kth unloading point; x if the ith available transport device matches the jth target taskij1, otherwise xij0; y if the jth target task matches the kth unload pointij1, otherwise yij＝0。
By applying the task matching algorithm, one target task can be matched with one transport device at most, one transport device can be matched with one target task at most, one target task can be matched with one unloading point at most, the finally determined matching number is the smaller value of the number of the target tasks and the number of the available transport devices, and the storage resources can be fully utilized;
for example, assuming that the number of target tasks is N, N target devices and M target points matched with the N target tasks may be calculated at one time by using the matching algorithm; wherein M is less than or equal to N, the target tasks are in one-to-one correspondence with the target devices, one target task has a unique target point corresponding to the target task, and one target point can correspond to one or more target tasks;
the task matching algorithm can determine the final matching result from all available transportation equipment and all unloading points at one time according to the determined target task, and the result is the shortest total route under the condition of ensuring the maximum matching quantity in all possible matching results, so that the running cost in the carrying operation is reduced, the efficiency of the carrying operation can be improved, and the technical effect of improving the ex-warehouse efficiency can be achieved.
In some embodiments, the matching module 202 determines the task center point information of the target task using the following algorithm:
wherein X represents a set formed by coordinates of all picking points in the task, | X | represents the number of all picking points in the task, and X represents the coordinate of the xth picking point in X; r represents the task center point coordinates of the target task.
When the center point of the conveying task is determined, the average value of the coordinates can be used as task center point information according to the coordinates of each sorting point in the conveying task; thus, the coordinate information of a conveying task can be obtained simply and quickly.
Fig. 3 shows an exemplary system architecture 300 to which the transportation device management method or the transportation device management apparatus of the embodiments of the present invention may be applied.
As shown in fig. 3, the system architecture 300 may include terminal devices 301, 302, 303, a network 304, and a server 305. The network 304 serves as a medium for providing communication links between the terminal devices 301, 302, 303 and the server 305. Network 304 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal device 301, 302, 303 to interact with the server 305 via the network 304 to receive or send messages or the like. The terminal devices 301, 302, 303 may have various communication client applications installed thereon, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like.
The terminal devices 301, 302, 303 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 305 may be a server that provides various services. The background management server can analyze and process the received data such as the product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that the transportation device management method provided by the embodiment of the present invention is generally executed by the server 305, and accordingly, the transportation device management apparatus is generally disposed in the server 305.
It should be understood that the number of terminal devices, networks, and servers in fig. 3 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 4, a block diagram of a computer system 400 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 4, the computer system 400 includes a Central Processing Unit (CPU)401 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 401.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a task determination module, a matching module, and an execution module. The names of these modules do not form a limitation on the module itself in some cases, for example, the determination task module may also be described as a "module that sends a picture acquisition request to a connected server".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: s101, acquiring a carrying task, and determining a target task from a set formed by all the carrying tasks; step S102, determining target equipment matched with the target task from a set of all available transport equipment, and determining a target point matched with the target task from a set of all unloading points; and S103, executing the matched target task by using the target equipment, and after the target task is finished, moving to a target point matched with the target task for unloading.
According to the technical scheme of the embodiment of the invention, as the technical means of firstly determining the target carrying task and then determining the transport equipment and the unloading point matched with the carrying task by adopting the preset matching algorithm is adopted, the technical problem of low task execution efficiency caused by sequentially scheduling the carrying tasks and randomly matching the transport equipment and the unloading point for the carrying task in the prior art is solved, so that the transport equipment can have the shortest total driving distance under the condition of currently executing the most carrying tasks, and the technical effects of improving the carrying operation efficiency and further improving the ex-warehouse efficiency are achieved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A transportation device management method, comprising:
acquiring a carrying task, and determining a target task from a set formed by all the carrying tasks;
determining a target equipment matched with the target task from the set of all available transport equipment, and determining a target point matched with the target task from the set of all unloading points;
and executing the target task matched with the target equipment by using the target equipment, and after the target task is completed, moving to a target point matched with the target task for unloading.
2. The method of claim 1, wherein determining a target task from the set of all handling tasks comprises:
obtaining the number value N of available transport equipment from the carrying task information1And total number of transporting tasksMagnitude N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
3. The method of claim 2, wherein N is1≤N2Then, N is selected from all the transport tasks1The transport task, as the target task, includes:
based on the order cutting time of each carrying task in all the carrying tasks, arranging the carrying tasks in the order of the order cutting time from first to last to obtain a first initial task sequence;
traversing the first initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time exists, arranging each carrying task in the subsequence according to the sequence of the task issuing time of each carrying task in the subsequence from first to last to obtain a second initial task sequence;
traversing the second initial task sequence, if a subsequence formed by the carrying tasks with the same order intercepting time and the same task issuing time exists, determining a congestion value of each carrying task in the subsequence based on the total roadway pre-occupation information of all the carrying tasks in the subsequence and the estimated occupied roadway information of each carrying task, and arranging each carrying task in the subsequence according to the sequence of the congestion values from small to large to obtain a third initial task sequence;
selecting top N from the third initial sequence of tasks1And taking the individual carrying task as the target task.
4. The method of claim 3, wherein determining the congestion value for each of the transport tasks in the subsequence based on the total roadway occupancy information and the expected occupancy roadway information in the transport tasks comprises:
determining a total pre-occupied roadway number value according to the roadway total pre-occupied information, and determining a task pre-occupied roadway number value expected to be occupied in each carrying task according to the expected occupied roadway information;
and determining the coincidence degree of the task pre-occupation roadway and the total pre-occupation roadway of each carrying task as the congestion value of each carrying task according to the total pre-occupation roadway number value and the task pre-occupation roadway number value.
5. A method according to claim 2, characterized by determining a target equipment matching the target task from the set of all available transport equipment and a target point matching the target task from the set of all unloading points, based on preset constraints;
the constraint conditions are as follows:
the total distance from each target task to the target equipment matched with the target task and the total distance from the target task to the target point matched with the target task are minimum; and the number of the first and second electrodes,
the matching number of the target tasks and the target equipment is equal to the matching number of the target tasks and the target points; and the number of the first and second electrodes,
each target task has a target device uniquely matched with the target task and a target point uniquely matched with the target task.
6. The method of claim 5, wherein the task center point information of the target task is determined using the following algorithm:
wherein X represents a set formed by coordinates of all picking points in the task, X represents the coordinate of the xth picking point in the X, and | X | represents the number of all picking points in the task; r represents the task center point coordinates of the target task.
7. A transportation device management apparatus, comprising:
the task determining module is used for acquiring the carrying tasks and determining a target task from a set formed by all the carrying tasks;
a matching module for determining a target device matching the target task from a set of all available transport devices and a target point matching the target task from a set of all unloading points;
and the execution module is used for executing the target task matched with the target equipment by using the target equipment and going to a target point matched with the target task for unloading after the target task is completed.
8. The apparatus of claim 7, wherein the task-determination module determines a target task from a set of all handling tasks, comprising:
obtaining the number value N of available transport equipment from the carrying task information1And a total number of transporting tasks value N2；
N1＞N2Taking all the conveying tasks as the target tasks;
N1≤N2then, N is selected from all the transport tasks1And the conveying task is taken as the target task.
9. A transportation device management electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911076134.0A CN112785212A (en) | 2019-11-06 | 2019-11-06 | Transportation equipment management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911076134.0A CN112785212A (en) | 2019-11-06 | 2019-11-06 | Transportation equipment management method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112785212A true CN112785212A (en) | 2021-05-11 |
Family
ID=75748869
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911076134.0A Pending CN112785212A (en) | 2019-11-06 | 2019-11-06 | Transportation equipment management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112785212A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116957298A (en) * | 2023-09-19 | 2023-10-27 | 江苏润和软件股份有限公司 | Industrial Internet of things equipment control method and control system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106447186A (en) * | 2016-09-21 | 2017-02-22 | 广东工业大学 | Method and device of task assignment of transportation devices in intelligent warehousing |
| CN108398924A (en) * | 2017-02-08 | 2018-08-14 | 北京京东尚科信息技术有限公司 | The dispatching method and dispatching device of robot carrier |
| CN109784802A (en) * | 2018-12-10 | 2019-05-21 | 北京航天智造科技发展有限公司 | A kind of industry spot logistics legal method and device |
| WO2019100637A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东尚科信息技术有限公司 | Method and apparatus for outputting storage position information |
| CN110045722A (en) * | 2018-01-15 | 2019-07-23 | 北京京东尚科信息技术有限公司 | The method and apparatus for generating scheduling information |
| CN110197351A (en) * | 2018-02-26 | 2019-09-03 | 北京京东尚科信息技术有限公司 | A kind of article warehouse-out method and device |
| CN110348661A (en) * | 2018-04-08 | 2019-10-18 | 北京京东尚科信息技术有限公司 | A kind of method for allocating tasks and device for transport of storing in a warehouse |
| CN110378635A (en) * | 2018-08-03 | 2019-10-25 | 天津京东深拓机器人科技有限公司 | A kind of schedule management method and device of transporting equipment |
-
2019
- 2019-11-06 CN CN201911076134.0A patent/CN112785212A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106447186A (en) * | 2016-09-21 | 2017-02-22 | 广东工业大学 | Method and device of task assignment of transportation devices in intelligent warehousing |
| CN108398924A (en) * | 2017-02-08 | 2018-08-14 | 北京京东尚科信息技术有限公司 | The dispatching method and dispatching device of robot carrier |
| WO2019100637A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东尚科信息技术有限公司 | Method and apparatus for outputting storage position information |
| CN110045722A (en) * | 2018-01-15 | 2019-07-23 | 北京京东尚科信息技术有限公司 | The method and apparatus for generating scheduling information |
| CN110197351A (en) * | 2018-02-26 | 2019-09-03 | 北京京东尚科信息技术有限公司 | A kind of article warehouse-out method and device |
| CN110348661A (en) * | 2018-04-08 | 2019-10-18 | 北京京东尚科信息技术有限公司 | A kind of method for allocating tasks and device for transport of storing in a warehouse |
| CN110378635A (en) * | 2018-08-03 | 2019-10-25 | 天津京东深拓机器人科技有限公司 | A kind of schedule management method and device of transporting equipment |
| CN109784802A (en) * | 2018-12-10 | 2019-05-21 | 北京航天智造科技发展有限公司 | A kind of industry spot logistics legal method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116957298A (en) * | 2023-09-19 | 2023-10-27 | 江苏润和软件股份有限公司 | Industrial Internet of things equipment control method and control system |
| CN116957298B (en) * | 2023-09-19 | 2023-11-28 | 江苏润和软件股份有限公司 | Industrial Internet of Things equipment control method and control system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106980955B (en) | Method and apparatus for outputting information | |
| JP7072054B2 (en) | Methods and equipment for sorting cargo | |
| CN110197350B (en) | Article delivery method and device | |
| CN110533353B (en) | Method and device for handling shelves | |
| CN110371548B (en) | Goods warehousing method and device | |
| CN110858073B (en) | Dispatching method and dispatching device for automatic guided vehicles | |
| WO2020164319A1 (en) | Goods pickup method and device | |
| CN110348650B (en) | Order converging method and device | |
| CN110766348A (en) | Method and device for combining picking tasks | |
| CN110871980B (en) | Storage classification method and device | |
| CN112785212A (en) | Transportation equipment management method and device | |
| CN112551015B (en) | Method and device for rotating goods shelf in carrying process | |
| CN113222205A (en) | Path planning method and device | |
| CN112474368B (en) | Goods picking method, device, equipment and computer readable medium | |
| CN112529346A (en) | Task allocation method and device | |
| CN112785213B (en) | Warehouse manifest picking construction method and device | |
| CN113837658A (en) | Article shelving method and device | |
| CN113759890A (en) | Control method and device for transport device | |
| CN110276508B (en) | Method and device for distributing task information | |
| CN111768065A (en) | Method and device for distributing goods sorting tasks | |
| CN113554373A (en) | Method and device for managing ex-warehouse of three-dimensional warehouse | |
| CN113379173A (en) | Method and apparatus for labeling warehouse goods | |
| CN113554380A (en) | Method and device for positioning articles in warehouse-out process | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN111144602A (en) | Vehicle scheduling method and device |
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 |