Algorithm selection method and program

Abstract

An algorithm selection method for selecting one of a plurality of algorithms for allocating, as a worker task to be performed by a warehouse worker, at least one of a plurality of tasks constituting work to be performed by a worker and a conveyance device on the basis of a warehouse work plan, said method being configured so as to select an algorithm satisfying a prescribed condition from among the plurality of algorithms on the basis of work simulation execution results for cases in which the worker task is allocated to the worker using each of the plurality of algorithms.

Description

Algorithm Selection Method and Program

[0001] The present disclosure relates to an algorithm selection method and a program.

[0002] Conventionally, a technique for simulating operations in a warehouse using simulation has been known. For example, Patent Document 1 discloses an industrial system simulator that generates a simulation model simulating an industrial system having an operation process in an automated warehouse.

[0003] Japanese Patent Application Laid-Open No. 2024-21611

[0004] In conventional operations in a warehouse, in many cases, an operator takes out (picks) the goods stored in the warehouse and transports them to a pre-specified loading area. However, recently, there have been cases where operations in a warehouse are performed through the cooperation of an operator and a robot. For example, there may be a case where a conveying device such as a robot conveys the goods picked by the operator. In the cooperation between an operator and a robot, for example, a conveying device such as a robot waits on a shelf in the warehouse, the operator places the goods on the conveying device from the shelf, and then the conveying device moves to the loading area and transports them. Assuming such a form, since the operator performs picking according to the assigned task, the way of assigning tasks to the operator can vary the efficiency of operations in the warehouse. Therefore, the importance of an algorithm for assigning tasks to the operator to improve the efficiency of operations in the warehouse is increasing.

[0005] An algorithm for assigning tasks to an operator is developed, for example, through the reproduction results of operations in a warehouse by simulation. And based on the developed algorithm, when tasks are assigned to the operator, the operator can perform picking according to the tasks assigned to himself / herself. However, the algorithm may not be suitable from the viewpoint of improving the efficiency of operations in the warehouse. This is because an algorithm more suitable for improving operation efficiency varies depending on the situation of the warehouse, such as the arrangement of operators or conveying devices.

[0006] This disclosure was devised in light of the conventional circumstances described above and aims to improve the efficiency of operations in warehouses.

[0007] This disclosure provides an algorithm selection method for selecting one of a plurality of algorithms for assigning at least one of a plurality of tasks that constitute work performed by workers and conveying equipment based on a warehouse work plan as a worker task to be performed by a warehouse worker, wherein the algorithm selection method selects one of the plurality of algorithms that satisfies predetermined conditions based on the results of running a simulation of the work when the worker task is assigned to the worker using each of the plurality of algorithms.

[0008] Furthermore, this disclosure provides a program for causing a computer to select one of a plurality of algorithms for assigning at least one of a plurality of tasks that constitute work performed by workers and transport equipment based on a warehouse work plan as a worker task to be performed by a warehouse worker, the program for causing the computer to select an algorithm from the plurality of algorithms that satisfies predetermined conditions based on the results of running a simulation of the work when the worker task is assigned to the worker using each of the plurality of algorithms.

[0009] Furthermore, any combination of the above components, as well as any conversion of the expressions of this disclosure between methods, apparatus, systems, storage media, computer programs, etc., are also valid as aspects of this disclosure.

[0010] According to this disclosure, it is possible to improve the efficiency of operations in warehouses.

[0011] Block diagram showing an example configuration of a warehouse system according to Embodiment 1 Block diagram showing an example hardware configuration of an information processing device according to one embodiment of this disclosure Table diagram showing a shipping plan and tasks according to one embodiment of this disclosure Sequence diagram showing warehouse work execution processing of a warehouse system according to Embodiment 1 Block diagram showing an example configuration of a warehouse system according to Embodiment 2 Graph diagram for comparing algorithms according to one embodiment of this disclosure Graph diagram for comparing algorithms according to one embodiment of this disclosure Table diagram showing an example of a quick reference table according to Embodiment 2 Sequence diagram showing warehouse work execution processing of a warehouse system according to Embodiment 2

[0012] The following description will detail embodiments specifically disclosing the algorithm selection method and program related to this disclosure, with reference to the drawings as appropriate. However, unnecessarily detailed explanations may be omitted. For example, detailed explanations of already well-known matters or redundant explanations of substantially identical configurations may be omitted. This is to avoid the following explanation becoming unnecessarily verbose and to facilitate understanding by those skilled in the art. The accompanying drawings and the following description are provided to enable those skilled in the art to fully understand this disclosure and are not intended to limit the subject matter described in the claims.

[0013] (Embodiment 1) [System Configuration] Figure 1 is a block diagram showing an example configuration of a warehouse system 1 according to Embodiment 1. Note that the system configuration shown in Figure 1 is just one example, and one system may be divided into multiple parts, or multiple systems may be combined into one. Furthermore, multiple instances of the single system or device shown in Figure 1 may be provided. Moreover, the processing entities shown below are just examples, and a part of the function of one system may be realized as the function of another system.

[0014] Warehouse system 1 comprises a warehouse management system 10, a warehouse operation management system 20, a simulation system 30, transport equipment 40, and worker terminals 50. Each component of warehouse system 1 may be configured to communicate with one another via a network (not shown).

[0015] The warehouse management system 10 is a system that manages and controls logistics within a warehouse. The warehouse management system 10 can, for example, manage inventory management of goods within the warehouse, the inflow and outflow of goods (e.g., receiving and shipping), and the movement of goods. In this specification, "goods" includes merchandise and cargo, and these terms may be interpreted interchangeably. The warehouse management system 10 may be referred to as a Warehouse Management System (hereinafter referred to as "WMS"), etc. The warehouse management system 10 may have a configuration similar to, for example, the information processing device 70 (see Figure 2) described later. The warehouse management system 10 is composed of a processor 71 and a memory 72. Various functions of the warehouse management system 10 are realized through the cooperation of the processor 71 and the memory 72 of the warehouse management system 10. The warehouse management system 10 stores and retains inventory information 11 and shipping plans 12 in the memory 72. The inventory information 11 is information on the inventory of goods in the warehouse. Shipping plan 12 is an example of a warehouse work plan; details will be described later with reference to Figure 3.

[0016] The warehouse operation management system 20 is a system that manages and controls operations within a warehouse. The warehouse operation management system 20 may be referred to as a Warehouse Execution System (hereinafter referred to as "WES"), etc. The warehouse operation management system 20 may have a configuration similar to that of the information processing device 70 described later. The warehouse operation management system 20 provides comprehensive control over the work content of various work entities within the warehouse, and the equipment within the warehouse. Examples of various work entities within the warehouse include workers and robots. An example of a robot is a transport device 40 that transports goods. The warehouse operation management system 20 is composed of a processor 71 and a memory 72. Various functions of the warehouse operation management system 20 are realized through the cooperation of the processor 71 and the memory 72 of the warehouse operation management system 20. Specifically, various functions such as the task assignment system 22 and the resource selection system 23 described later are realized through the cooperation of the processor 71 and the memory 72 of the warehouse operation management system 20. The warehouse operation management system 20 stores and maintains resource information 21 in memory 72. Resource information 21 includes information about workers and robots in the warehouse. The warehouse operation management system 20 also stores and maintains multiple algorithms, such as algorithm A, algorithm B, algorithm C, and algorithm D, in memory 72. The algorithms will be described later. These algorithms are used by the resource selection system 23.

[0017] The simulation system 30 is a system that performs simulations of warehouse operations. In this disclosure, simulation may be referred to as "SIM". The simulation system 30 may have a configuration similar to, for example, the information processing device 70 described later. The simulation system 30 is configured to include a processor 71 and a memory 72. The simulation of warehouse operations is realized through the cooperation of the processor 71 and the memory 72 of the simulation system 30. The simulation system 30 may perform simulations using known technologies. For example, the simulation system 30 may use the technology disclosed in Japanese Patent No. 7493191. The simulation system 30 may acquire or receive various data or information for performing simulations from the warehouse management system 10 or the warehouse operation management system 20. Alternatively, the simulation system 30 may accept user input of various data or information for performing simulations.

[0018] The transport equipment 40 is deployed in the warehouse and performs tasks, for example, in cooperation with workers. For example, the transport equipment 40 may transport items picked by workers. Specifically, the transport equipment 40 may wait near shelves where items are stored in the warehouse, workers may pick items from the shelves and place them on the transport equipment 40, and then the transport equipment 40 may move to the loading area. The loading area is an area within the warehouse where items are loaded onto vehicles for shipping, etc.

[0019] The worker terminal 50 is an information processing device configured to be usable by workers both inside and outside the warehouse. The worker terminal 50 may be, for example, a tablet terminal, a Point of Sales (POS) terminal, a handheld terminal, or a mobile terminal such as a smartphone.

[0020] In this embodiment, inventory information 11 and a shipping plan 12 are transmitted from the warehouse management system 10 to the warehouse operation management system 20. Here, the tasks included in the shipping plan 12 include tasks performed by workers and tasks performed by transport equipment 40 (see Figure 3). The warehouse operation management system 20 causes workers and transport equipment 40 to perform the multiple tasks that make up the shipping plan 12. Specifically, the task assignment system 22 requests the resource selection system 23 to select the resources (i.e., workers or transport equipment 40) to be assigned to the tasks. In this embodiment, when the resource selection system 23 assigns a task to the transport equipment 40 as a transport equipment task to be performed by the transport equipment 40, it is not limited whether each of the transport equipment 40 is distinguished or not. On the other hand, when the resource selection system 23 assigns a task to a worker as a worker task to be performed by the worker, it distinguishes each worker and assigns the worker task accordingly. For the sake of simplicity, in the description of this embodiment, it is assumed that each of the transport equipment 40 is not distinguished.

[0021] When the task assignment system 22 requests the resource selection system 23 to select workers to be assigned to worker tasks, it transmits worker task information (worker task information) and worker information (worker information) to the resource selection system 23. The worker information is included in the resource information 21 and includes at least worker identification (hereinafter referred to as "ID") for identifying the worker.

[0022] The resource selection system 23 causes the simulation system 30 to run a simulation of warehouse operations when worker tasks are assigned to workers using each of several pre-developed algorithms. In the example in Figure 1, algorithms A, B, C, and D have been pre-developed. The algorithms may be developed to assign at least one of several tasks that constitute the work performed by workers and transport equipment 40 based on the warehouse work plan as a worker task to be performed by a warehouse worker. Simply put, the algorithms can be used to select the worker to whom a worker task will be assigned. The algorithms may be developed in advance by the user, for example, and stored and maintained in the warehouse operation management system 20. Note that the number of algorithms is not limited to four; for example, more algorithms may be developed, or there may be two or three.

[0023] This allows the resource selection system 23 to obtain simulation results of warehouse operations when assigning worker tasks to workers using algorithm A. The same applies when the resource selection system 23 uses algorithms B, C, and D. The simulation results may include, for example, the total working time in the warehouse and the total distance traveled by workers in the warehouse. Here, for example, the total working time in the warehouse is set as the evaluation target for the algorithm. In other words, the shorter the total working time in the warehouse, the higher the algorithm is evaluated. For example, if the resource selection system 23 determines from the simulation results of assigning worker tasks to workers using each of the multiple algorithms that using algorithm A results in the shortest total working time, the resource selection system 23 selects workers to assign to worker tasks using algorithm A. Then, it sends the worker ID of the selected worker to the task assignment system 22.

[0024] The method by which the resource selection system 23 assigns tasks for transport equipment to the transport equipment 40 is not limited; for example, an algorithm developed in advance by the user may be used.

[0025] The task assignment system 22 assigns worker tasks to workers selected by the resource selection system 23 as recipients of worker tasks. Similarly, the task assignment system 22 assigns tasks to transport equipment 40. The warehouse operation management system 20 transmits worker tasks to worker terminals 50. Workers can check the tasks displayed (output) on the screen of the worker terminal 50 and execute the assigned worker tasks. The warehouse operation management system 20 also transmits transport equipment tasks to the transport equipment 40. Based on the received transport equipment tasks, the transport equipment 40 can, for example, move within the warehouse or transport goods to their destination. The warehouse operation management system 20 can also receive location information and task completion notifications from the transport equipment 40 and worker terminals 50 when a task is completed. For example, the worker terminal 50 can transmit information such as barcode readings of goods and user input operations to the warehouse operation management system 20, and the warehouse operation management system can recognize task completion.

[0026] [Hardware Configuration Example] Each system shown in Figure 1 may be configured as an on-premise server device at a location where a warehouse is set up, or it may be configured as a cloud-based system on a network. Figure 2 is a block diagram showing an example of the hardware configuration of an information processing device 70 according to one embodiment of this disclosure. The information processing device 70 may be composed of a general-purpose computer device such as a Personal Computer (hereinafter referred to as "PC") or a server computer. The information processing device 70 is applicable as a device that constitutes each system. Here, the configuration of the devices that constitute each system is described as being the same, but some parts may be omitted or other parts may be added depending on the function to be provided. An example of an added part is a barcode reader used to obtain information from barcodes attached to items or bins in the warehouse.

[0027] The information processing device 70 comprises a processor 71, memory 72, input device 73, output device 74, communication device 75, and external interface device 76. Each component is configured to communicate via an internal interface 77.

[0028] The processor 71 may be configured using, for example, a Central Processing Unit (hereinafter referred to as "CPU"), a Graphical Processing Unit (hereinafter referred to as "GPU"), a Micro Processing Unit (hereinafter referred to as "MPU"), a Digital Signal Processor (hereinafter referred to as "DSP"), or a Field Programmable Gate Array (hereinafter referred to as "FPGA"). The processor 71 realizes various functions, for example, by referring to various data stored in memory 72 or by reading programs.

[0029] Memory 72 is a storage unit for storing and holding various data and programs. Memory 72 may consist of volatile / non-volatile storage devices such as Random Access Memory (hereinafter referred to as "RAM"), Read Only Memory (hereinafter referred to as "ROM"), Hard Disk Drive (hereinafter referred to as "HDD"), or Solid State Drive (hereinafter referred to as "SSD").

[0030] The input device 73 receives operations and instructions from warehouse users (e.g., managers or workers). The input device 73 may consist of, for example, a mouse, keyboard, touch panel display, etc.

[0031] The output device 74 displays various user interfaces to the user. The output device 74 may consist of, for example, a liquid crystal display or a touch panel display.

[0032] The communication device 75 is an interface device for communicating with an external device or system via a network (not shown). The communication standards that the communication device 75 can support are not particularly limited and may support either wired or wireless communication standards. Furthermore, the communication device 75 may support multiple communication standards. Therefore, the network (not shown) used by the communication device 75 may be composed of a combination of networks using multiple communication standards.

[0033] The external interface device 76 is an interface device for communicating with an external device or system. The information processing device 70 may be connected to the external device or system via the communication device 75 and a network (not shown) for communication purposes. The external device or system is not limited to the systems shown in Figure 1; other systems may also be used.

[0034] [Tasks for Workers and Tasks for Transport Equipment] Figure 3 is a table diagram showing a shipping plan 12 and tasks according to one embodiment of the present disclosure. The shipping plan 12 consists of one or more subplans. For example, the shipping plan 12 includes a subplan P1. The subplan also consists of one or more tasks. For example, subplan P1 includes tasks T1 and T2.

[0035] A sub-plan includes information such as batch ID, item ID, quantity, and shelf ID. The batch ID is an ID that identifies a series of related sub-plans or items. For example, if the same batch ID is associated with multiple sub-plans, those multiple sub-plans can be identified as a single group. The item ID is an ID used to identify an item. The quantity indicates the number of items to be shipped. The shelf ID indicates which shelf in the warehouse the shipped items are stored on. For example, sub-plan P1 indicates the shipment of two items with item ID "item0001" stored on shelf with shelf ID "shelf07". The batch ID for sub-plan P1 is "1".

[0036] A task includes information such as the task, item ID, quantity, destination, and assigned resource type. The task information indicates the content of the work to be done when the task is assigned. The explanation of the item ID and quantity is omitted as it is as described above. The destination indicates the location within the warehouse to which the resource to which the task is assigned should be moved. The destination may be information indicating the work location. This is because, if the task is a worker task, the worker may either perform the work and then move to the destination, or the worker may perform the work at the destination. The assigned resource type indicates the type of resource to which the task is assigned. In this embodiment, the resource type is either the transport equipment 40 or a worker (person).

[0037] For example, task T1 is a task assigned to the transport device 40. When task T1 is assigned to the transport device 40, it moves to the shelf with shelf ID "shelf07". When the transport device 40 moves to the shelf, for example, whether the transport device 40 should move to the front of the shelf or to a location within a predetermined distance from the shelf may be set in advance by the user.

[0038] For example, Task T2 is a worker task assigned to a worker. The worker assigned Task T2 moves to the shelf with shelf ID "shelf07" and picks two items with item ID "item0001" stored on that shelf. The worker places the two picked items onto the transport device 40 that has been assigned Task T1 and has moved to the shelf. This completes Sub-Plan P1. Similarly, the shipment plan 12 is completed when multiple sub-plans that make up the shipment plan are completed. The transport device 40 may transport the items picked for each batch ID to the loading area. For example, the transport device 40 assigned Task T3 moves to the loading area. At this time, the transport device 40 may be carrying items picked by the execution of the sub-plan with batch ID "1" (for example, items with item IDs "item0001", "item0002", and "item0003"). This ensures that items are transported to the loading area according to their respective batch IDs.

[0039] Thus, in this embodiment, warehouse operations based on the shipping plan 12, etc., are carried out through the cooperation of the worker and the transport equipment 40. Therefore, the efficiency of warehouse operations may vary depending on which worker is assigned to which worker task.

[0040] [Processing Sequence] Next, with reference to Figure 4, the processing of the warehouse system 1 until the shipping plan is completed will be described. Figure 4 is a sequence diagram showing the warehouse work execution process of the warehouse system 1 according to Embodiment 1. Note that in Figure 4, the warehouse operation management system 20 and the task assignment system 22 or resource selection system 23 are depicted as separate systems. This is to clarify the respective functions of the task assignment system 22 and the resource selection system 23, and the task assignment system 22 and the resource selection system 23 may be included in the warehouse operation management system 20 as shown in Figure 1.

[0041] The warehouse management system 10 transmits the shipping plan 12 to the warehouse operation management system 20 (step S100). The warehouse operation management system 20 receives the shipping plan 12. The shipping plan 12 includes provisionally assigned tasks for workers and tasks for transport equipment.

[0042] The warehouse operation management system 20 requests the task assignment system 22 to allocate resources to the tasks included in the shipping plan 12 received in step S100 (step S101). Focusing on the workers, the warehouse operation management system 20 requests the task assignment system 22 to assign workers to worker tasks.

[0043] The task assignment system 22 requests the resource selection system 23 to assign a resource ID to a task (step S102). A resource ID is an ID used to identify a resource. In this embodiment, the transport equipment 40 is not distinguished. Therefore, the following explanation will focus on the worker. In step S102, the task assignment system 22 requests the resource selection system 23 to assign a worker ID to a worker task.

[0044] The resource selection system 23 assigns the worker tasks to workers using each of a plurality of algorithms (for example, algorithm A, algorithm B, algorithm C, and algorithm D). Then, the resource selection system 23 requests the simulation system 30 to execute a simulation of the warehouse operation when the worker tasks are assigned to workers using each of the plurality of algorithms (step S103).

[0045] The simulation system 30 executes a simulation of the warehouse operation when the worker tasks are assigned to workers according to each of the plurality of algorithms. Then, the simulation system 30 transmits each of the execution results of the simulation to the resource selection system 23 (step S104).

[0046] As a result, the resource selection system 23 can obtain the simulation results of the warehouse operation when the worker tasks are assigned using each of the plurality of algorithms. For example, it is assumed that the condition for selecting an algorithm is that the total working time of the warehouse is the shortest. Such a setting may be made in advance by the user, for example.

[0047] Based on each of the execution results of the simulation received in step S104, the resource selection system 23 selects one algorithm that satisfies a predetermined condition (for example, the total working time of the warehouse is the shortest) among the plurality of algorithms (step S105).

[0048] Based on the algorithm selected in step S105, the resource selection system 23 selects a worker to be assigned to the worker task requested in step S102. Then, the resource selection system 23 transmits the worker ID of the selected worker to the task assignment system 22 (step S106). As a result, the task assignment system 22 receives the worker ID of the worker to be assigned the worker task requested in step S101.

[0049] The task assignment system 22 assigns the worker tasks for which worker assignment was requested in step S101 to the worker associated with the worker ID received in step S106 (step S107). In the process of step S107, the task assignment system 22 sends the worker tasks to the worker terminal 50. The worker can check the worker tasks to be performed on the worker terminal 50. The worker then performs the worker tasks assigned to them.

[0050] When a worker completes the worker task assigned in step S107, they send a task completion notification to the warehouse operation management system 20 via the worker terminal 50 (step S108).

[0051] The process from step S101 to step S108 is repeated until all tasks included in the shipping plan 12 are completed.

[0052] When all tasks included in the shipping plan 12 are completed, the warehouse operation management system 20 sends a shipping plan completion notification to the warehouse management system 10 (step S109). Then, the warehouse system 1 terminates this processing sequence.

[0053] Although detailed explanations have been omitted as the focus has been on the workers, the transport equipment 40 also performs tasks based on the assigned transport equipment tasks. The transport equipment 40 also sends a task completion notification to the warehouse operation management system 20.

[0054] This embodiment makes it possible to further improve the efficiency of warehouse operations compared to, for example, selecting workers to assign tasks using only one pre-developed algorithm. This is because whether the algorithm used to select workers to assign tasks is appropriate from the standpoint of warehouse operation efficiency depends on the warehouse conditions, such as the arrangement of workers or transport equipment 40. Therefore, by selecting an algorithm based on the execution results of each simulation of warehouse operations when workers are selected and tasks are assigned using multiple algorithms, it becomes possible to select a more appropriate algorithm based on the conditions that the user considers important (for example, total working time in the warehouse).

[0055] (Embodiment 2) In Embodiment 1 described above, when assigning worker tasks to workers, an example was described in which multiple simulations were executed, and one algorithm was selected from multiple algorithms based on the results of each simulation. On the other hand, in Embodiment 2, an example is described in which, when assigning worker tasks to workers, the resource selection system 23A (see Figure 5) refers to a pre-created quick reference table 90 (see Figure 5) and selects one algorithm based on the quick reference table 90. In the description of the warehouse system 1A according to Embodiment 2, the same content as the description of the warehouse system 1 according to Embodiment 1 will be simplified or omitted, and the explanation will focus on the differences.

[0056] Figure 5 is a block diagram showing an example configuration of warehouse system 1A according to Embodiment 2. Warehouse system 1A has the same configuration as warehouse system 1. Note that warehouse system 1A includes warehouse operation management system 20A instead of warehouse operation management system 20. In warehouse operation management system 20A, various functions of resource selection system 23A are implemented instead of resource selection system 23. Resource selection system 23A uses algorithm A, algorithm B, algorithm C, and algorithm D, as well as a quick reference table 90. The quick reference table 90 may be stored and held in the memory 72 of warehouse operation management system 20A.

[0057] The quick reference table 90 is created based on the results of a simulation performed by the simulation system 30 and is incorporated into the resource selection system 23A. In other words, it is stored in the memory 72 of the warehouse operation management system 20A so that the resource selection system 23A can use it. The quick reference table 90 defines the selection criteria for selecting one algorithm from among several algorithms. In this embodiment, when the resource selection system 23A selects workers to assign to worker tasks, it selects one algorithm that satisfies the selection criteria based on the quick reference table 90. Then, the worker tasks are assigned to the workers selected based on the selected algorithm.

[0058] The quick reference table 90 is created as follows. First, the resource selection system 23A assigns worker tasks to workers using a specific algorithm. Then, the simulation system 30 runs simulations of warehouse operations under multiple conditions, assuming that worker tasks are assigned to workers according to the specific algorithm. In other words, the simulation system 30 runs the simulation multiple times while changing various parameters. Then, based on the results of multiple warehouse operation simulations, the simulation system 30 sets specific selection conditions for selecting the specific algorithm. Finally, the simulation system 30 registers the specific algorithm and the specific selection conditions together in the quick reference table 90. This creates the quick reference table 90.

[0059] Furthermore, when the simulation system 30 performs a simulation under multiple conditions, these multiple conditions may be set based on user operations. Also, when setting selection criteria based on multiple simulation results, the multiple simulation results may be analyzed in order to set the selection criteria. The analysis may also be performed based on the simulation results when a worker task is assigned to a worker according to each of the multiple algorithms. For example, an analysis may be performed to set selection criteria for selecting algorithm A or algorithm B based on both multiple simulation results obtained by using algorithm A and changing various parameters, and multiple simulation results obtained by using algorithm B and changing various parameters.

[0060] The analysis of the simulation results may be performed, for example, by the simulation system 30, by the user, or by an external device (not shown). The simulation system 30 may set selection criteria based on the results of the analysis of multiple simulation results. The simulation system 30 may also set selection criteria based on user operation. Furthermore, the registration of algorithms and selection criteria in the quick reference table 90 may be performed based on user operation.

[0061] Next, with reference to Figures 6, 7, and 8, examples of selection criteria set based on simulation results will be described. Figure 6 is a graph for comparing algorithms according to one embodiment of the present disclosure.

[0062] In the following explanation, Algorithm A is assumed to be an algorithm that assigns worker tasks to workers who are not currently working and who are closer to their destination, prioritizing their assignment. In other words, Algorithm A is an algorithm that selects workers who are not currently working and who are closer to their destination as the recipients of worker tasks.

[0063] Furthermore, in the following explanation, Algorithm B is assumed to be an algorithm that prioritizes assigning worker tasks to workers who are closer to their destination, regardless of whether they are currently working or not. In other words, Algorithm B is an algorithm that prioritizes selecting workers who are closer to their destination as recipients of worker tasks.

[0064] Furthermore, to simplify the explanation, the phrase "simulation of warehouse operations when worker tasks are assigned to workers using a specific algorithm" is sometimes abbreviated as "simulation using a specific algorithm."

[0065] The vertical axis of the graph shown in Figure 6 represents the difference between the total work time included in the simulation results when using algorithm A (hereinafter referred to as "first total work time") and the total work time included in the simulation results when using algorithm B (hereinafter referred to as "second total work time"). This difference is obtained by subtracting the second total work time from the first total work time.

[0066] The horizontal axis of the graph shown in Figure 6 represents the ratio of the number of workers in the warehouse to the number of conveying devices 40 in the warehouse. This ratio is obtained by dividing the number of conveying devices 40 by the number of workers.

[0067] Figure 6 shows the difference between the first and second total working times when simulations are performed using algorithm A and algorithm B, while varying the number of workers and the number of transport equipment 40 as simulation conditions (parameters) (in other words, varying the ratio of the number of workers to the number of transport equipment 40). In short, Figure 6 shows whether the total working time in the warehouse is shorter (or longer) when algorithm A or algorithm B is used, given a specific ratio of the number of workers to the number of transport equipment 40.

[0068] From the graph in Figure 6, it can be seen that when the ratio of the number of workers to the number of conveying devices 40 is less than 1.55, the first total work time is shorter than the second total work time. Also, from the graph in Figure 6, it can be seen that when the ratio of the number of workers to the number of conveying devices 40 is 1.55 or more, the second total work time is shorter than the first total work time. Therefore, when the total work time in the warehouse is set as the evaluation target for the user, that is, when a shorter total work time in the warehouse is preferred, it is preferable to select either algorithm A or algorithm B as follows: Specifically, when the ratio of the number of workers to the number of conveying devices 40 is less than 1.55, it is preferable to select algorithm A. Also, when the ratio of the number of workers to the number of conveying devices 40 is 1.55 or more, it is preferable to select algorithm B.

[0069] Figure 7 is a graph for comparing algorithms according to one embodiment of the present disclosure. The vertical axis of the graph in Figure 7 shows the difference between the total distance traveled by the worker included in the simulation results when using algorithm A (hereinafter referred to as "first total travel distance") and the total distance traveled by the worker included in the simulation results when using algorithm B (hereinafter referred to as "second total travel distance"). This difference is obtained by subtracting the second total travel distance from the first total travel distance.

[0070] The horizontal axis of the graph shown in Figure 7, like the horizontal axis of the graph shown in Figure 6, represents the ratio of the number of workers in the warehouse to the number of conveying devices 40 in the warehouse. This ratio is obtained by dividing the number of conveying devices 40 by the number of workers.

[0071] Figure 7 shows the difference between the first and second total travel distances when simulations are performed using algorithm A and algorithm B, while varying the number of workers and the number of transport devices 40 as simulation conditions (parameters) (in other words, varying the ratio of the number of workers to the number of transport devices 40). In short, Figure 7 shows whether the total travel distance of workers in the warehouse is shorter (or longer) when algorithm A or algorithm B is used, given a specific ratio of the number of workers to the number of transport devices 40.

[0072] From the graph in Figure 7, it can be seen that when the ratio of the number of workers to the number of transport devices 40 is less than 1.33, the first total travel distance is shorter than the second total travel distance. Also, from the graph in Figure 7, it can be seen that when the ratio of the number of workers to the number of transport devices 40 is 1.33 or more, the second total travel distance is shorter than the first total travel distance. Therefore, if the total travel distance of workers in the warehouse is set as the evaluation target for the user, that is, if a shorter total travel distance of workers in the warehouse is preferred, it is preferable to select either algorithm A or algorithm B as follows: Specifically, when the ratio of the number of workers to the number of transport devices 40 is less than 1.33, it is preferable to select algorithm A. Also, when the ratio of the number of workers to the number of transport devices 40 is 1.33 or more, it is preferable to select algorithm B.

[0073] As a concrete example, consider a simulation performed under the following conditions: a total of 16,958 picks, 30 workers, and 40 transport devices. First, the simulation results using algorithm A show a first total work time of 4 hours, 16 minutes, and 49 seconds, a first total travel distance of 179,772 m, and an average travel distance of 10.6 m per pick. Next, the simulation results using algorithm B show a second total work time of 4 hours, 37 minutes, and 24 seconds, a second total travel distance of 173,716 m, and an average travel distance of 10.24 m per pick. Note that these figures are just examples. Simulation conditions are not limited to the total number of picks, the number of workers, and the number of transport devices; for example, the performance of transport device 40 may also be included. The figures shown as simulation results may vary depending on various simulation conditions (parameters).

[0074] In this case, the ratio of the number of workers to the number of transport devices is 1.33. Therefore, when the total working time is set as the user's evaluation target, it is preferable to select algorithm A. In fact, the first total working time of 4 hours, 16 minutes, and 49 seconds is shorter than the second total working time of 4 hours, 37 minutes, and 24 seconds. On the other hand, when the total distance traveled is set as the user's evaluation target, it is preferable to select algorithm B. In fact, the second total distance traveled of 173,716 m is shorter than the first total distance traveled of 179,772 m.

[0075] As another concrete example, consider a scenario where a simulation is performed under the following conditions: a total of 38,109 picks, 60 workers, and 100 transport devices. First, the simulation results using algorithm A show a first total work time of 5 hours, 25 minutes, and 47 seconds, a first total travel distance of 1,178,719 m, and an average travel distance per pick of 30.93 m. Next, the simulation results using algorithm B show a second total work time of 3 hours, 56 minutes, and 57 seconds, a second total travel distance of 308,397 m, and an average travel distance per pick of 8.09 m.

[0076] In this case, the ratio of the number of workers to the number of transport devices is 1.66. Therefore, when total work time is set as the user's evaluation target, it is preferable to select algorithm B. In fact, the second total work time of 3 hours 56 minutes 57 seconds is shorter than the first total work time of 5 hours 25 minutes 47 seconds. Also, when total travel distance is set as the user's evaluation target, it is preferable to select algorithm B. In fact, the second total travel distance of 308,397 m is shorter than the first total travel distance of 1,178,719 m.

[0077] As explained with reference to Figures 6 and 7, an analysis may be performed based on the simulation results under multiple conditions to determine which algorithm should be selected in which case. Next, with reference to Figure 8, an example of a quick reference table 90 in which algorithms are registered together with selection conditions based on the results of the simulation analysis is shown.

[0078] Figure 8 is a table diagram showing an example of the quick reference table 90 according to Embodiment 2.

[0079] The quick reference table 90 registers, for example, a selection criterion such as "total working time is emphasized, and the ratio of the number of transport devices to the number of workers is less than 1.55" and algorithm A together. The emphasis on total working time means that the total working time in the warehouse is the user's evaluation target, and a shorter total working time is preferable. Such evaluation targets may be set in advance by the user. Hereinafter, this selection criterion will be referred to as the first selection criterion, and algorithm A will be referred to as the first algorithm. Also, the value 1.55 is just an example and may be interpreted as the first threshold. The resource selection system 23A may determine that the first selection criterion is met if the total working time is set as the user's evaluation target, and the ratio of the number of workers to the number of transport devices 40 is less than a predetermined first threshold.

[0080] Furthermore, the quick reference table 90 registers, for example, a selection criterion such as "total working time is emphasized, and the ratio of the number of transport devices to the number of workers is 1.55 or more," along with algorithm B. Hereinafter, this selection criterion may be referred to as the second selection criterion, and algorithm B may be referred to as the second algorithm. The resource selection system 23A may determine that the first selection criterion is met if the total working time is set as the user's evaluation target, and the ratio of the number of workers to the number of transport devices 40 is equal to or greater than a predetermined first threshold.

[0081] The quick reference table 90 registers, for example, a selection criterion such as "total travel distance is emphasized, and the ratio of the number of transport devices to the number of workers is less than 1.33" along with algorithm A. The emphasis on total travel distance means that the total travel distance of workers in the warehouse is the user's evaluation target, and a shorter total travel distance is preferable. Such user evaluation targets may be pre-configured by the user. Hereinafter, this selection criterion may be referred to as the third selection criterion. The value 1.33 is merely an example and may be interpreted as the second threshold. The resource selection system 23A may determine that the third selection criterion is met if the total travel distance is set as the user's evaluation target, and the ratio of the number of workers to the number of transport devices 40 is less than the predetermined second threshold.

[0082] The quick reference table 90 registers, for example, the selection criteria "total travel distance is emphasized, and the ratio of the number of transport devices to the number of workers is 1.33 or more" along with algorithm B. The emphasis on total travel distance means that the total travel distance of workers in the warehouse is the user's evaluation target, and a shorter total travel distance is preferable. Such user evaluation targets may be pre-configured by the user. Hereinafter, this selection criterion may be referred to as the fourth selection criterion. The resource selection system 23A may determine that the fourth selection criterion is met if the total travel distance is set as the user's evaluation target, and the ratio of the number of workers to the number of transport devices 40 is equal to or greater than a predetermined second threshold.

[0083] Here, the selection criteria and algorithms A and B, which were specifically explained with reference to Figures 6 and 7, are shown. However, the quick reference table 90 is not limited to these, and further pairs of selection criteria and algorithms may be registered.

[0084] Next, with reference to Figure 9, the processing of the warehouse system 1A until the shipping plan is completed will be explained. Figure 9 is a sequence diagram showing the warehouse work execution process of the warehouse system 1A according to Embodiment 2. Note that in the explanation of the sequence diagram shown in Figure 9, parts that overlap with the explanation of the sequence diagram shown in Figure 4 may be omitted or simplified.

[0085] The simulation system 30 performs simulations using each of the multiple algorithms under multiple conditions. Then, the simulation system 30 analyzes the algorithm selection criteria based on the simulation results (step S200). Furthermore, the simulation system 30 creates a quick reference table 90 based on the analysis results in step S200 and incorporates it into the resource selection system 23A (step S201).

[0086] The processes in steps S200 and S201 may be performed based on the user's operation of the simulation system 30 or an external device (not shown).

[0087] Furthermore, the processing in steps S200 and S201 may be performed separately from the series of processing steps S100A and onward. In other words, the processing in steps S200 and S201 may be performed separately from the sequence shown in Figure 9.

[0088] The warehouse management system 10 transmits the shipping plan 12 to the warehouse operation management system 20A (step S100A). The warehouse operation management system 20A receives the shipping plan 12. The shipping plan 12 includes tasks for workers and tasks for transport equipment.

[0089] The warehouse operation management system 20A requests the task assignment system 22 to allocate resources (workers) to tasks (worker tasks) included in the shipping plan 12 received in step S100A (step S101A). Focusing on the workers, the warehouse operation management system 20A requests the task assignment system 22 to allocate workers to the worker tasks. In this embodiment, as in Embodiment 1, the transport equipment 40 is not distinguished. Therefore, the following explanation will focus on the workers.

[0090] The task assignment system 22 requests the resource selection system 23 to assign worker IDs to worker tasks (step S102A).

[0091] The resource selection system 23A refers to the quick reference table 90 and requests the warehouse operation management system 20A for the determination information necessary to determine the various selection conditions registered in the quick reference table (step S202). For example, if the first selection condition, second selection condition, third selection condition, and fourth selection condition are registered in the quick reference table 90, the determination information necessary to determine these selection conditions is the number of workers in the warehouse and the number of transport equipment 40 in the warehouse. Therefore, in this case, the resource selection system 23A requests the warehouse operation management system 20A for the information on the number of workers in the warehouse and the number of transport equipment 40 in the warehouse. This information may be included in resource information 21, for example. The warehouse operation management system 20A can transmit the information on the number of workers in the warehouse and the number of transport equipment 40 in the warehouse, which is included in resource information 21, to the resource selection system 23A. Note that the determination information is not limited to the information on the number of workers in the warehouse and the number of transport equipment 40 in the warehouse. The resource selection system 23A may obtain necessary decision-making information from the warehouse operation management system 20A, depending on the content of the selection criteria. In addition, if the resource selection system 23A is unable to obtain the necessary decision-making information from the warehouse operation management system 20A, it may notify the user to request the input of the decision-making information.

[0092] The warehouse operation management system 20A transmits the decision information requested by the resource selection system 23A in step S202 to the resource selection system 23A (step S203). This allows the resource selection system 23A to obtain the decision information necessary to determine the selection conditions.

[0093] The resource selection system 23A selects one algorithm that satisfies the selection criteria based on the quick reference table 90 and the judgment information obtained in step S203 (step S204).

[0094] The resource selection system 23A selects workers to be assigned to the worker tasks requested in step S102A, based on the algorithm selected in step S204. The resource selection system 23A then transmits the worker IDs of the selected workers to the task assignment system 22 (step S106A). As a result, the task assignment system 22 receives the worker IDs of the workers to whom the worker assignment tasks requested in step S101A are assigned.

[0095] The task assignment system 22 assigns the worker task for which worker assignment was requested in step S101A to the worker associated with the worker ID received in step S106A (step S107A). In the process of step S107A, the task assignment system 22 sends the worker task to the worker terminal 50. The worker can check the worker task to be performed on the worker terminal 50. The worker then performs the worker task assigned to them.

[0096] When a worker completes the worker task assigned in step S107A, they send a task completion notification to the warehouse operation management system 20 via the worker terminal 50 (step S108A).

[0097] The process from step S101A to step S108A is repeated until all tasks included in the shipping plan 12 are completed.

[0098] When all tasks included in the shipping plan 12 are completed, the warehouse operation management system 20A sends a shipping plan completion notification to the warehouse management system 10 (step S109A). Then, the warehouse system 1A terminates this processing sequence.

[0099] Although detailed explanations have been omitted as the focus has been on the workers, the transport equipment 40 also performs tasks based on the assigned transport equipment tasks. The transport equipment 40 also sends a task completion notification to the warehouse operation management system 20A.

[0100] This embodiment allows for the creation of a quick reference table for algorithm selection by running a simulation before commencing warehouse operations based on, for example, a shipping plan 12. This enables the appropriate selection of an algorithm to assign tasks to workers based on the quick reference table when commencing warehouse operations. For example, based on the quick reference table, it is possible to easily select an algorithm that reduces the total time spent on warehouse operations or an algorithm that reduces the total distance workers travel, without the need for simulation. This improves the efficiency of warehouse operations.

[0101] (Modifications of the Embodiments) In each of Embodiments 1 and 2 described above, examples were shown in which warehouse operations are performed based on the shipping plan 12. However, warehouse operations are not limited to operations based on the shipping plan 12; for example, warehouse operations may be performed based on the receiving plan.

[0102] In each of the above embodiments 1 and 2, an example was shown in which one algorithm is selected. However, in embodiment 1, for example, the system is set to select the algorithm that results in the shortest total work time as shown in the simulation results, and there may be multiple algorithms that result in the same total work time. Similarly, in embodiment 2, for example, there may be multiple algorithms that satisfy the selection criteria. In such cases where no single algorithm is selected, multiple algorithms may be presented to the user via an output device (e.g., output device 74). Furthermore, a priority may be assigned to each of the multiple algorithms in case no single algorithm is selected. For example, in embodiment 1, the system is set to select the algorithm that results in the shortest total work time as shown in the simulation results, and the total work time is the same when algorithm A and algorithm B are used, then one of the algorithms may be selected based on the priority assigned to algorithm A and algorithm B, respectively.

[0103] (Summary of Embodiments) The following technologies are disclosed based on the above description of embodiments. The components etc. in the above embodiments are examples, but are not limited to these.

[0104] (Technology 1) The algorithm selection method is an algorithm selection method for selecting one of several algorithms (e.g., algorithm A, algorithm B, algorithm C, algorithm D) for assigning at least one of several tasks (e.g., task T1, task T2, task T3) that constitute the work performed by workers and conveying equipment (e.g., conveying equipment 40) based on the warehouse work plan (e.g., shipping plan 12) as a worker task (e.g., task T2) to be performed by warehouse workers, wherein the algorithm selected satisfies predetermined conditions from among the multiple algorithms based on the results of running a simulation of the work when worker tasks are assigned to workers using each of the multiple algorithms.

[0105] This allows for algorithm selection based on simulation results, enabling the selection of an algorithm from multiple options. Therefore, compared to assigning tasks to workers using algorithms pre-developed by users, for example, it becomes possible to assign tasks using algorithms appropriate to the warehouse conditions, such as the workers' positions or the arrangement of transport equipment. This leads to improved efficiency in warehouse operations, for example, in terms of time or the distance workers travel.

[0106] (Technology 2) The algorithm selection method described in Technology 1 may involve referring to a quick reference table (for example, Quick Reference Table 90) that defines selection criteria for selecting an algorithm from among multiple algorithms created based on the results of the simulation, and selecting an algorithm that satisfies the selection criteria based on the quick reference table.

[0107] This allows for algorithm selection using a quick reference table created in advance through simulations. This enables algorithm selection by referring to the quick reference table without having to run simulations when assigning tasks to workers. This makes algorithm selection easier and less resource-intensive compared to selecting algorithms by running simulations.

[0108] (Technology 3) The algorithm selection method described in Technology 2 involves performing simulations of the work under multiple conditions when a worker is assigned a worker task using a specific algorithm, setting specific selection conditions for selecting a specific algorithm based on the results of multiple simulations of the work, and registering the specific algorithm and the specific selection conditions together in a quick reference table.

[0109] This allows the algorithm selection method to analyze multiple simulation results by running simulations under multiple conditions. Based on the analysis results, the algorithm selection method can then set selection criteria for selecting an algorithm.

[0110] (Technology 4) The algorithm selection method described in Technology 2 or 3 may obtain determination information based on a quick reference table to determine whether or not the selection criteria are met, and then select an algorithm that satisfies the selection criteria based on the determination information.

[0111] This allows the algorithm selection method to obtain information for determining whether or not the selection criteria are met. Based on this information, the algorithm selection method can then select an algorithm that satisfies the selection criteria.

[0112] (Technical 5) In the algorithm selection method described in Technical 4, the information for determination includes the number of workers in the warehouse and the number of conveying devices in the warehouse, the selection conditions include a condition regarding the ratio of the number of workers to the number of conveying devices, and the algorithm selection method may select an algorithm that satisfies the condition regarding the ratio of the number of workers to the number of conveying devices.

[0113] This allows the algorithm selection method to select an algorithm that satisfies the selection criteria regarding the ratio of the number of workers to the number of conveying devices. Furthermore, the algorithm selection method can obtain information on both the number of workers and the number of conveying devices in the warehouse.

[0114] (Technical 6) In the algorithm selection method described in Technical 5, the multiple algorithms may include a first algorithm (e.g., Algorithm A) that assigns worker tasks to workers who are not currently working and are closer to their work location, based on information about the workers' work locations included in the worker tasks, and a second algorithm (e.g., Algorithm B) that assigns worker tasks to workers who are closer to their work location, prioritizing their location.

[0115] This allows the algorithm selection method to choose either a first algorithm that prioritizes assigning worker tasks to workers who are not currently working and are closer to the work area, or a second algorithm that prioritizes assigning worker tasks to workers who are closer to the work area.

[0116] (Technical 7) In the algorithm selection method described in Technical 6, the selection conditions include a first selection condition for selecting a first algorithm and a second selection condition for selecting a second algorithm, and the algorithm selection method may determine that the first selection condition is met if the total work time is set as the user's evaluation target and the ratio of the number of workers to the number of transport equipment is less than a predetermined first threshold, and that the second selection condition is met if the total work time is set as the evaluation target and the ratio of the number of workers to the number of transport equipment is equal to or greater than a predetermined first threshold.

[0117] As a result, the algorithm selection method can determine that the first selection condition is met if the total work time is set as the evaluation target for the user, and the ratio of the number of workers to the number of transport devices is less than a predetermined first threshold. As a result, the algorithm selection method can select the first algorithm. Furthermore, the algorithm selection method can determine that the second selection condition is met if the total work time is set as the evaluation target, and the ratio of the number of workers to the number of transport devices is equal to or greater than a predetermined first threshold. As a result, the algorithm selection method can select the second algorithm.

[0118] (Technical 8) In the algorithm selection method described in Technical 6 or 7, the selection conditions include a third selection condition for selecting a first algorithm and a fourth selection condition for selecting a second algorithm, and the algorithm selection method may determine that the third selection condition is met if the total distance traveled by workers in the warehouse is set as the user's evaluation target and the ratio of the number of workers to the number of transport equipment is less than a predetermined second threshold, and that the fourth selection condition is met if the total distance traveled is set as the evaluation target and the ratio of the number of workers to the number of transport equipment is equal to or greater than a predetermined second threshold.

[0119] As a result, the algorithm selection method can determine that the third selection condition is met if the total distance traveled by workers in the warehouse is set as the evaluation target for the user, and the ratio of the number of workers to the number of transport equipment is less than a predetermined second threshold. As a result, the algorithm selection method can select the first algorithm. Furthermore, the algorithm selection method can determine that the fourth selection condition is met if the total distance traveled is set as the evaluation target, and the ratio of the number of workers to the number of transport equipment is equal to or greater than a predetermined second threshold. As a result, the algorithm selection method can select the second algorithm.

[0120] (Technology 9) The algorithm selection method described in any one of Techniques 1 to 8 may assign at least one of the multiple tasks constituting the work to the conveying equipment as a task for the conveying equipment to be performed by the conveying equipment.

[0121] This allows the algorithm selection method to assign tasks for conveying equipment to the conveying equipment itself.

[0122] (Technology 10) The algorithm selection method described in any one of Techniques 1 to 9 may use the selected algorithm to assign worker tasks to workers.

[0123] This allows the algorithm selection method to assign worker tasks to workers using the selected algorithm.

[0124] (Technical 11) A program that causes a computer to select one of several algorithms for assigning at least one of several tasks that constitute the work performed by workers and transport equipment based on a warehouse work plan as a worker task to be performed by warehouse workers causes the computer to select an algorithm that satisfies predetermined conditions from among the multiple algorithms based on the results of running a simulation of the work when a worker task is assigned to a worker using each of the multiple algorithms.

[0125] This allows the program to achieve the same effect as Technique 1.

[0126] The functions of the various embodiments described above can also be realized by supplying programs and applications for realizing the functions of the various embodiments described above to a system or device using a network or storage medium, and by having one or more processors in the computer of that system or device read and execute the programs.

[0127] Furthermore, the functions of the various embodiments described above may be realized by circuits that implement one or more functions (for example, an Application Specific Integrated Circuit (hereinafter referred to as "ASIC") or an FPGA).

[0128] Although various embodiments have been described above with reference to the attached drawings, this disclosure is not limited to such examples. It will be obvious to those skilled in the art that various modifications, alterations, substitutions, additions, deletions, and equivalents can be conceived within the scope of the claims, and these will also be understood to fall within the technical scope of this disclosure. Furthermore, the components of the various embodiments described above can be arbitrarily combined without departing from the spirit of the invention.

[0129] This application is based on a Japanese patent application (Patent Application No. 2025-007751) filed on January 20, 2025, the contents of which are incorporated herein by reference.

[0130] The technology disclosed herein is useful as an algorithm selection method and program.

[0131] 1, 1A Warehouse System 10 Warehouse Management System 11 Inventory Information 12 Shipping Plan 20, 20A Warehouse Operation Management System 21 Resource Information 22 Task Assignment System 23, 23A Resource Selection System 30 Simulation System 40 Conveying Equipment 50 Worker Terminal 70 Information Processing Device 71 Processor 72 Memory 73 Input Device 74 Output Device 75 Communication Device 76 External Interface Device 77 Internal Interface Device 90 Quick Reference Table A, B, C, D Algorithm P1 Subplan T1, T2, T3 Task

Claims

1. An algorithm selection method for selecting one of a plurality of algorithms for assigning at least one of a plurality of tasks that constitute work performed by workers and conveying equipment based on a warehouse work plan as a worker task to be performed by a warehouse worker, the method comprising: selecting an algorithm from the plurality of algorithms that satisfies predetermined conditions based on the results of running a simulation of the work when the worker task is assigned to the worker using each of the plurality of algorithms.

2. The algorithm selection method according to claim 1, comprising referring to a quick reference table that defines selection criteria for selecting an algorithm from among the plurality of algorithms, which is created based on the results of the simulation, and selecting an algorithm that satisfies the selection criteria based on the quick reference table.

3. The algorithm selection method according to claim 2, comprising: performing a simulation of the work under multiple conditions when the worker task is assigned to the worker using a specific algorithm; setting specific selection conditions for selecting the specific algorithm based on the multiple execution results of the work simulation; and registering the specific algorithm and the specific selection conditions together in the quick reference table.

4. The algorithm selection method according to claim 2, comprising: obtaining determination information for determining whether or not the selection conditions are met based on the quick reference table; and selecting an algorithm that satisfies the selection conditions based on the determination information.

5. The algorithm selection method according to claim 4, wherein the determination information includes the number of workers in the warehouse and the number of conveying devices in the warehouse, the selection criteria include a condition regarding the ratio of the number of workers to the number of conveying devices, and an algorithm that satisfies the condition regarding the ratio of the number of workers to the number of conveying devices is selected.

6. The algorithm selection method according to claim 5, wherein the plurality of algorithms include a first algorithm that assigns the worker task to a worker who is not currently working and is closer to the work location, based on information about the worker's work location included in the worker task, and a second algorithm that assigns the worker task to a worker who is closer to the work location, prioritizing that worker.

7. The algorithm selection method according to claim 6, wherein the selection conditions include a first selection condition for selecting the first algorithm and a second selection condition for selecting the second algorithm, and the method determines that the first selection condition is met if the total working time of the work is set as the user's evaluation target and the ratio of the number of workers to the number of transport devices is less than a predetermined first threshold, and the method determines that the second selection condition is met if the total working time is set as the evaluation target and the ratio of the number of workers to the number of transport devices is equal to or greater than the predetermined first threshold.

8. The algorithm selection method according to claim 6, wherein the selection conditions include a third selection condition for selecting the first algorithm and a fourth selection condition for selecting the second algorithm, and the method determines that the third selection condition is met if the total distance traveled by the workers in the warehouse is set as the user's evaluation target and the ratio of the number of workers to the number of transport equipment is less than a predetermined second threshold, and the method determines that the fourth selection condition is met if the total distance traveled is set as the evaluation target and the ratio of the number of workers to the number of transport equipment is equal to or greater than the predetermined second threshold.

9. The algorithm selection method according to claim 1, wherein at least one of the multiple tasks constituting the above operation is assigned to the conveying equipment as a task for the conveying equipment to be performed by the conveying equipment.

10. The algorithm selection method according to claim 1, wherein the selected algorithm is used to assign the worker task to the worker.

11. A program for causing a computer to select one of a plurality of algorithms for assigning at least one of a plurality of tasks that constitute work performed by workers and transport equipment based on a warehouse work plan as a worker task to be performed by a warehouse worker, the program for causing the computer to select an algorithm from the plurality of algorithms that satisfies predetermined conditions based on the results of running a simulation of the work when the worker task is assigned to the worker using each of the plurality of algorithms.

Images