Method, system and equipment for optimizing stock counting and returning sequence of goods physical objects and storage medium

Abstract

The invention provides a method, a system and equipment for optimizing a goods physical checking and warehouse returning sequence, and a storage medium, and belongs to the technical field of automatic control. The method comprises the steps of obtaining a cargo code of a target cargo which currently executes a warehouse returning operation, querying a cargo allocation mapping table according to the cargo code to obtain an original target cargo allocation of the target cargo, judging whether cargoes with the same cargo allocation group as the target cargo exist in a task queue or not according to the target cargo allocation, and when the goods in the same goods allocation group as the target goods exist in the task queue, whether goods located on the inner side of the target goods allocation exist in the goods which are not warehoused in the same goods allocation group as the target goods or not is judged, and when the goods located on the inner side of the target goods allocation exist, the target goods allocation of the target goods is replaced with the goods allocation located on the inner side of the target goods allocation. Therefore, the stacker performs warehouse returning operation on the target goods according to the replaced target goods allocation, and the situation that the goods allocation channel is blocked by the goods on the outer side of the same goods allocation group during warehouse returning is reduced.

Description

Technical Field

[0001] This application relates to the field of automation control technology, and particularly relates to a method, system, device, and storage medium for optimizing the return order of physical inventory of goods. Background Art

[0002] A multi-depth stereoscopic warehouse is a stereoscopic warehouse with multiple storage positions, that is, a warehouse is distributed with multiple cargo location groups, and each cargo location group is provided with multiple cargo locations. Taking a double-depth stereoscopic warehouse as an example, two storage positions, namely a near cargo position and a far cargo position, also called sibling cargo positions, are set on each shelf, thereby improving the space utilization rate and the operation efficiency of the warehouse. In the general management of a goods warehouse, the same cargo location group generally stores goods of the same type and the same batch. In this case, there is no strict requirement for the storage location of the goods in the same cargo location group.

[0003] In the scenario where a physical inventory of goods is required, first, the stacker in the aisle unloads the goods onto the conveyor belt, and then the operator unloads the goods on the conveyor belt onto the platform or the preparation area. When performing the inventory return, it is required that the goods be placed back in the original cargo position. Generally, it is required that the operator place the goods on the conveyor belt in the reverse order of outbound, and then the stacker puts the goods into the cargo position. If the operator does not return the goods to the warehouse in the original unloading order when reloading the goods onto the shelf, it may cause the cargo position passage of the goods to be blocked by the outer goods in the same cargo location group. Summary of the Invention

[0004] The main purpose of the embodiments of this application is to propose a method, system, device, and storage medium for optimizing the return order of physical inventory of goods, aiming to reduce the situation where the cargo position passage is blocked by the outer goods in the same cargo location group during the warehouse inventory return.

[0005] To achieve the above object, on the one hand, an embodiment of this application proposes a method for optimizing the return order of physical inventory of goods, including the following steps:

[0006] Obtain the goods code of the target goods currently performing the return operation;

[0007] Query the cargo position mapping table according to the goods code to obtain the original target cargo position of the target goods, where the cargo position mapping table is used to store the corresponding relationship between the goods code and the storage cargo position;

[0008] Judge whether there are goods in the same cargo location group as the target goods in the task queue according to the target cargo position, where the task queue includes the goods codes of the goods not yet stored in the warehouse;

[0009] When there are goods in the same cargo location group as the target goods in the task queue, judge whether there are goods located inside the target cargo position among the goods not yet stored in the warehouse in the same cargo location group as the target goods;

[0010] When there is goods inside the target storage location, replace the target storage location of the target goods with the storage location inside the target storage location, so that the stacker performs the operation of returning the target goods to the warehouse according to the replaced target storage location.

[0011] In some embodiments, the method for optimizing the sequence of physical inventory and returning goods to the warehouse further includes the following steps:

[0012] Determine whether a feedback on the operation of returning the target goods is received, where the feedback on the operation of returning the goods indicates that the target goods have been placed on the storage location;

[0013] When the feedback on the operation of returning the goods is received, delete the goods code of the target goods from the task queue.

[0014] In some embodiments, determining whether there is goods in the task queue that have the same storage location group as the target goods according to the target storage location includes the following steps:

[0015] Query the storage location mapping table according to all the goods codes in the task queue to obtain the storage location where each good in the task queue is stored, where the storage location is represented in the form of a prefix and a suffix, the prefix represents the storage location group number, and the suffix represents the storage location number;

[0016] According to the prefixes of the storage locations where all the goods in the task queue except the target goods are stored, determine whether there is a prefix that is the same as the target storage location;

[0017] When there is a prefix that is the same as the target storage location, determine that there is goods in the task queue that have the same storage location group as the target goods;

[0018] When there is no prefix that is the same as the target storage location, determine that there is no goods in the task queue that have the same storage location group as the target goods.

[0019] In some embodiments, determining whether there is goods inside the target storage location among the goods that have not been put into the warehouse and have the same storage location group as the target goods includes the following steps:

[0020] Extract the storage locations with the same prefix as the target goods from the storage locations where all the goods in the task queue are stored;

[0021] Sort the suffixes of all the extracted storage locations in a preset order to obtain a data sequence, where the preset order is the order of the storage location numbers of the storage location groups from the inside to the outside;

[0022] When the suffix of the target storage location is at the first position of the data sequence, it is determined that there is no goods located inside the target storage location among the unwarehoused goods in the same storage location group as the target goods;

[0023] When the suffix of the target storage location is not at the first position of the data sequence, it is determined that there is goods located inside the target storage location among the unwarehoused goods in the same storage location group as the target goods.

[0024] In some embodiments, the task queue includes a first sub-queue and a second sub-queue, and the task queue is obtained through the following steps:

[0025] Create a first sub-queue, and sequentially add the goods codes scanned by the identification device at the conveyor belt entrance to the first sub-queue;

[0026] Obtain the outbound queue formed during the outbound process, and delete the goods codes scanned by the identification device in the outbound queue to obtain a second sub-queue.

[0027] In some embodiments, the task queue is obtained through the following steps:

[0028] Create an empty task queue;

[0029] Sequentially add the goods codes scanned by the identification device at the conveyor belt entrance to the task queue.

[0030] In some embodiments, after the step of replacing the target storage location of the target goods with a storage location inside the target storage location, the method for optimizing the physical inventory return storage sequence of goods further includes the following steps:

[0031] Update the storage location corresponding to the storage location code of the target goods in the storage location mapping table to the replaced target storage location;

[0032] Update the storage location corresponding to the storage location code of the replaced goods in the storage location mapping table to the original target storage location.

[0033] To achieve the above object, another aspect of the embodiments of the present application proposes a system for optimizing the physical inventory return storage sequence of goods, including:

[0034] A first module, configured to obtain the goods code of the target goods currently performing the return storage operation;

[0035] A second module, configured to query the storage location mapping table according to the goods code to obtain the original target storage location of the target goods, where the storage location mapping table is used to store the correspondence between the goods code and the storage location;

[0036] The third module is used to determine whether there is any goods in the task queue that belongs to the same goods location group as the target goods according to the target goods location, where the task queue includes the goods codes of the goods that have not been stored in the warehouse;

[0037] The fourth module is used to, when there is any goods in the task queue that belongs to the same goods location group as the target goods, determine whether there is any goods located inside the target goods location among the goods that have not been stored in the warehouse and belong to the same goods location group as the target goods;

[0038] The fifth module is used to, when there is any goods located inside the target goods location, replace the target goods location of the target goods with the goods location located inside the target goods location, so that the stacker performs the operation of returning the target goods to the warehouse according to the replaced target goods location.

[0039] To achieve the above object, on the other hand, an embodiment of the present application provides an electronic device, which includes a memory, a processor, a program stored on the memory and executable on the processor, and a data bus for realizing the connection and communication between the processor and the memory. When the program is executed by the processor, the method described in the above embodiment is realized.

[0040] To achieve the above object, on the other hand, an embodiment of the present application provides a storage medium, which is a computer-readable storage medium for computer-readable storage. The storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to realize the method described in the above embodiment.

[0041] The method, system, device and storage medium for optimizing the physical inventory return sequence of goods proposed by the present application obtain the goods code of the target goods for which the stacker is currently performing the operation of returning to the warehouse, query the goods location mapping table according to the goods code to obtain the original target goods location of the target goods, determine whether there is any goods in the task queue that belongs to the same goods location group as the target goods according to the target goods location, the task queue includes the goods codes of the goods that have not been stored in the warehouse. When there is any goods in the task queue that belongs to the same goods location group as the target goods, determine whether there is any goods located inside the target goods location among the goods that have not been stored in the warehouse and belong to the same goods location group as the target goods. When there is any goods located inside the target goods location, replace the target goods location of the target goods with the goods location located inside the target goods location, so that the stacker performs the operation of returning the target goods to the warehouse according to the replaced target goods location, thereby reducing the situation that the goods location passage is blocked by the outer goods in the same goods location group during the physical inventory return of the warehouse. Description of the Drawings

[0042] Figure 1 is a flowchart of the method for optimizing the physical inventory return sequence of goods provided by the embodiment of the present application;

[0043] Figure 2 It is a schematic diagram of the goods inventory return scenario provided by the embodiments of the present application;

[0044] Figure 3 It is a flowchart of the method for optimizing the physical inventory return sequence of goods based on a double-extended position stereoscopic warehouse provided by the embodiments of the present application;

[0045] Figure 4 It is a schematic diagram of the hardware structure of an electronic device provided by the embodiments of the present application. Specific embodiments

[0046] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0047] It should be noted that although functional module division is performed in the system and the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in a different order from the module division in the system or the flowchart. Terms such as "first" and "second" in the specification, claims and the above-mentioned drawings are used to distinguish similar objects and do not necessarily need to describe a specific order or sequence.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the technical field to which the present application belongs. The terms used herein are only for the purpose of describing the embodiments of the present application and are not intended to limit the present application.

[0049] Please refer to Figure 2 , when performing inventory return, it is required that the goods need to be placed in the original storage location. Generally, it is required that the operator place the goods in the preparation area on the conveyor belt in the reverse order of outbound, and then the stacker crane places the goods on the conveyor belt into the corresponding storage location. If the operator does not place the goods on the conveyor belt in the original outbound order when returning the goods to the shelf by forklift, it will cause the storage location passage of the goods to be blocked by the outer goods in the same storage location group. For example, when the stacker crane places the current goods in storage location 1 of storage location group 2 according to the instruction, since the forklift driver does not place the goods on the conveyor belt in the original outbound order, the stacker crane first places the goods in storage location 2 of storage location group 2, resulting in the goods in storage location 2 blocking the passage of the goods in storage location 1 and preventing the goods from being returned to the warehouse.

[0050] Based on this, the embodiments of the present application provide a method, system, device and storage medium for optimizing the physical inventory return sequence of goods, aiming to reduce the situation where the storage location passage is blocked by the outer goods in the same storage location group during warehouse inventory return.

[0051] The method, system, device, and storage medium for optimizing the physical inventory return order provided by the embodiments of the present application will be specifically described through the following embodiments. First, the method for optimizing the physical inventory return order in the embodiments of the present application will be described.

[0052] The method for optimizing the physical inventory return order provided by the embodiments of the present application relates to the field of automation control technology. The method for optimizing the physical inventory return order provided by the embodiments of the present application can be applied to a terminal, a server, or software running on a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, etc.; the server can be configured as an independent physical server, a server cluster or a distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms; the software can be an application that implements the method for optimizing the physical inventory return order, etc., but is not limited to the above forms.

[0053] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multi-processor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, and so on. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in a distributed computing environment where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0054] Figure 1 is an optional flowchart of the method for optimizing the physical inventory return order provided by the embodiments of the present application. Figure 1 The method in may include, but is not limited to, steps S101 to S105.

[0055] Step S101, obtain the goods code of the target goods currently performing the return operation.

[0056] Step S102, query the goods location mapping table according to the goods code to obtain the original target location of the target goods, where the goods location mapping table is used to store the correspondence between the goods code and the storage location.

[0057] Step S103: Determine whether there is any cargo in the task queue that belongs to the same cargo location group as the target cargo according to the target cargo location. Here, the task queue includes the cargo codes of the unwarehoused cargo.

[0058] Step S104: When there is cargo in the task queue that belongs to the same cargo location group as the target cargo, determine whether there is any unwarehoused cargo in the same cargo location group as the target cargo that is located inside the target cargo location.

[0059] Step S105: When there is cargo located inside the target cargo location, replace the target cargo location of the target cargo with the cargo location inside the target cargo location, so that the stacker performs the operation of returning the target cargo to the warehouse according to the replaced target cargo location.

[0060] In step S101 of some embodiments, identification codes in the form of two-dimensional codes, radio frequency codes, etc. are set on the cargo, and corresponding identification devices are set on the conveyor belt or the stacker. Through the identification device, the cargo code of the target cargo that the stacker needs to perform the operation of returning to the warehouse can be obtained.

[0061] In step S102 of some embodiments, a cargo location mapping table is stored in the system. The cargo location mapping table is used to store the corresponding relationship between the cargo code and the storage cargo location. After obtaining the cargo location code of the target cargo, the cargo location mapping table can be queried according to the cargo code to obtain the original target cargo location of the target cargo, and this target cargo is the original storage location of the cargo before the outbound inventory.

[0062] In step S103 of some embodiments, obtain the task queue when the stacker performs the operation of returning to the warehouse. The task queue includes the cargo codes of the unwarehoused cargo. After determining the target cargo location for the current operation of returning to the warehouse, it is necessary to determine whether there is any cargo in the task queue that belongs to the same cargo location group as the target cargo. If there is cargo in the task queue that belongs to the same cargo location group as the target cargo, it indicates that placing this target cargo may block the subsequent unwarehoused cargo of the same cargo location group, and further judgment is required. If there is no cargo in the task queue that belongs to the same cargo location group as the target cargo, it indicates that there is no subsequent cargo of the same cargo location group that needs to be placed, and this target cargo can be directly placed on the target cargo location.

[0063] In some embodiments, the step of determining whether there is any cargo in the task queue that belongs to the same cargo location group as the target cargo in step S103 may include, but is not limited to, steps S201 to S204:

[0064] Step S201: Query the cargo location mapping table according to all the cargo codes in the task queue to obtain the storage cargo location of each cargo in the task queue. Here, the storage cargo location is represented in the form of a prefix and a suffix. The prefix represents the cargo location group number, and the suffix represents the cargo location number.

[0065] Step S202: Determine whether there is a prefix identical to the target storage location according to the prefixes of the storage locations of all the goods other than the target goods in the task queue.

[0066] Step S203: When there is a prefix identical to the target storage location, determine that there is a good in the task queue that belongs to the same storage location group as the target good.

[0067] Step S204: When there is no prefix identical to the target storage location, determine that there is no good in the task queue that belongs to the same storage location group as the target good.

[0068] In this embodiment, assume that the goods codes included in the task queue are [011, 012, 014, 015]. By querying the storage location mapping table, it can be obtained that the storage locations corresponding to each good are 1-1, 1-2, 2-2, and 2-1 respectively. The storage location is represented in the form of a prefix and a suffix. The prefix represents the storage location group number, and the suffix represents the storage location number. At this time, since the stacker has not placed the target good yet, the goods code of the first storage location in the task queue is the goods code of the target good. Therefore, it is judged whether there is a prefix identical to the target storage location prefix "1" among the prefixes of "1-2, 2-2, 2-1" except "1-1". Through judgment, it can be known that "1-2" is the prefix identical to the target storage location, so it can be determined that there is a good in the task queue that belongs to the same storage location group as the target good.

[0069] In some embodiments, the task queue in step S103 includes a first sub-queue and a second sub-queue. The task queue can be obtained through, but is not limited to, steps S301 to S302:

[0070] Step S301: Create a first sub-queue, and sequentially add the goods codes scanned by the identification device at the conveyor belt entrance to the first sub-queue.

[0071] Step S302: Obtain the outbound queue formed during the outbound process, and delete the goods codes scanned by the identification device in the outbound queue to obtain a second sub-queue.

[0072] In this embodiment, an identification device is provided at the entrance of the conveyor belt. The forklift driver places the goods on the conveyor belt, and the identification device can scan the goods pallet code to obtain the goods code. The system adds the scanned goods code to the first sub-queue. That is, the goods codes in the first sub-queue represent the goods on the conveyor belt, and the order of the goods codes in the first sub-queue corresponds to the order of the goods on the conveyor. When conducting an inventory check for goods out of the warehouse, the goods being taken out of the warehouse can be scanned by the identification device to form an outbound queue. When the goods return to the warehouse after the inventory check is completed, the system uses the outbound queue as the second sub-queue. While adding the scanned goods code to the first sub-queue, the system deletes the goods code from the second sub-queue. That is, the second queue represents the goods in the stocking area. The goods codes in both the first sub-queue and the second sub-queue are those of goods that have not been warehoused. The second task queue is concatenated after the first sub-queue to form a task queue.

[0073] In some other embodiments, the task queue in step S103 can be obtained through, but not limited to, steps S401 to S402:

[0074] Step S401, create an empty task queue;

[0075] Step S402, sequentially add the goods codes scanned by the identification device at the entrance of the conveyor belt to the task queue.

[0076] In this embodiment, considering that the goods in the stocking area may not necessarily return to the warehouse, the goods codes in the task queue of this embodiment represent the goods on the conveyor belt. An identification device is provided at the entrance of the conveyor belt. The forklift driver places the goods on the conveyor belt, and the identification device can scan the goods pallet code to obtain the goods code. Then the system adds the scanned goods code to the created task queue.

[0077] In step S104 of some embodiments, when it is determined that there are goods in the task queue with the same goods location group as the target goods, it is further determined whether there are goods located inside the target goods location among the unwarehoused goods with the same goods location group as the target goods. The inside of the target goods location refers to the side of the goods location group that is farther from the stacker relative to the target goods location. Conversely, the outside of the target goods location refers to the side of the goods location group that is closer to the stacker relative to the target goods location. If there are goods located inside the target goods location among the unwarehoused goods with the same goods location group as the target goods, it indicates that if the stacker directly places the target goods on the original target goods location, the subsequent goods passage inside this goods location will be blocked, resulting in the inability of subsequent goods to be warehoused. On the contrary, if there are no goods located inside the target goods location among the unwarehoused goods with the same goods location group as the target goods, the target goods can be directly placed on the original target goods location.

[0078] In some embodiments, the step of determining whether there is a good located inside the target storage location among the un-stored goods in the same storage location group as the target good in step S104 may include, but is not limited to, steps S501 to S504:

[0079] Step S501, extract the storage locations with the same prefix as the target storage location from the storage locations of all goods in the task queue;

[0080] Step S502, sort the suffixes of all the extracted storage locations in a preset order to obtain a data sequence, where the preset order is the storage location number order of the storage location group from the inside to the outside;

[0081] Step S503, when the suffix of the target storage location is in the first place in the data sequence, determine that there is no good located inside the target storage location among the un-stored goods in the same storage location group as the target good;

[0082] Step S504, when the suffix of the target storage location is not in the first place in the data sequence, determine that there is a good located inside the target storage location among the un-stored goods in the same storage location group as the target good.

[0083] In this embodiment, assume that the storage locations corresponding to all the goods codes in the task queue are 1-2, 1-3, 1-1, 2-1, the target storage location is 1-2, and the storage locations with the same prefix as the target storage location are 1-2, 1-3, 1-1. The preset order is the storage location number order of the storage location group from the inside to the outside. Assume that the storage location number order of the storage location group from the inside to the outside is from large to small. Then, sort the suffixes of all the extracted storage locations in the preset order to obtain a data sequence of [3, 2, 1]. The suffix of the target storage location is "2". Since "2" is not in the first place in the data sequence, it indicates that there is still a good to be placed in the inner storage location "3" of the target storage location. That is, it can be determined that there is a good located inside the target storage location among the un-stored goods in the same storage location group as the target good.

[0084] In step S105 of some embodiments, when there is a good located inside the target storage location among the goods corresponding to the codes in the task queue, replace the target storage location of the target good with the storage location inside the target storage location, so that the stacker performs the return operation on the target good according to the replaced target storage location. Exemplarily, assume that in the same storage location group, the original target storage location is 1, the storage location inside the target storage location is 2, and the task code corresponding to the storage location 2 exists in the task queue. At this time, since the goods in the storage locations of the same storage location group can be exchanged, replace the target storage location with the storage location 2, so that the stacker places the target good on the inner storage location 2 instead of directly on the storage location 1, thereby reducing the situation that subsequent goods are blocked by the goods at the storage location 1.

[0085] In some embodiments, the method for optimizing the physical inventory return order of goods according to the embodiments of the present application may further include, but is not limited to, steps S601 to S602:

[0086] Step S601: Determine whether a return action feedback for the target goods is received, where the return action feedback indicates that the target goods have been placed in the storage location.

[0087] Step S602: When the return action feedback is received, delete the goods code of the target goods from the task queue.

[0088] In this embodiment, after the stacker completes the action of placing the goods, it can feedback the return action feedback for the target goods to the system. The system continuously determines whether the return action feedback for the target goods is received from the stacker. When it is determined that the return action feedback is received, it indicates that the target goods have been placed in the storage location. At this time, the goods code of the target goods is deleted from the task queue.

[0089] In some embodiments, after step S105, the method for optimizing the physical inventory return order of goods according to the embodiments of the present application may include, but is not limited to, steps S701 to S702:

[0090] Step S701: Update the storage location corresponding to the storage location code of the target goods in the storage location mapping table to the replaced target storage location.

[0091] Step S702: Update the storage location corresponding to the storage location code of the replaced goods in the storage location mapping table to the original target storage location.

[0092] In this embodiment, after the original target storage location is replaced, it is necessary to synchronously update the storage location mapping table stored in the system to achieve accurate management of the goods storage locations. That is, update the storage location corresponding to the storage location code of the target goods in the storage location mapping table to the replaced target storage location. In addition, the storage location corresponding to the storage location code of the replaced goods in the storage location mapping table can also be updated to the original target storage location, that is, exchange the storage locations of the target goods and the goods inside it, to avoid the situation where two goods occupy one storage location. Further, after updating the storage location mapping table, the next task in the task queue can be processed, and steps S101 to S102 can be repeatedly executed.

[0093] According to some embodiments of the present application, taking the scenario of a double-deep pallet warehouse (i.e., two storage locations are set in each storage location group) as an example, please refer to Figure 3 , the following details the method for optimizing the physical inventory return order of goods based on a double-deep pallet warehouse.

[0094] Goods enter the warehousing entrance, and the identification device at the warehousing entrance obtains the goods code. Then, the goods represented by the goods code are added to the task queue of the WCS (stereoscopic warehouse equipment management system, managing equipment), and at the same time, an operation to trigger the WCS to traverse and check the task queue is performed to determine whether the situation of "forklift drivers loading goods out of order, resulting in congestion during inventory return" may occur. The content of the judgment is as follows:

[0095] For each task in the task queue, whether the location group where the goods location is located is the same as the location group of the current task. If it is the same, then further determine whether the destination location of the current task is a location on the outer side of the location group. Through these two judgment steps in this embodiment, it can be determined whether the phenomenon of goods congestion will occur, that is, first check whether there are tasks in the task queue for a location group. If so, then judge whether the current task is outside the location group. If it is, it indicates that the detected task execution order should be before the current task. If the current task is directly executed, the detected task will be blocked outside the location group later. Therefore, after it is determined through judgment that the phenomenon of goods congestion will occur after executing the current task, an operation of swapping the locations of two goods in the same location group is required. As long as the two tasks are still in the task queue, the operation of swapping locations can be established. After the operation is completed, the task with the earlier order will be put away on the location in the inner side of the location group, and the task with the later order will be put away on the location on the outer side of the location group, and the phenomenon of goods congestion can be solved.

[0096] Furthermore, since the actual system for sending task instructions is the WMS warehouse business management system (managing process) system, after the WCS swaps the destination locations of the tasks, the WCS also needs to request the WMS system to swap the positions of these two goods in the system inventory. Although the goods on the locations are exactly the same, in the stereoscopic warehouse, the pallet is also part of the inventory attribute. When the positions of the two pallets of goods are swapped, it is necessary to feedback to the business system to modify the inventory attribute, otherwise it may cause the problem that the issued pallet code is inconsistent with the actual pallet code when the next outbound instruction is issued.

[0097] This embodiment of the present application also provides a system for optimizing the inventory return order of physical goods, including:

[0098] The first module is used to obtain the goods code of the target goods currently performing the inventory return operation;

[0099] The second module is used to query the location mapping table according to the goods code to obtain the original target location of the target goods, where the location mapping table is used to store the corresponding relationship between the goods code and the storage location;

[0100] The third module is used to judge whether there are goods in the same location group as the target goods in the task queue according to the target location, where the task queue includes the goods codes of unwarehoused goods;

[0101] The fourth module is configured to, when there is a good in the task queue that has the same location group as the target good, determine whether there is a good located inside the target location among the goods that have the same location group as the target good but have not been warehoused;

[0102] The fifth module is configured to, when there is a good located inside the target location, replace the target location of the target good with the location inside the target location, so that the stacker performs the operation of returning the target good to the warehouse according to the replaced target location.

[0103] It can be understood that the content in the above embodiments of the method for optimizing the physical inventory return order of goods is applicable to the embodiments of this system. The functions specifically implemented by the embodiments of this system are the same as those of the above embodiments of the method for optimizing the physical inventory return order of goods, and the beneficial effects achieved are also the same as those of the above embodiments of the method for optimizing the physical inventory return order of goods.

[0104] The embodiments of this application also provide an electronic device, which includes: a memory, a processor, a program stored on the memory and executable on the processor, and a data bus for realizing the connection and communication between the processor and the memory. When the program is executed by the processor, it realizes the above method for optimizing the physical inventory return order of goods. The electronic device can be any intelligent terminal including a tablet computer, a vehicle-mounted computer, etc.

[0105] Please refer to Figure 4 , Figure 4 which illustrates the hardware structure of an electronic device in another embodiment. The electronic device includes:

[0106] A processor 401, which can be implemented in ways such as a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is configured to execute relevant programs to implement the technical solutions provided by the embodiments of this application;

[0107] A memory 402, which can be implemented in forms such as a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 402 can store an operating system and other application programs. When implementing the technical solutions provided by the embodiments of this specification through software or firmware, the relevant program codes are stored in the memory 402 and are called by the processor 401 to execute the method for optimizing the physical inventory return order of goods in the embodiments of this application;

[0108] An input / output interface 403 for implementing information input and output;

[0109] A communication interface 404 for implementing communication interaction between this device and other devices, which can achieve communication through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WI-FI, Bluetooth, etc.);

[0110] A bus 405 for transmitting information between various components of the device (such as a processor 401, a memory 402, an input / output interface 403, and a communication interface 404);

[0111] Among them, the processor 401, the memory 402, the input / output interface 403, and the communication interface 404 achieve communication connections with each other inside the device through the bus 405.

[0112] The embodiment of the present application also provides a storage medium, which is a computer-readable storage medium for computer-readable storage. The storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the above-mentioned optimization method for the return warehouse sequence of physical inventory of goods.

[0113] As a non-transitory computer-readable storage medium, the memory can be used to store non-transitory software programs and non-transitory computer-executable programs. In addition, the memory can include high-speed random access memory, and can also include non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices. In some embodiments, the memory may optionally include a memory remotely set relative to the processor, and these remote memories can be connected to the processor through a network. Examples of the above network include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0114] The embodiments described in the embodiments of the present application are for more clearly illustrating the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. Those skilled in the art know that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of the present application are equally applicable to similar technical problems.

[0115] Those skilled in the art can understand that the technical solutions shown in the figure do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figure, or combine certain steps, or different steps.

[0116] The system embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0117] Those of ordinary skill in the art can understand that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, and their appropriate combinations.

[0118] As used in the specification of this application and the above drawings, the terms "first", "second", "third", "fourth", etc. (if any) are used to distinguish similar objects and do not necessarily describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances so that the embodiments of this application described here can be implemented in an order other than those illustrated or described here. In addition, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units does not necessarily limit to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products, or devices.

[0119] It should be understood that in this application, "at least one (item)" means one or more, and "a plurality" means two or more. "And / or" is used to describe the association relationship of associated objects and indicates that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist at the same time. Among them, A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one (one) of the following" or a similar expression means any combination of these items, including any combination of single item (one) or plural items (ones). For example, at least one (one) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0120] In several embodiments provided by the present application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative. For example, the division of the above units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of systems or units can be in electrical, mechanical or other forms.

[0121] The units described above as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place, or they can be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0122] In addition, each functional unit in various embodiments of the present application can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above integrated units can be implemented in the form of hardware or in the form of software functional units.

[0123] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in various embodiments of the present application. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store programs.

[0124] The preferred embodiments of the embodiments of the present application have been described above with reference to the accompanying drawings. However, this does not limit the scope of the rights of the embodiments of the present application. Any modifications, equivalent replacements, and improvements made by those skilled in the art without departing from the scope and essence of the embodiments of the present application shall be within the scope of the rights of the embodiments of the present application.

Claims

1. A method for optimizing the order of physical inventory return to warehouse, characterized in that: The following steps are involved: Get the cargo code of the target cargo currently being returned to the warehouse; According to the cargo code, a cargo location mapping table is queried to obtain the original target cargo location of the target cargo, wherein the cargo location mapping table is used to store the corresponding relationship between the cargo code and the storage cargo location; According to the target cargo location, it is determined whether there is cargo in the task queue that is in the same cargo location group as the target cargo, wherein the task queue includes cargo codes of cargo that has not been put into storage; When there are goods in the same cargo location group as the target goods in the task queue, it is determined whether there are goods located inside the target cargo location among the unstocked goods in the same cargo location group as the target goods; When there are goods located inside the target cargo location, the target cargo location of the target goods is replaced with a cargo location located inside the target cargo location, so that the stacker performs a return operation for the target goods according to the replaced target cargo location.

2. The method for optimizing the order of physical inventory return to warehouse according to claim 1 is characterized in that: The method for optimizing the order of physical inventory return to warehouse also includes the following steps: Determining whether a return-to-warehouse action feedback for the target goods is received, wherein the return-to-warehouse action feedback indicates that the target goods have been placed on the cargo location; When the feedback of the return-to-warehouse action is received, the cargo code of the target cargo is deleted from the task queue.

3. The method for optimizing the order of physical inventory return to warehouse according to claim 1 is characterized in that: The step of judging whether there are goods in the task queue in the same cargo location group as the target goods according to the target cargo location comprises the following steps: Query the cargo location mapping table according to all cargo codes in the task queue to obtain the storage cargo location of each cargo in the task queue, wherein the storage cargo location is represented in the form of a prefix and a suffix, the prefix represents the cargo location group number, and the suffix represents the cargo location number; According to the prefixes of the storage locations of all goods in the task queue except the target goods, determining whether there is a prefix identical to the target storage location; When there is a prefix identical to the target cargo location, it is determined that there is cargo in the task queue that is in the same cargo location group as the target cargo; When there is no prefix identical to the target cargo location, it is determined that there is no cargo in the same cargo location group as the target cargo in the task queue.

4. The method for optimizing the order of physical inventory return to warehouse according to claim 3 is characterized in that: The step of judging whether there is any cargo located inside the target cargo location among the unstocked cargo in the same cargo location group as the target cargo location comprises the following steps: Extracting a storage location with the same prefix as the target storage location from the storage locations of all goods in the task queue; Sorting the suffixes of all the extracted storage locations in a preset order to obtain a data sequence, wherein the preset order is the order of the location group location numbers from the inner side to the outer side; When the suffix of the target cargo location is located at the first position of the data sequence, it is determined that there is no cargo located inside the target cargo location among the unstocked cargo in the same cargo location group as the target cargo; When the suffix of the target cargo location is not located at the first position of the data sequence, it is determined that there is cargo located inside the target cargo location among the unstocked cargo in the same cargo location group as the target cargo.

5. The method for optimizing the order of physical inventory return to warehouse according to claim 1 is characterized in that: The task queue includes a first sub-queue and a second sub-queue, and the task queue is obtained by the following steps: Create a first sub-queue, and add the cargo codes scanned by the identification device at the entrance of the conveyor belt to the first sub-queue in sequence; An outbound queue formed during the outbound process is obtained, and the cargo codes scanned by the identification device in the outbound queue are deleted to obtain a second sub-queue.

6. The method for optimizing the order of physical inventory return to warehouse according to claim 1 is characterized in that: The task queue is obtained by the following steps: Create an empty task queue; The cargo codes scanned by the identification device at the entrance of the conveyor belt are added to the task queue in sequence.

7. The method for optimizing the order of physical inventory return to warehouse according to claim 1, characterized in that: After the step of replacing the target cargo location of the target cargo with a cargo location located inside the target cargo location, the method for optimizing the order of physical inventory return to warehouse further comprises the following steps: The storage location corresponding to the location code of the target goods in the location mapping table is updated to the replaced target location; The storage location corresponding to the location code of the replaced goods in the location mapping table is updated to the original target location.

8. A system for optimizing the order of physical inventory return to warehouse, characterized in that: include: The first module is used to obtain the cargo code of the target cargo currently being returned to the warehouse; The second module is used to query the cargo location mapping table according to the cargo code to obtain the original target cargo location of the target cargo, wherein the cargo location mapping table is used to store the corresponding relationship between the cargo code and the storage cargo location; The third module is used to determine whether there is any cargo in the task queue in the same cargo location group as the target cargo according to the target cargo location, wherein the task queue includes cargo codes of cargo that has not been put into storage; The fourth module is used for determining whether there is any cargo located inside the target cargo location among the unstocked cargo in the same cargo location group as the target cargo in the task queue; The fifth module is used to replace the target storage location of the target goods with the storage location inside the target storage location when there are goods located inside the target storage location, so that the stacker can return the target goods to the warehouse according to the replaced target storage location.

9. An electronic device, characterized in that: The electronic device includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection and communication between the processor and the memory. When the program is executed by the processor, the steps of the method described in any one of claims 1 to 7 are realized.

10. A storage medium, the storage medium being a computer-readable storage medium, used for computer-readable storage, characterized in that: The storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of any one of claims 1 to 7.

Images