[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2024216930A1 - 分播墙的配置方法、装置、系统和存储介质 - Google Patents

分播墙的配置方法、装置、系统和存储介质 Download PDF

Info

Publication number
WO2024216930A1
WO2024216930A1 PCT/CN2023/130379 CN2023130379W WO2024216930A1 WO 2024216930 A1 WO2024216930 A1 WO 2024216930A1 CN 2023130379 W CN2023130379 W CN 2023130379W WO 2024216930 A1 WO2024216930 A1 WO 2024216930A1
Authority
WO
WIPO (PCT)
Prior art keywords
time
total
shelves
wall
changing
Prior art date
Application number
PCT/CN2023/130379
Other languages
English (en)
French (fr)
Inventor
薛博文
童克冬
商春鹏
陈金广
刘源
吴瞰
马庆光
Original Assignee
北京京东乾石科技有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 北京京东乾石科技有限公司 filed Critical 北京京东乾石科技有限公司
Publication of WO2024216930A1 publication Critical patent/WO2024216930A1/zh

Links

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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • 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

Definitions

  • the present disclosure relates to the field of logistics technology, and in particular to a configuration method, device, system and storage medium of a place wall.
  • the automatic distribution wall product uses a distribution vehicle to quickly distribute the goods to the corresponding grid after the goods have been scanned by the bag supply station.
  • Distribution wall distribution can change the current situation of large-scale walking across aisles to put goods on the shelves after manual distribution, and realize small-scale walking to put goods on the shelves after rapid automatic distribution, which saves labor costs and improves logistics processing efficiency.
  • the number of slots in a place wall is usually fixed, that is, all the slots in the place wall are used.
  • a method for configuring a distribution wall comprising: for multiple alternative grid numbers of the distribution wall, determining resource consumption information corresponding to each grid number; selecting a target grid number from multiple alternative grid numbers based on the resource consumption information corresponding to each alternative grid number; and configuring the distribution wall based on the target grid number.
  • the resource consumption information includes at least one of the number of people changing boxes, the number of people putting things on shelves, and the duration of the task.
  • determining the resource consumption information corresponding to each number of slots includes: determining the task parameters affected by the alternative number of slots; using the task parameters, determining the characterization of the total time for changing boxes and the characterization of the total time for putting things on the shelves; and determining the resource consumption information corresponding to the number of slots with the constraint that the total broadcasting time is not less than the total time for changing boxes and the total time for putting things on the shelves.
  • the task parameters affected by the number of alternative slots include at least one of the unit time for changing boxes on the distribution wall and the unit time for putting goods on the shelves.
  • the time required to change containers is positively correlated with the number of available slots;
  • the unit time is negatively correlated with the number of alternative grids.
  • the task parameters include the unit time of box changing of the distribution wall; the resource consumption information includes the number of people changing boxes; the representation of the total time of box changing is determined by the unit time of box changing, the number of box changing times and the number of people changing boxes.
  • the total time for changing boxes is positively correlated with the unit time for changing boxes and the number of times boxes are changed, and is negatively correlated with the number of people changing boxes.
  • the task parameters include the unit time for putting goods on the shelves;
  • the resource consumption information includes the number of people putting goods on the shelves;
  • the representation of the total time for putting goods on the shelves is determined by the unit time for putting goods on the shelves, the number of times goods are put on the shelves, the unit time for putting goods on the shelves and the number of people putting goods on the shelves.
  • the total time of putting items on the shelves is positively correlated with the unit time of putting items on the shelves, the number of times items are put on the shelves, and the unit time of walking on the shelves, and is negatively correlated with the number of people putting items on the shelves.
  • the unit time for walking to the rack includes the average time for walking to the aisle and the average time for walking in the aisle.
  • the average time spent traveling within an aisle is determined based on the average number of types of goods within a tote.
  • the total time for changing boxes is also characterized by the number of people changing boxes
  • the total time for putting things on the shelves is also characterized by the number of people putting things on the shelves
  • the total time for distribution is not less than the total time for changing boxes and the total time for putting things on the shelves as a constraint
  • the resource consumption information corresponding to the number of slots is determined, including: the total time for distribution is not less than the total time for changing boxes and the total time for putting things on the shelves as a constraint, and the number of people changing boxes in the representation of the total time for changing boxes and the number of people putting things on the shelves in the representation of the total time for putting things on the shelves are solved; the total time for distribution and the total time for putting things on the shelves corresponding to the number of slots are determined by using the solved number of people changing boxes and the solved number of people putting things on the shelves; the task completion time is determined according to the maximum value of the total time for distribution, the total time for changing boxes and the total time for putting
  • configuring the place wall according to the target number of slots includes: in the place wall, opening a corresponding number of slots according to the target number of slots.
  • a device for configuring a distribution wall including: a determination module, configured to determine, for a plurality of alternative grid numbers of the distribution wall, resource consumption information corresponding to each grid number; a selection module, configured to select a target grid number from a plurality of alternative grid numbers according to the resource consumption information corresponding to each alternative grid number; and a configuration module, configured to configure the distribution wall according to the target grid number.
  • a system for configuring a place wall comprising: any one of the aforementioned configuration devices for a place wall; and a place wall.
  • a configuration device for a placement wall comprising: storing and a processor coupled to the memory, the processor being configured to execute any of the foregoing methods for configuring a placement wall based on instructions stored in the memory.
  • a computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, any of the aforementioned methods for configuring a placement wall is implemented.
  • a computer program comprising: instructions, which, when executed by a processor, cause the processor to execute any of the aforementioned methods for configuring a distribution wall.
  • FIG1 is a schematic diagram showing a flow chart of a method for configuring a put wall according to some embodiments of the present disclosure.
  • FIG2 shows a schematic flow chart of a method for determining resource consumption information according to some embodiments of the present disclosure.
  • FIG3 is a schematic flow chart of a method for determining a target number of grid openings according to some embodiments of the present disclosure.
  • FIG. 4 shows a schematic structural diagram of a configuration device for a put wall according to some embodiments of the present disclosure.
  • FIG5 shows a schematic structural diagram of a configuration system for a put wall according to some embodiments of the present disclosure.
  • FIG6 shows a schematic structural diagram of a configuration device for a put wall according to other embodiments of the present disclosure.
  • FIG. 7 shows a schematic structural diagram of a device for configuring a put wall according to yet other embodiments of the present disclosure.
  • the actual SKU (Stock Keeping Unit) grouping strategy and slot utilization rate of the distribution wall will be affected by the number of slots.
  • the number of slots is generally given directly by the staff based on past experience. It is easy to have too many slots in the distribution wall planned in the actual project, resulting in low overall utilization and waste; or too few slots, resulting in the grids being full during the distribution process, resulting in too many times of re-dropping of goods, resulting in insufficient distribution efficiency.
  • a technical problem to be solved by the embodiments of the present disclosure is: how to improve the efficiency of logistics processing.
  • the distribution wall includes distribution equipment, grid equipment and software system.
  • the distribution equipment includes distribution vehicles, package supply stations, scanning equipment, and operation terminals;
  • the grid equipment includes shelves, turnover boxes, radio frequency identification (Radio Frequency Identification, referred to as: RFID) tags and card readers;
  • the software system includes a warehouse control system (Warehouse Control System, referred to as: WCS) and a scheduling system.
  • WCS Warehouse Control System
  • the staff places the goods on the package supply table.
  • the scanning device reads the information of the goods and determines the grid to which the goods belong.
  • the system dispatches the distribution vehicle to transport the goods through the trolley, and the belt on the trolley drives the goods to the corresponding grid in the distribution wall.
  • the goods automatically fall into the turnover box corresponding to the grid through the grid.
  • the box changer When receiving a prompt that the turnover box corresponding to the grid is full, the box changer will take out the turnover box and place it at the designated location, and then place the empty turnover box at the grid.
  • the staff will put the goods in the full turnover box on the shelves, that is, put the goods into storage locations according to the SKU and other goods type information.
  • the distribution wall can also be used for goods out of the warehouse, which will not be repeated here.
  • Fig. 1 shows a schematic flow chart of a method for configuring a put wall according to some embodiments of the present disclosure. As shown in Fig. 1, the method for configuring a put wall in this embodiment includes steps S102 to S106.
  • step S102 for a plurality of candidate slot numbers of the put wall, resource consumption information corresponding to each slot number is determined.
  • the candidate numbers of grids include a, b, and c, and the resource consumption information when the grid number is a, the resource consumption information when the grid number is b, and the resource consumption information when the grid number is c can be calculated respectively.
  • Resource consumption information may be information on consumption of manpower or time.
  • resource consumption information includes at least one of the number of people changing boxes, the number of people putting things on shelves, and the duration of the task.
  • the change in the number of slots will affect the overall operational efficiency. For example, as the number of slots increases, the overall length of the distribution wall will increase, so the walking time of the box changer to place the full turnover box at the designated location will increase; for another example, when the number of slots increases, the number of SKUs in each turnover box will decrease, and the walking distance and classification difficulty of the shelf staff to complete the shelving of all SKUs in the turnover box can be reduced, thus shortening the unit time of walking.
  • a target number of grid cells is selected from a plurality of candidate numbers of grid cells according to resource consumption information corresponding to each candidate number of grid cells.
  • the number of slots with the least resource consumption is selected. For example, the number of slots with the least staff required is selected, or the number of slots with the shortest time consumption is selected, or a combination of these two factors is considered. Of course, other factors can also be referenced.
  • resource consumption information is measured using multiple factors, it can be determined based on the weighted results of multiple dimensions, and the weights can be set as needed.
  • step S106 the place wall is configured according to the target number of grids.
  • a corresponding number of slots are opened according to the target number of slots. For example, if the target number of slots is 80, 80 slots in the place wall may be opened.
  • the open grids can be set to be available, so that when the system reads the information of the grids, it only reads the information of the open grids; for another example, for an expandable place wall, the actual size of the place wall can be increased or shortened by removing or adding grid modules.
  • the embodiments of the present disclosure can select a target number of slots based on resource consumption information corresponding to multiple numbers of slots, and configure a distribution wall, so as to improve the distribution wall slot utilization rate and processing efficiency, thereby improving the overall efficiency of logistics processing.
  • Fig. 2 shows a schematic flow chart of a method for determining resource consumption information according to some embodiments of the present disclosure. As shown in Fig. 2, the determination method of this embodiment includes steps S202 to S206.
  • step S202 task parameters affected by the number of alternative grids are determined.
  • the task parameters affected by the number of alternative slots include at least one of the unit time for changing boxes on the distribution wall and the unit time for putting goods on the shelves.
  • the unit time of changing boxes refers to the average time required by the box changing staff to change the turnover box, which includes placing the turnover box in the drop wall to the designated position and placing an empty new turnover box in the original slot of the turnover box.
  • the unit time of changing boxes is positively correlated with the number of alternative slots.
  • the unit time for putting goods on the shelves refers to the time required for the shelving personnel to put the goods in the full turnover box on the shelves, including the average time to walk to the aisle and the average time walking in the aisle. As the number of slots increases, the number of goods in each turnover box will decrease, and the walking distance of the shelving personnel will decrease when they complete the shelving operation of all the goods in the turnover box. In other words, the unit time for putting goods on the shelves is negatively correlated with the number of alternative slots.
  • step S204 the task parameters are used to determine the representation of the total time for changing boxes and the representation of the total time for putting the goods on the shelves.
  • the total time of changing boxes is determined by the unit time of changing boxes, the number of times of changing boxes, and the number of people changing boxes.
  • the number of times of changing boxes can be obtained by simulation using the distribution list data to be processed.
  • the total time of changing boxes is positively correlated with the unit time of changing boxes and the number of times of changing boxes, and negatively correlated with the number of people changing boxes.
  • the total time of changing boxes is obtained by dividing the product of the unit time of changing boxes and the number of times of changing boxes by the number of people changing boxes.
  • the total time of putting on the shelf is determined by the unit time of putting on the shelf, the number of times of putting on the shelf, the unit time of walking on the shelf, and the number of people on the shelf.
  • the number of box changes can be obtained by simulating the data of the distribution order to be processed, or by simulating similar data according to the attribute information of the distribution order to be processed.
  • the total time of putting on the shelf is positively correlated with the unit time of putting on the shelf, the number of times of putting on the shelf, and the unit time of walking on the shelf, and is negatively correlated with the number of people on the shelf.
  • the sum of the unit time of putting on the shelf and the unit time of walking on the shelf is calculated, and then multiplied by the number of times of putting on the shelf, and then the product is compared with the number of people on the shelf to obtain the comparison value as the total time of putting on the shelf.
  • the unit time of walking to the shelf includes the average time of walking to the lane and the average time of walking in the lane.
  • the average time of walking to the lane can be regarded as a constant.
  • the average time of walking in the lane can be determined according to the average number of goods types (such as SKUs) in the turnover box. In some embodiments, the average time of walking in the lane is the average number of turnover boxes.
  • the difference between the average quantity of each type of goods in the lane and the average quantity of goods in the lane minus 1 is divided by 3 and multiplied by the length of the lane.
  • step S206 resource consumption information corresponding to the number of slots is determined with the constraint that the total distribution duration is not less than the total box-changing duration and the total shelf-putting duration.
  • the logistics processing process can be exemplarily divided into three stages: distribution, box changing, and shelving, and these three stages can be executed in parallel.
  • the total distribution time is mainly affected by the mechanical operating efficiency of the distribution wall, and is therefore relatively fixed.
  • the total distribution time can be determined by simulating the distribution order to be processed.
  • the total box changing time and the total shelving time will be affected by the resources invested, for example, the manpower invested. Therefore, by making the total distribution time the maximum value among the total distribution time, the total box changing time, and the total shelving time, the task parameters and resource consumption information that maximize the overall efficiency can be solved.
  • Fig. 3 shows a schematic flow chart of a method for determining a target number of openings according to some embodiments of the present disclosure. As shown in Fig. 3, the method for determining a target number of openings in this embodiment includes steps S302 to S306.
  • step S302 the total broadcasting time is constrained to be not less than the total time for changing boxes and the total time for putting on the shelves, and the number of people changing boxes in the representation of the total time for changing boxes and the number of people putting on the shelves in the representation of the total time for putting on the shelves are solved.
  • the total time for changing boxes is also represented by the number of people changing boxes
  • the total time for putting on the shelves is also represented by the number of people putting on the shelves.
  • step S304 the total broadcasting time and the total shelf time corresponding to the number of slots are determined by using the solved number of people changing boxes and the number of people putting the goods on the shelves. That is, the number of people changing boxes and the number of people putting the goods on the shelves are respectively substituted into the representation of the total box changing time and the representation of the total shelf time.
  • step S306 the task completion time is determined according to the maximum value of the total broadcasting time, the total box changing time and the total shelf-putting time.
  • resource consumption information including total broadcasting time, total shelf time and task completion time.
  • the distribution wall can be dynamically configured according to the actual distribution task. For example, after reading the current distribution task data to be processed from the database, the resource consumption information corresponding to each grid is calculated based on the data, and then the target grid number is determined, and the distribution wall is configured. As the distribution task changes, the target grid number can be determined again.
  • the configuration of the distribution wall can adapt to the current distribution task, further improving the processing efficiency of the distribution task.
  • FIG4 shows a schematic diagram of the structure of a configuration device for a placement wall according to some embodiments of the present disclosure.
  • the configuration device 40 of the distribution wall of this embodiment includes: a determination module 410, configured to determine the resource consumption information corresponding to each number of grids of multiple alternative numbers of grids of the distribution wall; a selection module 420, configured to select a target number of grids from multiple alternative numbers of grids according to the resource consumption information corresponding to each alternative number of grids; and a configuration module 430, configured to configure the distribution wall according to the target number of grids.
  • the configuration device 40 of the placement wall can be configured in the software system of the placement wall, and can also be deployed in an independent computer system.
  • the resource consumption information includes at least one of the number of people changing boxes, the number of people putting things on shelves, and the duration of the task.
  • the determination module 410 is further configured to determine the task parameters affected by the alternative number of slots; determine the characterization of the total time for changing boxes and the characterization of the total time for putting things on the shelves using the task parameters; and determine the resource consumption information corresponding to the number of slots with the constraint that the total broadcasting time is not less than the total time for changing boxes and the total time for putting things on the shelves.
  • the task parameters affected by the number of alternative slots include at least one of the unit time for changing boxes on the distribution wall and the unit time for putting goods on the shelves.
  • the unit time for changing boxes is positively correlated with the number of optional slots; the unit time for putting goods on shelves is negatively correlated with the number of optional slots.
  • the task parameters include the unit time of box changing of the distribution wall; the resource consumption information includes the number of people changing boxes; the representation of the total time of box changing is determined by the unit time of box changing, the number of box changing times and the number of people changing boxes.
  • the total time for changing boxes is positively correlated with the unit time for changing boxes and the number of times boxes are changed, and is negatively correlated with the number of people changing boxes.
  • the task parameters include the unit time for putting goods on the shelves;
  • the resource consumption information includes the number of people putting goods on the shelves;
  • the representation of the total time for putting goods on the shelves is determined by the unit time for putting goods on the shelves, the number of times goods are put on the shelves, the unit time for putting goods on the shelves and the number of people putting goods on the shelves.
  • the total time of putting items on the shelves is positively correlated with the unit time of putting items on the shelves, the number of times items are put on the shelves, and the unit time of walking on the shelves, and is negatively correlated with the number of people putting items on the shelves.
  • the unit time for rack walking includes the average time for walking to the aisle and the average time for walking in the aisle.
  • the average time spent traveling within an aisle is determined based on the average number of types of goods within a tote.
  • the total time of changing boxes is also characterized by the number of people changing boxes
  • the total time of putting the boxes on the shelves is also characterized by the number of people putting the boxes on the shelves
  • the determination module 410 is further configured to make the total time of the distribution not less than the total time of changing boxes and the total time of putting the boxes on the shelves.
  • the configuration module 430 is further configured to open a corresponding number of slots in the placement wall according to the target number of slots.
  • Fig. 5 shows a schematic diagram of the structure of a configuration system of a place wall according to some embodiments of the present disclosure.
  • the configuration system 5 of the place wall of this embodiment includes: a configuration device 51 of a place wall, the specific implementation of which can refer to the configuration device of the place wall in any embodiment of the present disclosure; and a place wall 52.
  • the configuration device 51 of the place wall can be deployed in an independent computing device outside the place wall; when the place wall 52 does not include a software system, the configuration device 51 of the place wall can be deployed in an independent computing device outside the place wall, or deployed in a software system matching the place wall 52.
  • Fig. 6 shows a schematic diagram of the structure of a configuration device for a put wall according to other embodiments of the present disclosure.
  • the configuration device 60 for a put wall in this embodiment includes: a memory 610 and a processor 620 coupled to the memory 610, and the processor 620 is configured to execute the configuration method of the put wall in any of the above embodiments based on the instructions stored in the memory 610.
  • the memory 610 may include, for example, a system memory, a fixed non-volatile storage medium, etc.
  • the system memory may store, for example, an operating system, an application program, a boot loader, and other programs.
  • FIG7 shows a schematic diagram of the structure of the configuration device of the distribution wall according to some other embodiments of the present disclosure.
  • the configuration device 70 of the distribution wall of this embodiment includes: a memory 710 and a processor 720, and may also include an input-output interface 730, a network interface 740, a storage interface 750, etc. These interfaces 730, 740, 750 and the memory 710 and the processor 720 can be connected, for example, via a bus 770.
  • the input-output interface 730 provides a connection interface for input-output devices such as a display, a mouse, a keyboard, and a touch screen.
  • the network interface 740 provides a connection interface for various networked devices.
  • the storage interface 750 provides a connection interface for external storage devices such as SD cards and USB flash drives.
  • An embodiment of the present disclosure further provides a computer-readable storage medium having a computer program stored thereon, wherein the program, when executed by a processor, implements any of the above-mentioned methods for configuring a placement wall.
  • the embodiments of the present disclosure may be provided as methods, systems, or computer program products. Therefore, the present disclosure may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product that includes one or more of the following:
  • the computer program product of the serial code can be implemented on a non-transitory storage medium (including but not limited to disk storage, CD-ROM, optical storage, etc.).
  • These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.
  • These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)

Abstract

本公开公开了一种分播墙的配置方法、装置、系统和存储介质，涉及智慧物流领域。分播墙的配置方法包括：对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；根据每个备选的格口数对应的资源消耗信息，从多个备选的格口数中选择目标格口数；和根据目标格口数，对分播墙进行配置。

Description

分播墙的配置方法、装置、系统和存储介质
相关申请的交叉引用
本申请是以中国申请号为202310423404.0，申请日为2023年4月19日的申请为基础，并主张其优先权，该中国申请的公开内容在此作为整体引入本申请中。
技术领域
本公开涉及物流技术领域，特别涉及一种分播墙的配置方法、装置、系统和存储介质。
背景技术
自动分播墙产品通过分播车，将经过供包台扫码获取信息后的商品快速分播到商品对应格口。分播墙分播能够改变人工分货后跨巷道大范围行走上架的现状，实现快速自动分播后的小范围行走上架，带来了人力成本的节约、和物流处理效率的提升。
在相关技术中，分播墙的格口数通常使用固定的、分播墙中的全部格口。
发明内容
根据本公开一些实施例的第一个方面，提供一种分播墙的配置方法，包括：对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；根据每个备选的格口数对应的资源消耗信息，从多个备选的格口数中选择目标格口数；和根据目标格口数，对分播墙进行配置。
在一些实施例中，资源消耗信息包括换箱人数、上架人数、任务时长中的至少一种。
在一些实施例中，确定每个格口数所对应的资源消耗信息包括：确定备选的格口数所影响的任务参数；利用任务参数，确定换箱总时长的表征和上架总时长的表征；和以令分播总时长不小于换箱总时长和上架总时长为约束，确定格口数对应的资源消耗信息。
在一些实施例中，备选的格口数所影响的任务参数包括分播墙的换箱单位时间、货物的上架行走单位时间中的至少一种。
在一些实施例中，换箱单位时间与备选的格口数成正相关关系；货物的上架行走 单位时间与备选的格口数成负相关关系。
在一些实施例中，任务参数包括分播墙的换箱单位时间；资源消耗信息包括换箱人数；换箱总时长的表征利用换箱单位时间、换箱次数和换箱人数确定。
在一些实施例中，换箱总时长与换箱单位时间和换箱次数成正相关关系，与换箱人数成负相关关系。
在一些实施例中，任务参数包括货物的上架行走单位时间；资源消耗信息包括上架人数；上架总时长的表征利用上架单位时间、上架次数、上架行走单位时间和上架人数确定。
在一些实施例中，上架总时长与上架单位时间、上架次数和上架行走单位时间成正相关关系，与上架人数成负相关关系。
在一些实施例中，上架行走单位时间包括行走到巷道的平均时间、以及巷道内行走的平均时间。
在一些实施例中，巷道内行走的平均时间根据周转箱内的货物种类的平均数量确定。
在一些实施例中，换箱总时长还利用换箱人数表征、上架总时长还利用上架人数表征，并且以令分播总时长不小于换箱总时长和上架总时长为约束，确定格口数对应的资源消耗信息包括：令分播总时长不小于换箱总时长、上架总时长为约束，求解换箱总时长的表征中的换箱人数、以及上架总时长的表征中的上架人数；利用求解的换箱人数和上架人数，确定格口数对应的分播总时长和上架总时长；根据分播总时长、换箱总时长和上架总时长中的最大值，确定任务完成时长。
在一些实施例中，根据目标格口数，对分播墙进行配置包括：在分播墙中，根据目标格口数，开放相应数量的格口。
根据本公开一些实施例的第二个方面，提供一种分播墙的配置装置，包括：确定模块，被配置为对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；选择模块，被配置为根据每个备选的格口数对应的资源消耗信息，从多个备选的格口数中选择目标格口数；以及配置模块，被配置为根据目标格口数，对分播墙进行配置。
根据本公开一些实施例的第三个方面，提供一种分播墙的配置系统，包括：前述任意一种分播墙的配置装置；以及分播墙。
根据本公开一些实施例的第四个方面，提供一种分播墙的配置装置，包括：存储 器；以及耦接至存储器的处理器，处理器被配置为基于存储在存储器中的指令，执行前述任意一种分播墙的配置方法。
根据本公开一些实施例的第五个方面，提供一种计算机可读存储介质，其上存储有计算机程序，其中，该程序被处理器执行时实现前述任意一种分播墙的配置方法。
根据本公开一些实施例的第六个方面，提供一种计算机程序，包括：指令，所述指令当由处理器执行时使所述处理器执行前述任意一种分播墙的配置方法。
通过以下参照附图对本公开的示例性实施例的详细描述，本公开的其它特征及其优点将会变得清楚。
附图说明
为了更清楚地说明本公开实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本公开的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1示出了根据本公开一些实施例的分播墙的配置方法的流程示意图。
图2示出了根据本公开一些实施例的资源消耗信息确定方法的流程示意图。
图3示出了根据本公开一些实施例的目标格口数确定方法的流程示意图。
图4示出了根据本公开一些实施例的分播墙的配置装置的结构示意图。
图5示出了根据本公开一些实施例的分播墙的配置系统的结构示意图。
图6示出了根据本公开另一些实施例的分播墙的配置装置的结构示意图。
图7示出了根据本公开又一些实施例的分播墙的配置装置的结构示意图。
具体实施方式
下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本公开一部分实施例，而不是全部的实施例。以下对至少一个示例性实施例的描述实际上仅仅是说明性的，决不作为对本公开及其应用或使用的任何限制。基于本公开中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
除非另外具体说明，否则在这些实施例中阐述的部件和步骤的相对布置、数字表达式和数值不限制本公开的范围。
同时，应当明白，为了便于描述，附图中所示出的各个部分的尺寸并不是按照实际的比例关系绘制的。
对于相关领域普通技术人员已知的技术、方法和设备可能不作详细讨论，但在适当情况下，所述技术、方法和设备应当被视为说明书的一部分。
在这里示出和讨论的所有示例中，任何具体值应被解释为仅仅是示例性的，而不是作为限制。因此，示例性实施例的其它示例可以具有不同的值。
应注意到：相似的标号和字母在下面的附图中表示类似项，因此，一旦某一项在一个附图中被定义，则在随后的附图中不需要对其进行进一步讨论。
通过对相关技术进行分析后发现，由于采用全部格口，因此分播墙实际的SKU(Stock Keeping Unit，库存量单位)分组策略和格口使用率都会受到格口数量影响。而格口数一般直接通过工作人员根据过往经验给出，容易出现由于实际项目中规划的分播墙格口数过多，导致整体利用率低，造成浪费的问题；或者，由于格口数过少，导致分播过程中格口爆满，使得货物重投次数太多，造成分播效率不足的问题。
本公开实施例所要解决的一个技术问题是：如何提高物流处理的效率。
首先，示例性地描述分播墙的主要组成部分。
在一些实施例中，分播墙包括分播设备、格口设备及软件系统。分播设备包括分播车、供包台、扫描设备、操作终端；格口设备包括货架、周转箱、射频识别(Radio Frequency Identification，简称：RFID)标签及读卡器；软件系统包括仓库控制系统(Warehouse Control System，简称：WCS)及调度系统。
然后，示例性地描述利用分播墙处理货物的过程。
在一些实施例中，工作人员将货物放置到供包台。扫描设备读取货物的信息，确定货物所属的格口。系统调度分播车将该货物通过小车搬运，小车上的皮带将货物传动送到分播墙中的对应格口，货物通过格口自动落入到格口对应的周转箱中。当收到格口对应的周转箱已满的提示，换箱工作人员会将该周转箱取出、并摆放到指定的位置，然后将空的周转箱放置到该格口处。
对于逆向物流领域，例如退货领域，上架工作人员会将已满的周转箱中的货物进行上架操作，即，将货物根据SKU等货物类型信息，将其归置于储位。当然，分播墙也可以应用于货物出库，这里不再赘述。
本领域技术人员应当清楚，上述实施例仅为示例性的。根据需要，本领域技术人员可以采用其他结构的分播墙，或者，基于其他使用流程使用分播墙进行分播操作。
图1示出了根据本公开一些实施例的分播墙的配置方法的流程示意图。如图1所示，该实施例的分播墙的配置方法包括步骤S102～S106。
在步骤S102中，对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息。
例如，备选的格口数包括a、b、c，则可以分别计算格口数为a时的资源消耗信息、格口数为b时的资源消耗信息、格口数为c时的资源消耗信息。
资源消耗信息可以是对人力或时间的消耗信息，例如，资源消耗信息包括换箱人数、上架人数、任务时长中的至少一种。
格口数的变化会影响整体的操作效率。例如，由于格口数增加，分播墙整体长度会增加，因此换箱人员将已满的周转箱摆放到指定位置过程的行走时间会增加；又例如，格口数增加时，每个周转箱内的SKU数量会降低，上架人员完成周转箱内所有SKU的上架的行走距离及分类难度可以降低，因此会缩短上架行走单位时间。
在步骤S104中，根据每个备选的格口数对应的资源消耗信息，从多个备选的格口数中选择目标格口数。
在一些实施例中，选择资源消耗最少的格口数。例如，选择所需工作人员最少的格口数，或者，选择消耗的时间最短的格口数，或者，综合这两种因素进行考虑。当然，还可以参考其他因素。当资源消耗信息采用多种因素进行衡量时，可以根据多个维度的加权结果来确定，权重可以根据需要进行设置。
当然，本领域技术人员也可以结合资源消耗信息和其他的信息，综合地确定目标格口数。
在步骤S106中，根据目标格口数，对分播墙进行配置。
在一些实施例中，在分播墙中，根据目标格口数，开放相应数量的格口。例如，目标格口数为80，则可以开放分播墙中的80个格口。
分播墙格口开放的配置方式可以有多种。例如，可以将开放的格口设置为可用，使得系统在读取格口的信息时，仅读取开放的格口的信息；又例如，对于可扩展的分播墙，可以通过移除或添加格口模块来增加或缩短分播墙的实际尺寸。
本公开的实施例能够根据多个格口数对应的资源消耗信息，选择目标格口数，并配置分播墙，使得在提高分播墙格口利用率的同时、提高处理效率，从而能够从整体上提高物流处理的效率。
下面参考图2示例性地描述确定每个格口数所对应的资源消耗信息的方法的实施 例。
图2示出了根据本公开一些实施例的资源消耗信息确定方法的流程示意图。如图2所示，该实施例的确定方法包括步骤S202～S206。
在步骤S202中，确定备选的格口数所影响的任务参数。
在一些实施例中，备选的格口数所影响的任务参数包括分播墙的换箱单位时间、货物的上架行走单位时间中的至少一种。
换箱单位时间是指换箱工作人员进行周转箱的更换操作所需的平均时间，该操作包括将分播墙中的周转箱放置到指定位置，并在该周转箱的原格口处放置空的新周转箱。由于格口数增加时，分播墙、或分播墙的可用部分的整体长度会增加，因此人员换箱之后将箱子摆放到指定位置过程的行走时间会增加。即，换箱单位时间与备选的格口数成正相关关系。
货物的上架行走单位时间是指上架人员获取到已满的周转箱后，将其中的货物上架所需的时间，包括行走到巷道的平均时间、以及巷道内行走的平均时间。由于格口数增加时，每个周转箱内的货物种类会减少，上架人员完成周转箱内所有货物的上架操作时，行走距离会减少。即，货物的上架行走单位时间与备选的格口数成负相关关系。
在步骤S204中，利用任务参数，确定换箱总时长的表征和上架总时长的表征。
在一些实施例中，换箱总时长的表征利用换箱单位时间、换箱次数和换箱人数确定。换箱次数可以利用待处理的分播单数据进行模拟而得到。换箱总时长与换箱单位时间和换箱次数成正相关关系，与换箱人数成负相关关系。例如，通过令换箱单位时间、换箱次数的乘积除以换箱人数，获得换箱总时长。
在一些实施例中，上架总时长的表征利用上架单位时间、上架次数、上架行走单位时间和上架人数确定。换箱次数可以利用待处理的分播单数据进行模拟而得到，或者，根据待处理的分播单的属性信息，对相似的数据进行模拟而得到。上架总时长与上架单位时间、上架次数和上架行走单位时间成正相关关系，与上架人数成负相关关系。例如，计算上架单位时间与上架行走单位时间之和，再乘以上架次数，然后求该乘积与上架人数比对比值，作为上架总时长。
上架行走单位时间包括行走到巷道的平均时间、以及巷道内行走的平均时间。走到巷道的平均时间可以视为常量。巷道内行走的平均时间可以根据周转箱内的货物种类(例如SKU)的平均数量确定。在一些实施例中，巷道内行走的平均时间为周转箱 内的货物种类的平均数量减1后得到的差值除以3，再乘以巷道长度。
在步骤S206中，以令分播总时长不小于换箱总时长和上架总时长为约束，确定格口数对应的资源消耗信息。
物流处理过程可以示例性地划分为分播、换箱、上架三个阶段，而这三个阶段可以并行执行。分播总时长主要受分播墙的机械运行效率影响，因此相对固定。可以通过模拟待处理的分播单来确定分播总时长。而换箱总时长和上架总时长会受到投入的资源的影响，例如，投入的人力的影响。因此，通过使得分播总时长、换箱总时长和上架总时长中，分播总时长为最大值，可以求解使得整体效率最高的任务参数和资源消耗信息。
下面参考图3描述目标格口数确定方法的实施例。
图3示出了根据本公开一些实施例的目标格口数确定方法的流程示意图。如图3所示，该实施例的目标格口数确定方法包括步骤S302～S306。
在步骤S302中，令分播总时长不小于换箱总时长、上架总时长为约束，求解换箱总时长的表征中的换箱人数、以及上架总时长的表征中的上架人数，其中，换箱总时长还利用换箱人数表征、上架总时长还利用上架人数表征。
在步骤S304中，利用求解的换箱人数和上架人数，确定该格口数对应的分播总时长和上架总时长。即，将换箱人数和上架人数分别代入到换箱总时长的表征和上架总时长的表征中。
在步骤S306中，根据分播总时长、换箱总时长和上架总时长中的最大值，确定任务完成时长。
从而，可以获得包括分播总时长、上架总时长和任务完成时长的资源消耗信息。利用这些信息，可以综合地评价每个格口数的资源消耗情况，从而能够从人力和效率两个方面综合地对各个格口数的效果进行预测。
在一些实施例中，可以根据实际的分播任务动态地对分播墙进行配置。例如，在从数据库中读取了当前的待处理的分播任务数据后，根据这些数据计算每个格口对应的资源消耗信息，进而确定目标格口数，并对分播墙进行配置。随着分播任务的变换，可以再次确定目标格口数。从而，使得分播墙的配置能够适配当前的分播任务，进一步提高了分播任务的处理效率。
下面参考图4描述本公开分播墙的配置装置的实施例。
图4示出了根据本公开一些实施例的分播墙的配置装置的结构示意图。如图4所 示，该实施例的分播墙的配置装置40包括：确定模块410，被配置为对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；选择模块420，被配置为根据每个备选的格口数对应的资源消耗信息，从多个备选的格口数中选择目标格口数；以及配置模块430，被配置为根据目标格口数，对分播墙进行配置。
分播墙的配置装置40可以配置在分播墙的软件系统中，也可以部署在独立的计算机系统中。
在一些实施例中，资源消耗信息包括换箱人数、上架人数、任务时长中的至少一种。
在一些实施例中，确定模块410进一步被配置为确定备选的格口数所影响的任务参数；利用任务参数，确定换箱总时长的表征和上架总时长的表征；和以令分播总时长不小于换箱总时长和上架总时长为约束，确定格口数对应的资源消耗信息。
在一些实施例中，备选的格口数所影响的任务参数包括分播墙的换箱单位时间、货物的上架行走单位时间中的至少一种。
在一些实施例中，换箱单位时间与备选的格口数成正相关关系；货物的上架行走单位时间与备选的格口数成负相关关系。
在一些实施例中，任务参数包括分播墙的换箱单位时间；资源消耗信息包括换箱人数；换箱总时长的表征利用换箱单位时间、换箱次数和换箱人数确定。
在一些实施例中，换箱总时长与换箱单位时间和换箱次数成正相关关系，与换箱人数成负相关关系。
在一些实施例中，任务参数包括货物的上架行走单位时间；资源消耗信息包括上架人数；上架总时长的表征利用上架单位时间、上架次数、上架行走单位时间和上架人数确定。
在一些实施例中，上架总时长与上架单位时间、上架次数和上架行走单位时间成正相关关系，与上架人数成负相关关系。
在一些实施例中，上架行走单位时间包括行走到巷道的平均时间、以及巷道内行走的平均时间。
在一些实施例中，巷道内行走的平均时间根据周转箱内的货物种类的平均数量确定。
在一些实施例中，换箱总时长还利用换箱人数表征、上架总时长还利用上架人数表征，并且确定模块410进一步被配置为令分播总时长不小于换箱总时长、上架总时 长为约束，求解换箱总时长的表征中的换箱人数、以及上架总时长的表征中的上架人数；利用求解的换箱人数和上架人数，确定格口数对应的分播总时长和上架总时长；根据分播总时长、换箱总时长和上架总时长中的最大值，确定任务完成时长。
在一些实施例中，配置模块430进一步被配置为在分播墙中，根据目标格口数，开放相应数量的格口。
下面参考图5描述本公开分播墙的配置系统的实施例。
图5示出了根据本公开一些实施例的分播墙的配置系统的结构示意图。如图5所示，该实施例的分播墙的配置系统5包括：分播墙的配置装置51，其具体实施方式可以参考本公开任意实施例中的分播墙的配置装置；以及分播墙52。
在一些实施例中，当分播墙52包括了软件系统时，分播墙的配置装置51可以部署在分播墙以外的独立计算设备中；当分播墙52不包括软件系统时，分播墙的配置装置51可以部署在分播墙以外的独立计算设备中、或者部署在与分播墙52配套的软件系统中。
图6示出了根据本公开另一些实施例的分播墙的配置装置的结构示意图。如图6所示，该实施例的分播墙的配置装置60包括：存储器610以及耦接至该存储器610的处理器620，处理器620被配置为基于存储在存储器610中的指令，执行前述任意一个实施例中的分播墙的配置方法。
其中，存储器610例如可以包括系统存储器、固定非易失性存储介质等。系统存储器例如存储有操作系统、应用程序、引导装载程序(Boot Loader)以及其他程序等。
图7示出了根据本公开又一些实施例的分播墙的配置装置的结构示意图。如图7所示，该实施例的分播墙的配置装置70包括：存储器710以及处理器720，还可以包括输入输出接口730、网络接口740、存储接口750等。这些接口730，740，750以及存储器710和处理器720之间例如可以通过总线770连接。其中，输入输出接口730为显示器、鼠标、键盘、触摸屏等输入输出设备提供连接接口。网络接口740为各种联网设备提供连接接口。存储接口750为SD卡、U盘等外置存储设备提供连接接口。
本公开的实施例还提供一种计算机可读存储介质，其上存储有计算机程序，其特征在于，该程序被处理器执行时实现前述任意一种分播墙的配置方法。
本领域内的技术人员应当明白，本公开的实施例可提供为方法、系统、或计算机程序产品。因此，本公开可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本公开可采用在一个或多个其中包含有计算机可用程 序代码的计算机可用非瞬时性存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本公开是参照根据本公开实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解为可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
以上所述仅为本公开的较佳实施例，并不用以限制本公开，凡在本公开的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (18)

  1. 一种分播墙的配置方法，包括：
    对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；
    根据每个备选的格口数对应的资源消耗信息，从所述多个备选的格口数中选择目标格口数；和
    根据所述目标格口数，对所述分播墙进行配置。
  2. 根据权利要求1所述的配置方法，其中，所述资源消耗信息包括换箱人数、上架人数、任务时长中的至少一种。
  3. 根据权利要求1或2所述的配置方法，其中，所述确定每个格口数所对应的资源消耗信息包括：
    确定所述备选的格口数所影响的任务参数；
    利用所述任务参数，确定换箱总时长的表征和上架总时长的表征；和
    以令所述分播总时长不小于所述换箱总时长和所述上架总时长为约束，确定所述格口数对应的资源消耗信息。
  4. 根据权利要求3所述的配置方法，其中，所述备选的格口数所影响的任务参数包括分播墙的换箱单位时间、货物的上架行走单位时间中的至少一种。
  5. 根据权利要求4所述的配置方法，其中：
    所述换箱单位时间与所述备选的格口数成正相关关系；
    所述货物的上架行走单位时间与所述备选的格口数成负相关关系。
  6. 根据权利要求3～5中任一项所述的配置方法，其中：
    所述任务参数包括分播墙的换箱单位时间；
    所述资源消耗信息包括换箱人数；
    所述换箱总时长的表征利用所述换箱单位时间、换箱次数和所述换箱人数确定。
  7. 根据权利要求6所述的配置方法，其中，所述换箱总时长与所述换箱单位时间和换箱次数成正相关关系，与所述换箱人数成负相关关系。
  8. 根据权利要求3～7中任一项所述的配置方法，其中：
    所述任务参数包括货物的上架行走单位时间；
    所述资源消耗信息包括上架人数；
    所述上架总时长的表征利用上架单位时间、上架次数、所述上架行走单位时间和 所述上架人数确定。
  9. 根据权利要求8所述的配置方法，其中，所述上架总时长与所述上架单位时间、上架次数和上架行走单位时间成正相关关系，与所述上架人数成负相关关系。
  10. 根据权利要求4～9中任一项所述的配置方法，其中，所述上架行走单位时间包括行走到巷道的平均时间、以及巷道内行走的平均时间。
  11. 根据权利要求10所述的配置方法，其中，所述巷道内行走的平均时间根据周转箱内的货物种类的平均数量确定。
  12. 根据权利要求3～11中任一项所述的配置方法，其中，所述换箱总时长还利用换箱人数表征、所述上架总时长还利用上架人数表征，并且所述以令所述分播总时长不小于所述换箱总时长和所述上架总时长为约束，确定所述格口数对应的资源消耗信息包括：
    令所述分播总时长不小于所述换箱总时长、所述上架总时长为约束，求解所述换箱总时长的表征中的换箱人数、以及所述上架总时长的表征中的上架人数；
    利用求解的换箱人数和上架人数，确定所述格口数对应的分播总时长和上架总时长；
    根据所述分播总时长、所述换箱总时长和所述上架总时长中的最大值，确定任务完成时长。
  13. 根据权利要求1～12中任一项所述的配置方法，其中，所述根据所述目标格口数，对所述分播墙进行配置包括：
    在所述分播墙中，根据所述目标格口数，开放相应数量的格口。
  14. 一种分播墙的配置装置，包括：
    确定模块，被配置为对于分播墙的多个备选的格口数，确定每个格口数所对应的资源消耗信息；
    选择模块，被配置为根据每个备选的格口数对应的资源消耗信息，从所述多个备选的格口数中选择目标格口数；以及
    配置模块，被配置为根据所述目标格口数，对所述分播墙进行配置。
  15. 一种分播墙的配置装置，包括：
    存储器；以及
    耦接至所述存储器的处理器，所述处理器被配置为基于存储在所述存储器中的指令，执行如权利要求1～13中任一项所述的分播墙的配置方法。
  16. 一种分播墙的配置系统，包括：
    权利要求14或15所述的分播墙的配置装置；以及
    分播墙。
  17. 一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现权利要求1～13中任一项所述的分播墙的配置方法。
  18. 一种计算机程序，包括：
    指令，所述指令当由处理器执行时使所述处理器执行根据权利要求1～13中任一项所述的分播墙的配置方法。
PCT/CN2023/130379 2023-04-19 2023-11-08 分播墙的配置方法、装置、系统和存储介质 WO2024216930A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202310423404.0A CN116451957A (zh) 2023-04-19 2023-04-19 分播墙的配置方法、装置、系统和存储介质
CN202310423404.0 2023-04-19

Publications (1)

Publication Number Publication Date
WO2024216930A1 true WO2024216930A1 (zh) 2024-10-24

Family

ID=87125210

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/130379 WO2024216930A1 (zh) 2023-04-19 2023-11-08 分播墙的配置方法、装置、系统和存储介质

Country Status (2)

Country Link
CN (1) CN116451957A (zh)
WO (1) WO2024216930A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116451957A (zh) * 2023-04-19 2023-07-18 北京京东乾石科技有限公司 分播墙的配置方法、装置、系统和存储介质
CN118095768A (zh) * 2023-04-19 2024-05-28 北京京东乾石科技有限公司 自动分播方法、装置、系统和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110322069A (zh) * 2019-07-03 2019-10-11 广州品唯软件有限公司 一种基于路径优化的商品播种上下架方法及装置
CN112967003A (zh) * 2021-03-31 2021-06-15 深圳市库宝软件有限公司 订单分配方法、装置、设备及存储介质
CN114873129A (zh) * 2022-05-24 2022-08-09 浙江凯乐士科技集团股份有限公司 一种仓储播种方法及播种系统
WO2023051161A1 (zh) * 2021-09-29 2023-04-06 深圳市海柔创新科技有限公司 货品处理方法、装置、设备、仓储系统及存储介质
CN116451957A (zh) * 2023-04-19 2023-07-18 北京京东乾石科技有限公司 分播墙的配置方法、装置、系统和存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110322069A (zh) * 2019-07-03 2019-10-11 广州品唯软件有限公司 一种基于路径优化的商品播种上下架方法及装置
CN112967003A (zh) * 2021-03-31 2021-06-15 深圳市库宝软件有限公司 订单分配方法、装置、设备及存储介质
WO2023051161A1 (zh) * 2021-09-29 2023-04-06 深圳市海柔创新科技有限公司 货品处理方法、装置、设备、仓储系统及存储介质
CN114873129A (zh) * 2022-05-24 2022-08-09 浙江凯乐士科技集团股份有限公司 一种仓储播种方法及播种系统
CN116451957A (zh) * 2023-04-19 2023-07-18 北京京东乾石科技有限公司 分播墙的配置方法、装置、系统和存储介质

Also Published As

Publication number Publication date
CN116451957A (zh) 2023-07-18

Similar Documents

Publication Publication Date Title
WO2024216930A1 (zh) 分播墙的配置方法、装置、系统和存储介质
CN109255569B (zh) 库内理货方法、装置、服务器和存储介质
CN109978423A (zh) 库存调度方法、装置以及计算机可读存储介质
CN108398924A (zh) 机器人搬运车的调度方法和调度装置
Koch et al. A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints
CN109823755B (zh) 物流分拣信息的处理方法、装置、系统、设备和存储介质
Jiang et al. Picking-replenishment synchronization for robotic forward-reserve warehouses
CN109146350A (zh) 一种仓库的发货操作执行方法和装置
CN112561416A (zh) 一种用于货物分拣出库的方法和装置
CN111573292A (zh) 码垛方法、装置、电子设备及计算机可读存储介质
CN111784469A (zh) 一种订单分播复核方法、装置、设备及存储介质
CN109359902A (zh) 一种工单分配方法、装置、服务器及存储介质
CN111507651A (zh) 应用于人机混合仓库的订单数据处理方法和装置
WO2020144879A1 (ja) 入出庫管理装置、入出庫管理システム、入出庫管理方法およびプログラム
CN112149925A (zh) 仓储任务自动分拨方法和装置、仓储管理方法和系统
WO2024216931A1 (zh) 自动分播方法、装置、系统和存储介质
CN110910065A (zh) 基于大数据和知识图谱的仓库空间分配方法及系统
CN112712320A (zh) 一种钢筋运输方法、装置及系统
CN116664053B (zh) 一种商品库存管理方法
CN112288351A (zh) 一种退货订单分拣方法及装置
CN110880089A (zh) 基于知识图谱的仓库空间分配方法及系统
CN112668951A (zh) 一种任务处理方法、装置、服务器及存储介质
CN112990628A (zh) 分拣设备调度方法、装置及计算机可读存储介质
CN115907584A (zh) 拣选任务的执行方法、装置、设备及存储介质
CN114590508A (zh) 一种用于立体库的堆垛机任务调度方法、装置及系统