Inventory placement optimization system and inventory placement optimization method
The inventory layout optimization system uses quantum annealing to optimize product placement in distribution warehouses, addressing inefficiencies in replenishment by maximizing storage capacity and reducing restocking frequency, thereby enhancing operational efficiency.
Patent Information
- Application Number
- JP2022121462
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2022-07-29
- Publication Date
- 2024-11-27
- Estimated Expiration
- 2042-07-29
AI Technical Summary
Conventional inventory placement methods in distribution warehouses lead to inefficient replenishment of products in the picking area, resulting in unbalanced inventory levels and frequent restocking due to inaccurate determination of replenishment limits, which are not adapted to the varying shapes and sizes of products and shelf configurations.
An inventory layout optimization system and method that utilizes a mathematical optimization solver, such as quantum annealing, to determine the optimal placement of products on shelves based on their size, shape, and required inventory, minimizing the number of replenishments by maximizing storage capacity while adhering to constraints like shelf dimensions and product shapes.
This approach reduces the frequency of product restocking in the picking area, enhances operational efficiency, and ensures balanced inventory levels by optimizing product placement, thus improving overall warehouse operations.
Smart Images

Figure 0007591008000011 
Figure 0007591008000012 
Figure 0007591008000013
Abstract
Description
[Technical field]
[0001] The present invention relates to an inventory placement optimization system and an inventory placement optimization method. [Background technology]
[0002] The concept of combinatorial optimization problems, which involves searching for a solution that maximizes or minimizes desired parameters under specified conditions, can also be applied to complex real-world problems, such as optimizing the allocation of resources such as workers and equipment, optimizing operation schedules, eliminating traffic congestion, and reducing logistics costs in global supply chains.
[0003] On the other hand, in such problems, the number of solution candidates becomes explosively large, making it difficult to solve the problem within a practical time unless one uses a computer with a suitable computing power, such as a supercomputer or quantum computer.
[0004] For example, a conventional technology related to quantum computers is a computer that enables high-speed calculations for inverse problems or combinatorial optimization problems that require an exhaustive search. The technology (see Patent Document 1) proposes a computer that uses spin as a variable in the calculation, sets the problem to be solved in terms of spin-spin interactions and local fields acting on each spin, orients all spins in one direction at time t=0 using an external magnetic field, gradually reduces the external magnetic field so that it becomes zero at time t=τ, and evolves over time assuming that the orientation of each spin is determined according to the effective magnetic field determined by the combined effects of the external magnetic field and spin-spin interactions at each site at time t, and in this process, the spin orientation is not completely aligned with the effective magnetic field, but is instead quantum mechanically corrected, thereby allowing the system to maintain approximately the ground state.
[0005] Among optimization problems, conventional techniques related to optimizing the placement of inventory and the like in logistics warehouses have been proposed, including a product placement system, a product placement method, and a product placement program (see Patent Document 2) that improve the efficiency of the process from the arrival to the shipment of goods at logistics sites.
[0006] This technology relates to a product placement system having a grouping means that acquires a plurality of feature amounts for each of a plurality of products from shipping data relating to the plurality of products, compares each of the feature amounts acquired for a certain product with each of the feature amounts acquired for other products with respect to the corresponding feature amounts, calculates the amount of change between the corresponding feature amounts, and classifies the plurality of products into a plurality of product groups based on the magnitude of the calculated amount of change, a shipping prediction means that acquires past shipping records for each of the products from the shipping data and predicts the shipping quantities of the plurality of products based on the acquired shipping records, and a placement location determination means that determines the placement locations of each of the classified product groups and the placement locations of the plurality of products based on the shipping prediction by the shipping prediction means.
[0007] Similarly to the above, a system and method for optimizing product placement in a logistics warehouse or the like has also been proposed as a conventional technique for optimizing product placement (see Patent Document 3) that reduces the frequency of replenishing and replacing products.
[0008] This technology involves a system that calculates a recommended capacity value for a product placed in a front space based on a predicted shipping volume as a result of a demand forecast for a specified future period for the product placed in the front space for each of a plurality of front spaces that a plurality of shelves have and in which a plurality of products are placed. The system determines one or more replacement pairs, which are front space pairs in which product replacement occurs, based on the current capacity value and the recommended capacity value of each of the plurality of front spaces. For each entrance space, the current capacity value is a value that indicates the capacity of the entrance space. For each entrance space, the recommended capacity value is a value that indicates the entrance space capacity that is predicted to be required for the product arranged in the entrance space in a unit period in a specified period. Each of the one or more replacement pairs described above satisfies the following conditions. (a) The current capacity value of the first entrance space, which is one of the entrance spaces constituting the replacement pair, is smaller than the recommended capacity value of the first entrance space, or the current capacity value of the second entrance space, which is the other entrance space constituting the replacement pair, is larger than the recommended capacity value of the second entrance space. (b) The recommended capacity value of the second entrance space meets the current capacity value of the first entrance space. (c) The recommended capacity value of the first entrance space meets the current capacity value of the second entrance space. [Prior art documents] [Patent documents]
[0009] [Patent Document 1] WO2016 / 157333 [Patent Document 2] Republished 2019-97694 [Patent Document 3] JP 2021-120891 A Summary of the Invention [Problem to be solved by the invention]
[0010] In a logistics warehouse in the supply chain, products ordered by customers are picked from the picking area as part of daily operations and shipped. Meanwhile, as these picking operations are carried out one after another, the amount of inventory in the picking area decreases.
[0011] As a result, if the inventory level in the picking area falls below the standard and there is a shortage, the product in question will be transported from the storage area to the picking area and replenished up to the replenishment limit (the maximum inventory level in the picking area, manually defined according to the scale of shipment).
[0012] However, there are many cases where the replenishment limit determined based on the number of shipments is not enough to accommodate all the products on the shelves in the actual picking area. The storage area of the shelves in the picking area is, of course, finite, and the shape (e.g., the aspect ratio of the shelf boards and the position of the partitions) and external environment (e.g., the presence of a pillar close to the rear) may vary. Similarly, the shapes and sizes of the products stored on such shelves vary depending on the type of product.
[0013] Therefore, the number of products that can be stored on a shelf cannot be calculated by simply dividing the shelf's capacity by the volume of the products to be stored. In such a case, it is possible that the shape of the product may not be able to be stored on the shelf and therefore cannot be placed in the picking area (see Figure 1).
[0014] Furthermore, the accuracy of the replenishment limits mentioned above is not good, and there is a problem that the balance between actual shipments and inventory is easily imbalanced. As a result, there are situations where there are products with a large shipment volume but a small inventory in the picking area, and products with a small shipment volume but a large inventory in the picking area (see Figure 2).
[0015] As a result, the replenishment of goods from the storage area to the picking area occurred more frequently than necessary, while at the same time, even when the goods were brought to the picking area, they could not be stored on the shelves, which could have significantly reduced the operational efficiency of the logistics warehouse as a whole.
[0016] Therefore, an object of the present invention is to provide a technique that minimizes the number of times products are replenished in a picking area in a logistics warehouse, thereby making the relevant work more efficient. [Means for solving the problem]
[0017] The inventory placement optimization system of the present invention that solves the above-mentioned problems has a memory unit that stores information on constraint conditions, such as the position and size of each storage shelf of the product, the size of each product stored in the storage shelf and a replenishment point which is the minimum inventory required, the collection form in which the same type of product is accumulated in a row on the storage shelf, the arrangement interval between collections of the products accumulated in a row, and the height of the collection on the storage shelf and the arrangement length in the width and depth directions; and a calculation unit that calculates each value of the decision variables that maximize the storage number, which is the objective function, using a mathematical optimization solver under the constraint conditions, with the number of the products stored on the storage shelf being an objective function, and the storage shelf where the collection is to be stored and the arrangement position on the storage shelf, the number of stacked layers of the products that make up the collection and the arrangement number in the width and depth directions being decision variables, and the calculation unit outputs each value of the decision variables based on the results of the calculation to a specified device.
[0018] Furthermore, the inventory allocation optimization method of the present invention is characterized in that an information processing system stores in a memory unit information on constraint conditions, such as the position and size of each storage shelf of the product, the size of each product stored in the storage shelf and a replenishment point which is the minimum inventory required, the collection form in which the same type of product is accumulated in a row on the storage shelf, the arrangement interval between collections of the products accumulated in a row, and the height of the collection on the storage shelf and the arrangement length in the width and depth directions, sets the number of the products stored on the storage shelf as an objective function, and the storage shelf where the collection is to be stored and the arrangement position on the storage shelf, the number of stacked layers of the products that make up the collection and the arrangement number in the width and depth directions as decision variables, calculates each value of the decision variables that maximizes the storage number, which is the objective function, under the constraint conditions, using a mathematical optimization solver, and outputs each value of the decision variables based on the results of the calculation to a specified device. Effect of the Invention
[0019] According to the present invention, it is possible to minimize the number of times products are replenished to a picking area in a logistics warehouse, thereby making the relevant operations more efficient. [Brief description of the drawings]
[0020] [Figure 1] FIG. 1 is a diagram showing an example of shelf volume and actual product arrangement in a conventional manner. [Diagram 2] 1 is a graph showing a conventional relationship between shipping volume and inventory volume. [Diagram 3] FIG. 1 is a diagram illustrating a network configuration including an inventory placement optimization system according to an embodiment of the present invention. [Figure 4] FIG. 2 is a diagram illustrating an example of a hardware configuration of the inventory placement optimization system according to the present embodiment. [Diagram 5] FIG. 4 is a diagram illustrating an example of a timing chart according to the present embodiment. [Figure 6] FIG. 4 is a diagram illustrating an example of a flow according to the present embodiment. [Figure 7A] 10 is a diagram showing an example of storage shelf information stored in an information DB according to the embodiment. FIG. [Figure 7B] 4 is a diagram showing an example of product information stored in an information DB of the present embodiment. FIG. [Figure 7C] 10 is a diagram showing an example of passage information stored in an information DB according to the embodiment; FIG. [Figure 7D] 4 is a diagram showing an example of weight / capacity limit information held in an information DB according to the present embodiment. FIG. [Figure 8A] 11 is a diagram showing an example of placement restriction information for a best-selling item stored in an information DB according to the present embodiment. FIG. [Figure 8B] 11 is a diagram showing an example of information on the number of products per column stored in the information DB of the present embodiment. FIG. [Figure 8C] 11 is a diagram illustrating an example of minimum column number information held in an information DB according to the embodiment. FIG. [Figure 8D] 11 is a diagram illustrating an example of maximum column number information stored in an information DB according to the present embodiment. FIG. [Figure 8E] 11 is a diagram showing an example of protruding condition information stored in an information DB according to the embodiment; FIG. [Figure 9]FIG. 2 is a diagram showing a conceptual example of a column structure in the present embodiment. [Figure 10] FIG. 13 is a diagram illustrating a conceptual example of excess depth in the present embodiment. [Figure 11] FIG. 2 is a diagram showing an example of a flow of an inventory placement optimization method according to the present embodiment. [Figure 12] FIG. 4 is a diagram showing an example of an output screen in the present embodiment. [Figure 13] FIG. 11 is a diagram illustrating an example of an additional constraint condition according to the present embodiment. [Figure 14] FIG. 11 is a diagram illustrating an example of an additional constraint condition according to the present embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0021] <About mathematical optimization solvers and annealing machines> In the inventory allocation optimization technology of this embodiment, a mathematical optimization solver is used as an engine for solving combinatorial optimization problems. The mathematical optimization solver includes the concepts of a linear programming solver and quantum annealing, either of which can be used in this embodiment.
[0022] As already mentioned, there are several general linear programming solver tools, and their application methods are widely known, so here we will explain the concept of quantum annealing and its application.
[0023] As described in the above-mentioned Patent Document 1, the applicant has developed quantum computing technology and has attempted to solve various problems in, for example, exhaustive search problems based on big data (including the concept of combinatorial optimization problems).
[0024] Quantum computers are generally expected to solve such exhaustive search problems. Quantum computers are made up of basic elements called quantum bits, which can simultaneously realize "0" and "1". As a result, all solution candidates can be calculated simultaneously using the initial value, and there is a possibility that exhaustive search can be realized. However, quantum computers need to maintain quantum coherence throughout the entire calculation time.
[0025] In this context, a method called adiabatic quantum computing has been attracting attention (Reference: E. Farhi, et al., "A quantum adiabatic evolution al gor ithm applied to random instances of an NP-complete problem," S science292,472(2001).).
[0026] This method seeks to obtain a solution by transforming the problem so that the ground state of a physical system is the solution, and finding the ground state.
[0027] Let H^p be the Hamiltonian of the physical system for which the problem is set. However, at the start of the calculation, the Hamiltonian is not H^p, but a different Hamiltonian, H^0, whose ground state is clear and easy to prepare, is used. Next, a sufficient amount of time is taken to transition the Hamiltonian from H^0 to H^p. If a sufficient amount of time is taken, the system will remain in the ground state, and the ground state of the Hamiltonian H^p will be obtained. This is the principle of adiabatic quantum computing. If the calculation time is τ, the Hamiltonian becomes equation (1),
[0028] [Formula 1] TIFF0007591008000001.tif29170
[0029] The solution is obtained by time evolution based on the Schrödinger equation in equation (2). [Formula 2] TIFF0007591008000002.tif29170
[0030] Adiabatic quantum computing can be applied to problems that require exhaustive search, and a solution is reached in a one-way process. However, if the computation process needs to follow the Schrödinger equation in equation (2), quantum coherence must be maintained, just like in a quantum computer.
[0031] However, while a quantum computer repeats gate operations between one or two quantum bits, adiabatic quantum computing involves simultaneous interaction across the entire quantum bit system, and the concept of coherence is different.
[0032] For example, consider a gate operation on a certain quantum bit. In this case, if there is an interaction between that quantum bit and other quantum bits, it will cause decoherence, but in adiabatic quantum computing, all quantum bits interact at the same time, so decoherence does not occur in this example. Reflecting this difference, adiabatic quantum computing is considered to be more robust against decoherence than quantum computers.
[0033] As described above, adiabatic quantum computing is effective for solving difficult problems that require exhaustive search. The problem to be solved is set up in terms of spin-spin interactions and local fields acting on each spin.
[0034] At time t = 0, all spins are oriented in one direction by an external magnetic field, and the external magnetic field is gradually reduced so that it becomes zero at time t = τ.
[0035] Each spin evolves over time, assuming that its orientation is determined by the effective magnetic field at time t, which is determined by the combined effects of the external magnetic field at each site and the spin-spin interactions.
[0036] In this case, the spin direction is not perfectly aligned with the effective magnetic field, but is quantum mechanically corrected so that the system maintains approximately the ground state.
[0037] In addition, a term (relaxation term) that maintains each spin in its original orientation during time evolution is added to the effective magnetic field, improving the convergence of the solution.
[0038] In the present embodiment, the inventory placement optimization system is assumed to be an annealing machine that performs the above-mentioned adiabatic quantum computing, but of course, is not limited to this, and any mathematical optimization solver that can appropriately solve a combinatorial optimization problem in accordance with the inventory placement optimization method of the present invention can be applied.
[0039] As the mathematical optimization solver, for example, existing ones such as CBC (COIN-OR BRAND-and-Cut) Solver (registered trademark), Gurobi (registered trademark), and CPLEX (registered trademark) can be envisaged.
[0040] Another specific example is the use of electronic circuits (digital circuits, etc.) in the annealing method. This includes not only hardware implementations such as superconducting circuits, but also implementations such as superconducting circuits. Hardware that realizes the Ising model using methods other than the annealing method is also acceptable. Examples include laser network methods (optical parametric oscillation) and quantum neural networks. In addition, as mentioned above, although some of the concepts are different, quantum gate methods replace the calculations performed by the Ising model with gates such as Hadamard gates, rotation gates, and controlled NOT gates. The present invention can be realized even in the above.
[0041] <Network configuration> DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described in detail below with reference to the drawings. Fig. 3 is a diagram showing a network configuration including an inventory allocation optimization system 100 according to this embodiment.
[0042] The inventory allocation optimization system 100 shown in Fig. 3 is a computer system that minimizes the number of times products are replenished to a picking area in a logistics warehouse and enables the efficiency of the relevant work, and specifically, is an information processing device that implements a mathematical optimization solver. For example, when the information processing device is equipped with a quantum annealing engine, it becomes an annealing machine.
[0043] However, the outline of the annealing machine has already been described based on Patent Document 1, and the details of its specific configuration, operation, etc. will be omitted as appropriate (hereinafter the same). Also, when a mathematical optimization solver other than annealing technology is adopted, existing technology is adopted, so the details of its specific configuration, operation, etc. will be omitted as appropriate.
[0044] The inventory placement optimization system 100 of this embodiment is connected to a user terminal 200 via an appropriate network 10 such as the Internet so as to be capable of data communication.
[0045] The above-mentioned user terminal 200 is a terminal that receives proposals from the inventory placement optimization system 100 about information for minimizing the number of times products are replenished in the picking area of the logistics warehouse and making the relevant operations more efficient, that is, information such as the placement position and number of products to be placed on the storage shelf in the picking area when storing products from the storage area on the storage shelf (which can be said to be the number of products in the group that makes up the row).
[0046] Specifically, users of this user terminal 200 may be organizations such as operators of logistics warehouses, logistics companies, and e-commerce site operators.
[0047] In any case, any business that stores a wide variety of small quantities of products in a huge logistics warehouse, quickly and reliably ships products in response to orders, and seeks to minimize the number of times products are replenished in the picking area of the logistics warehouse and to improve the efficiency of the business, may fall under the above-mentioned user. In other words, it can be said that the present invention is applicable to the business of such businesses.
[0048] <Hardware configuration> Moreover, the hardware configuration of the inventory placement optimization system 100 of this embodiment is as shown in FIG.
[0049] That is, the inventory placement optimization system 100 includes a storage unit 101 , a memory 103 , a calculation unit 104 , and a communication unit 105 .
[0050] Of these, the storage unit 101 is configured with an appropriate non-volatile storage element such as an SSD (Solid State Drive) or a hard disk drive.
[0051] The memory 103 is composed of a volatile storage element such as a RAM.
[0052] The calculation unit 104 is a CPU that reads out the program 102 stored in the storage unit 101 into the memory 103 and executes the program, controls the device itself, and performs various types of judgment, calculation, and control processing.
[0053] The communication unit 105 is assumed to be a network interface card or the like that is connected to the network 10 and handles communication processing with the user terminal 200 .
[0054] When the inventory placement optimization system 100 is a stand-alone machine, it is preferable that it further comprises an input device for accepting key input or voice input from the user, and an output device such as a display for displaying processed data.
[0055] In addition to the program 102 for implementing the functions required for the inventory allocation optimization system of this embodiment, at least an information DB 125 is stored in the storage unit 101. However, details of this information DB 125 will be described later.
[0056] Furthermore, the program 102, i.e., an algorithm that implements the operation as a mathematical optimization solver, holds information on a mathematical model 1021, which is a problem to be solved. This mathematical model 1021 is set in advance by an administrator or the like with respect to various information required for mathematical analysis, such as objective functions, decision variables, and constraint conditions. When the inventory placement optimization system 100 operates as an annealing machine, the mathematical model 1021 is an Ising model.
[0057] As described above, the annealing machine that solves the Ising model 1021, which is an example of the inventory placement optimization system 100 of the present embodiment, is merely one example, and as already described, it is of course possible to imagine a form in which another mathematical optimization solver is implemented in the program 102 or is called from an external system and used to solve the mathematical model 1021 consisting of an objective function, decision variables, and constraint conditions corresponding to the contents of the Ising model 1021.
[0058] Incidentally, the adiabatic quantum computing described in the overview of the annealing machine is also known as quantum annealing, and is an extension of the concept of classical annealing to quantum mechanics. In other words, adiabatic quantum computing is originally capable of classical operation, and can be interpreted as adding quantum mechanical effects to improve performance in terms of speed and accuracy rate of answers. Therefore, in the present invention, the calculation unit itself is classical, and a parameter determined by quantum mechanics is introduced into the calculation process to realize a calculation method and device that is classical but includes quantum mechanical effects. However, it is of course possible to adopt a form in which the calculation unit is composed of a quantum computer.
[0059] Based on the above concepts, in the following example we describe a classical algorithm for obtaining a ground state solution, while explaining its relevance to adiabatic quantum computing, and a device for implementing it.
[0060] Under these assumptions, the inventory placement optimization system 100 uses N variables sj z (j=1,2,…,N) -1≦sj z The range of values is ≦1, and the problem is defined by the local fields gj and the interactions between the variables Jij (i, j = 1, 2, ..., N).
[0061] In addition, the calculation unit 104 divides the time into m parts and performs calculations from t=tk (tk=0) to tm (tm=τ), and the variable Sj at each time tk is calculated. Z When calculating (tk), the variable Sj at the previous time tk-1 z Using the value of (tk-1)(i=1,2,..,N) and the relaxation term coefficient 9pina or 9pinb, Bj z(tk) = {ΣiJijSi z (tk-1)+gj+sgn(sj z (tk-1))·9pina}·tk / τ or Bj z (tk)={ΣiJiJSj z (tk-1)+gj+9pinb.Sj Z (tk-1)}·tk / τ is calculated, and the above variables Sj z The range of (tk) is -1≦sj z (tk)≦1 Let us define the function f so that Sj z (tk) = f(Bj z (tk), tk), and as the time step progresses from t=t0 to t=tm, the above variables Sj z approaching -1 or 1, and finally sj z If <0, then Sj zd =-1, Sj z If >0, then Sj zd = 1. However, the final solution s j zd If it is appropriate for s to be real, j zd The solution may be defined as a real number in the range [-1,1].
[0062] The coefficient gpinb is, for example, 50% to 200% of the average value of |Jij|. Also, for the local field gj in the problem setting, a correction term δgj' can be added to gj' only for a certain site j' to increase the magnitude of gj' only for that site j'. Also, the correction term δgj' is, for example, 10% to 100% of the average value of |Jij|.
[0063] We then describe the basic principles of annealing machines, starting from a quantum mechanical description and moving to classical formalisms.
[0064] The problem of searching for the ground state of the Ising spin Hamiltonian given by equation (3) includes a classification of problems called NP-hard problems and is known to be a useful problem (Reference: F. Barahona, "On the computational comp lexity of Isingspin glass models," J. Phys. A: Math. Gen. 15, 3241 (1982).).
[0065] [Formula 3] TIFF0007591008000003.tif26170
[0066] Jij and gj are the problem setting parameters, and σ^ Z is the z component of the Pauli spin matrix and takes eigenvalues of ±1. i,j represent the spin site. Ising spin is a variable that can only take the value ±1, and in equation (3), σ^ z Since the eigenvalues of are ±1, it is an Ising spin system.
[0067] The Ising spin in equation (3) does not have to be a literal spin; it can be anything physically possible as long as the Hamiltonian is described by equation (3).
[0068] For example, the number of stacked products that make up a row of products, the number of products arranged in the width and depth directions of the storage shelf, the storage shelf in which the above-mentioned collection will be stored and the arrangement position on that storage shelf can all be associated with a spin of ±1, the high and low of a logic circuit can be associated with ±1, the vertical and horizontal polarization of light can be associated with ±1, and the phase of 0,π can be associated with ±1.
[0069] In the method exemplified here, similar to adiabatic quantum computing, a computation system is prepared in the ground state of the Hamiltonian given by equation (4) at time t=0.
[0070] [Formula 4] TIFF0007591008000004.tif24170
[0071] γ is a proportionality constant determined by the magnitude of the external field applied uniformly to all sites j, and σ^j x is the x-component of the Pauli spin matrix. If the calculation system is the spin itself, the external field means the magnetic field.
[0072] Equation (4) corresponds to the application of a transverse magnetic field, and the ground state is when all spins point in the x direction (γ>0). The Hamiltonian in the problem formulation was defined as an Ising spin system with only the z component, but equation (4) includes the x component of spin. Therefore, the spin in the calculation process is not Ising but vectorial (Bloch vector). At t=0, we start with the Hamiltonian in equation (4), but gradually change the Hamiltonian as time t progresses, and finally obtain the ground state as the Hamiltonian described by equation (3) is obtained as the solution.
[0073] [Formula 5] TIFF0007591008000005.tif17170
[0074] Here, σ^ represents the three components of the Pauli spin matrix as a vector. The ground state is when the spins point in the direction of the magnetic field, and can be written as <σ^>=B / |B|, where <·> is the quantum mechanical expectation value. In an adiabatic process, the ground state is always maintained, so the spin direction always follows the direction of the magnetic field.
[0075] The above discussion can be extended to multi-spin systems. At t=0, the Hamiltonian is given by equation (4). This applies a uniform magnetic field Bj X = γ is applied. At t>0, the x component of the magnetic field gradually weakens and Bj X = γ(1-t / τ). For the z component, the effective magnetic field is given by equation (6) due to the spin-spin interaction.
[0076] [Formula 6] TIFF0007591008000006.tif34170
[0077] The spin direction is <σ^z > / <σ^ X >, so if the spin direction follows the effective magnetic field, the spin direction is determined by equation (7).
[0078] [Formula 7] TIFF0007591008000007.tif29170
[0079] Although equation (7) is a quantum mechanical description, it takes the expectation value and is therefore a relational equation concerning classical quantities, unlike equations (1) to (6).
[0080] In a classical system, there is no nonlocal correlation (quantum thread) of quantum mechanics, so the spin direction should be completely determined by the local field at each site, and formula (7) determines the behavior of the classical spin system. In a quantum system, formula (7) is transformed due to the existence of nonlocal correlation, but this will be described later. Here, we will describe the classical system determined by formula (7) to explain the basic form of the invention.
[0081] Figure 5 shows a timing chart (1) for obtaining the ground state of the spin system. Since the description in Figure 5 is related to classical quantities, the spin of site j is expressed by sj instead of σ^j. Accordingly, the effective magnetic field Bj in Figure 5 is a classical quantity. At t=0, a rightward effective magnetic field Bj is applied to all sites, and all spins Sj are initialized to the right.
[0082] As time t passes, the magnetic field in the z-axis direction and the spin-spin interaction are gradually added, and eventually the spin becomes +z or -z, and the z component of the spin Sj becomes sj z = +1 or -1. Ideally, time t should be continuous, but in the actual calculation process, it can be made discrete to improve convenience. The discrete case is described below.
[0083] The spin shown here is a vectorial spin because it has not only the z component but also the x component. Its vectorial behavior can also be understood from Figure 5. The y component has not appeared so far, but this is because the external field direction is taken to be the xz plane, so there is no y component of the external field, and therefore <σ^ Y This is because >=0.
[0084] The spin of the calculation system is assumed to be a three-dimensional vector of magnitude 1 (called a Bloch vector, which can describe the state as a point on a sphere), but the axis selection in the example shown in the figure requires that only two dimensions be considered (the state can be described as a point on a circle).
[0085] Also, since γ is constant, Bj x (t)>0(γ>0) or Bj x (t)<0(γ<0). In this case, the two-dimensional spin vector can be described only by a semicircle, and Sj z If you specify Sj z Thus, in this example, spin is a two-dimensional vector, but it can also be written as a one-dimensional continuous variable with a range of [-1,1].
[0086] In the timing chart of FIG. 5, the effective magnetic field is calculated for each site at time t=tk, and the spin direction at t=tk is calculated using this value by equation (8).
[0087] [Formula 8] TIFF0007591008000008.tif24170
[0088] Equation (8) is equation (7) rewritten in terms of classical quantities, so there is no <·> symbol. Next, we calculate the effective magnetic field at t=tk+l using the value of the spin at t=tk. The effective magnetic field at each time can be written concretely as equations (9) and (10).
[0089] [Formula 9] TIFF0007591008000009.tif28170
[0090] [Formula 10] TIFF0007591008000010.tif30170
[0091] Hereafter, the spin and effective magnetic field are alternately calculated according to the procedure shown in the timing chart of FIG.
[0092] In the classical system, the magnitude of the spin vector is 1. In this case, each component of the spin vector is tanθ=Bj z (tk) / Bj x Using the parameter θ defined by (tk), Sj z (tk) = sinθ, Sj x It is written as (tk)=COSθ.
[0093] If we rewrite this, Sj z (tk) = sin(arctan(Bj z (tk) / Bj x (tk))), Sj x (tk) = cos(arctan(Bj z (tk) / Bj x (tk))).
[0094] As is clear from equation (9), Bj x The only variable in (tk) is tk, and τ and γ are constants. Therefore, Sj z (tk) = sin(arctan(Bj z (tk) / Bj x (tk))) and Sjx(tk)=cos(arctan(Bj z (tk) / Bj x (tk))) is Bj z Sj as a function of (tk) and tk z (tk) = f1(Bj z (tk), tk) and Sj x (tk)=f2( Bj z A generalized expression such as (tk),tk) is also possible.
[0095] Since spin is described as a two-dimensional vector, Sj z (tk) and sj x (tk) Two components have appeared, Bj z If (tk) is determined based on equation (10), then Sj x (tK) is not necessary.
[0096] This is Sj z This corresponds to the fact that the spin state can be described by (tk) alone. zd , Sj zd =-1 or 1, Sj z If (τ)>0, then Sj zd =1, Sj z If (τ)<0, then Sj zd =-1. However, the final solution s j zd If it is appropriate for s to be real, j zd may be extracted as a real number with a range of [-1,1].
[0097] FIG. 6 shows a flowchart summarizing the above algorithm, where tm=τ. Each step s1 to s9 in the flowchart in FIG. 6 corresponds to a process at a certain time in the timing chart in FIG. 5, which runs from time t=0 to t=τ. That is, steps s2, s4, and s6 in the flowchart correspond to the above equations (9) and (10) at t=t1, tk+l, and tm, respectively. The final solution is found in step s8 by calculating sj z <0 then Sj zd =-1, Sj z If >0, then Sj zd = 1 (s9). However, if it is appropriate for the final solution to be a real number, then s j zd may be defined as a real number with a range of [-1, 1]. Note that the flow in Figure 6 shows a general example, and the description of extracting it as a real number is omitted.
[0098] So far, we have shown how the problem is solved when it is expressed by equation (3). Next, we will explain how a specific problem is expressed by equation (3) including the local field gj and the variable interactions Jij (i, j = 1, 2, ..., N) by using a concrete example.
[0099] The specific problem here, that is, the Ising model 1021, is an Ising model in which, for example, the number of stacked layers of the products constituting the above-mentioned collection and the number of products arranged in the width and depth directions, the storage shelf where the collection is stored and the arrangement position on the storage shelf are each set as spins, and the sensitivity between variables in the above-mentioned constraint function is set as the strength of interaction between the spins, with respect to an objective function including, as terms, a constraint function for maximizing the number of products stored in the storage shelf when each of the constraint conditions, i.e., the position and size of each product storage shelf, the size of each product stored in the storage shelf and the replenishment point as the required minimum inventory number, a collection form in which the same type of product is accumulated in a row on the storage shelf, the arrangement interval between the collections in which the products are accumulated in a row, and the height of the collection on the storage shelf and the arrangement length in the width and depth directions, is satisfied, and the number of stacked layers of the products constituting the above-mentioned collection and the arrangement number in the width and depth directions, the storage shelf where the collection is stored and the arrangement position on the storage shelf are each set as spins, and the sensitivity between variables in the above-mentioned constraint function is set as the strength of interaction between the spins.
[0100] In this case, the local field gj is assumed to be set as the degree of influence that the values of the variables in the constraint function that maximizes the number of products stored in the storage shelf when each of the constraint conditions for the picking area in the logistics warehouse is satisfied: the position and size of each product storage shelf, the size of each product to be stored in the storage shelf and the replenishment point which is the minimum inventory required, the collection pattern in which the same type of product is accumulated in a row on the storage shelf, the arrangement spacing between the collections of products accumulated in a row, and the height of the collection on the storage shelf and the arrangement length in the width and depth directions.
[0101] Through the above considerations, the variable interactions Jij and the local field gj (between each term of the objective function) are specifically set, and the Ising model 1021 expressed by the formula (3) is searched for a ground state in which the number of products stored in the storage shelf is maximized when the constraints of the position and size of each product storage shelf, the size of each product stored in the storage shelf and the replenishment point as the minimum required stock number, the collection form in which the same type of product is accumulated in a row on the storage shelf, the arrangement interval between the collections of the products accumulated in a row, and the height of the collection on the storage shelf and the arrangement length in the width direction and depth direction are satisfied. Through the search for the ground state in which the number of products stored in the storage shelf is maximized when the constraints of the position and size of each product storage shelf, the size of each product stored in the storage shelf and the replenishment point as the minimum required stock number are satisfied, the storage shelf in which the collection of products is stored and the storage shelf are searched for. The arrangement position on the shelf, the number of layers of the products constituting the collection, and the number of products arranged in the width direction and the depth direction are respectively identified.
[0102] <Data structure example> Next, a description will be given of various types of information used by the inventory allocation optimization system 100 of this embodiment. Figures 7A to 7D and 9A to 9E show examples of each type of information held in the information DB 125 of this embodiment.
[0103] The storage shelf information 125A of this embodiment shown in FIG. 7A is a table that stores each piece of output information of each storage shelf in the picking area.
[0104] The information stored here is a collection of records that use the identification information of the storage shelf as a key and associate values such as the location of the storage shelf within the picking area, the number of shelves it has, the shelf size, load capacity, height per shelf, and surrounding conditions.
[0105] 7B, product information 125B of this embodiment is a table that stores various information about products that are stocked on the shelves in the picking area and are to be shipped. This product information is a collection of records that associate product identification information as a key with values such as the product's size, volume, weight, number of shipments (average) in the most recent specified period, and number of shipments (maximum).
[0106] 7C, the aisle information 125C of this embodiment is a table that stores information about the aisles that run around the storage shelves in the picking area. This aisle information is a collection of records in which aisle identification information is used as a key and values such as the position, width, and length in the picking area are associated with each other.
[0107] 7D, the weight / capacity limit information 125D of this embodiment is a table that stores restrictions such as load capacity and capacity limits for each of the above-mentioned storage shelves. This weight / capacity limit information 125D is a collection of records that associate the load capacity and capacity limit values for each shelf of the storage shelf with the storage shelf identification information as a key.
[0108] 8A, the hot selling product placement restriction information 125E of this embodiment is a table that specifies restrictions on placement of hot selling products with a shipping volume above a certain level among the products extracted and shipped from the picking area. This hot selling product placement restriction information 125E is a collection of records that specify whether each hot selling product can be placed on a storage shelf and on the number of shelves.
[0109] Also, the number of products per row information 125F in this embodiment shown in Figure 8B is a table that stores information on the number of products per row, which is determined depending on the size of the product and the size of the storage shelf when each product is accumulated to form a row structure on a storage shelf in the picking area.
[0110] When products are accumulated on a storage shelf to form a row structure, the products are arranged in a storage space on the shelf of the storage shelf in such a way that a specific surface of the product (e.g., a surface that is easy to pick) faces the opening of the storage space in the depth direction, and are stacked in the height direction, for example, up to the height of the storage space minus 5 cm. The rules for generating these row structures are also expressed in mathematical formulas and are stored in the information DB 125 as one of the constraints. In the example of FIG. 9, one row of product A is composed of a total of six products, with three products connected in the depth direction and two stacked in the height direction.
[0111] The minimum row number information 125G of this embodiment shown in Fig. 8C is a table that specifies the minimum number of rows in which each product is stacked on the storage shelf in the picking area. The maximum row number information 125H shown in Fig. 8D specifies the maximum number of rows in which each product is stacked on the storage shelf in the picking area. This is a table that specifies the maximum number of column structures that can be specified.
[0112] The protruding condition information 125I of this embodiment shown in Fig. 8E is a table that specifies information on the length by which the line structure of each product may protrude beyond the end of the storage shelf in the picking area. Based on this protruding condition information 125I, if the line structure of each product protrudes beyond the storage area of the storage shelf, it is determined whether it satisfies the allowable conditions specified in this table (see Fig. 10). In other words, the protruding condition information 125I is one of the constraint conditions.
[0113] It is assumed that the information held by the information DB 125 in this embodiment is configured as each condition equation (such as a constraint function in the case of the Ising model 1021) of the constraint conditions, decision variables, and objective functions to be applied to the mathematical model 1021. It is also assumed that users appropriately adopt a description method (known) for each condition equation to generate the condition equations, and that the inventory placement optimization system 100 holds the generated condition equations in advance.
[0114] <Flow example> The actual procedure of the inventory placement optimization method in this embodiment will be described below with reference to the drawings. The various operations corresponding to the inventory placement optimization method described below are realized by a program that is read into a memory or the like and executed by the inventory placement optimization system 100. This program is composed of codes for performing the various operations described below.
[0115] 11 is a diagram showing an example of a flow of the inventory allocation optimization method in this embodiment. In this case, the inventory allocation optimization system 100 uses the number of products stored in a storage shelf as an objective function as a mathematical model 1021 (or an Ising model 1021) to be processed, the storage shelf that is the storage destination of the row structure that is a collection of products and the arrangement position on the storage shelf, the number of stacked products that constitute the row structure of products, and the arrangement number in the width direction and the depth direction, as decision variables, and calculates each value of the decision variable that maximizes the storage number, which is the objective function, by a mathematical optimization solver included in the program 102 or appropriately called from an external system under constraint conditions (the position and size of each storage shelf of the products in the picking area in the logistics warehouse, the size of each product stored in the storage shelf and the replenishment point that is the minimum stock number required, the collection form in which the same type of product is accumulated in a row on the storage shelf, the arrangement interval between the row structures (collections) in which the products are accumulated in a row, and the height of the row structure on the storage shelf and the arrangement length in the width direction and the depth direction).
[0116] In addition, when an Ising model is adopted as the mathematical model 1021 and the inventory placement optimization system 100 is an annealing machine, a model is calculated in which the above-mentioned decision variables are set as spins and the sensitivities between variables in the objective function are set as the strength of interaction between the spins for the constraint condition function that is maximized when each of the above-mentioned constraint conditions is satisfied.
[0117] Therefore, the inventory placement optimization system 100 extracts information corresponding to the above-mentioned constraint conditions and decision variables (including mathematical expressions defined based on this) from the information held in the information DB 125 of the storage device 101, and stores it in the memory 103 (s10).
[0118] Also, similar to s10, the inventory placement optimization system 100 extracts objective function information (a mathematical formula that defines the storage quantity) from the information held in the above-mentioned information DB 125, and stores this in the memory 103 (s11).
[0119] Next, the inventory placement optimization system 100 provides the above-mentioned objective function, decision variables, and constraint conditions to a mathematical optimization solver, and calculates each value of the decision variables that maximizes the storage quantity, which is the objective function (s12). Here, the maximized storage quantity is the maximum value of the replenishment limit.
[0120] Next, the inventory placement optimization system 100 calculates the replenishment limit determined in s12. The number of times the product is replenished from the storage area to the picking area is calculated by dividing the total number of shipments of the product in a specified period in the past (the average number of shipments in product information 125B in Figure 7B) by the value obtained by subtracting the replenishment point (the maximum number of shipments in product information 125B in Figure 7B) from the total number of shipments (the average number of shipments in product information 125B in Figure 7B) (s13).
[0121] Next, the inventory placement optimization system 100 outputs to the user terminal 200 (see FIG. 12) (s14) the values of the decision variables obtained up to this point, i.e., the storage shelf where the products in the row structure will be stored and their placement positions on that storage shelf, the number of layers of the products in the row structure and the number of positions in the width and depth directions, the number of replenishments calculated in s13 above, and the replenishment limit value, and then ends the process.
[0122] The information on constraints held in the information DB 125 may further include information on constraints that prohibit product placement in a specific portion (e.g., the position at the beginning of the second shelf; see FIG. 13) facing the opening of the storage shelf among products forming a row structure (assembly) in order to ensure space for picking operations.
[0123] In this case, the inventory placement optimization system 100 performs calculations using a mathematical optimization solver under information on constraint conditions, including constraint conditions that prohibit the above-mentioned product placement. In this case, product placement that hinders the removal of products from storage shelves is avoided, making picking operations easier and ultimately enabling further efficiency improvements in picking operations in logistics warehouses.
[0124] Furthermore, the information on constraint conditions held in the information DB 125 may further include information on constraint conditions related to an upper limit on the number of products that may be moved on the shelves (see FIG. 14) based on the results of calculations performed by a mathematical optimization solver.
[0125] In this case, the inventory placement optimization system 100 performs calculations using a mathematical optimization solver under information on constraint conditions, including the constraint condition on the upper limit of the number of items to be moved. This makes it possible to appropriately suppress the burden of moving items on workers when the existing item placement on a storage shelf is changed. This in turn makes it possible to further improve the efficiency of picking operations in logistics warehouses.
[0126] Although the best mode for carrying out the present invention has been specifically described above, the present invention is not limited to this, and various modifications can be made without departing from the spirit and scope of the present invention.
[0127] According to this embodiment, it is possible to minimize the number of times products are replenished in the picking area of a logistics warehouse, thereby making the relevant operations more efficient.
[0128] The description of this specification makes at least the following clear: That is, in the inventory placement optimization system of this embodiment, the calculation unit may calculate the number of replenishment times of the product from the storage area to the picking area by dividing the total number of shipments of the product in a predetermined past period by a value obtained by subtracting the replenishment point from the replenishment limit, which is the storage number, and output the calculated number to a predetermined device.
[0129] According to this, information on the number of replenishment times that is minimized based on the maximized replenishment limit is output, and users such as warehouse managers can clearly recognize the results and effects of inventory placement optimization. Furthermore, by implementing operations such as inventory placement based on this information, the number of times products are actually replenished to the picking area in the warehouse can be minimized, making it possible to improve the efficiency of the operations.
[0130] Furthermore, in the inventory placement optimization system of this embodiment, the memory unit may further store, as the constraint condition information, information on a constraint condition that prohibits product placement in a specific portion of the collection facing the opening of the storage shelf in order to ensure space for picking operations, and the calculation unit may perform the calculation under the constraint condition information including the constraint condition that prohibits the product placement.
[0131] This makes it easier to take out products from the storage shelves, i.e., the picking operation, and ultimately makes it possible to further improve the efficiency of picking operations in logistics warehouses.
[0132] Furthermore, in the inventory placement optimization system of this embodiment, the memory unit may further store, as the constraint condition information, information on a constraint condition on a protrusion length by which the product may exceed the placement length and protrude from the storage shelf, and the calculation unit may perform the calculation under the constraint condition information including the protrusion length constraint condition.
[0133] This makes it possible to appropriately accommodate situations and shapes where products are arranged with their ends protruding from the storage shelves, improving the storage efficiency of products on the shelves and increasing the replenishment limit, thereby minimizing the number of times products are replenished to the picking area in the logistics warehouse and making the relevant operations even more efficient.
[0134] Furthermore, in the inventory placement optimization system of this embodiment, the memory unit may further store, as the constraint condition information, information on a constraint condition related to an upper limit of the number of products that will be moved on the storage shelf based on the result of the calculation, and the calculation unit may perform the calculation under the constraint condition information including the constraint condition of the upper limit of the number of products.
[0135] According to this, by applying the present invention, when the existing product arrangement on the storage shelf is changed, it is possible to appropriately suppress the burden on workers of moving products, which in turn makes it possible to further improve the efficiency of picking operations in logistics warehouses.
[0136] Furthermore, in the inventory placement optimization system of this embodiment, the calculation unit may calculate an Ising model in which the number of stacked layers of the products constituting the collection, the number of products arranged in the width direction and the depth direction, the storage shelf where the collection is to be stored, and the arrangement position on the storage shelf are each set as spins, with the sensitivity between variables in the constraint condition function set as the strength of interaction between the spins, for an objective function including, as a term, a constraint condition function that maximizes the number of products that can be stored in the storage shelf when each of the constraint conditions is satisfied.
[0137] This makes it possible to reduce the time required for calculations compared to when using existing linear programming solvers, thereby further improving the efficiency of picking operations in logistics warehouses.
[0138] In addition, in the inventory placement optimization system of the present embodiment, a CMOS annealing machine that solves combinatorial optimization problems regarding the Ising model may be used.
[0139] This makes it possible to simulate the operation of the Ising model using a circuit that uses semiconductor elements such as CMOS (Complementary Metal Oxide Semiconductor), and efficiently obtain practical solutions to combinatorial optimization problems that take into account mutually influencing constraint conditions, i.e. nonlinear constraint conditions, at room temperature. This in turn makes it possible to minimize the number of times products are replenished in the picking area of a logistics warehouse, further improving the efficiency of that operation. [Explanation of symbols]
[0140] 10 Network 100 Inventory placement optimization system 101 Storage section 102 Programs 1021 Mathematical Model 103 Memory 104 Arithmetic section 105 Communications Department 125 Information DB 200 User terminals
Claims
1. a storage unit that stores information on each of the constraints regarding a picking area in a logistics warehouse, such as the position and size of each storage shelf for the products, the size of each product stored in the storage shelf and a replenishment point that is the minimum number of products required, a collection form in which the same type of products are accumulated in a row on the storage shelf, the arrangement intervals between the collections in which the products are accumulated in a row, and the height and the arrangement length in the width direction and depth direction of the collection on the storage shelf; a calculation unit that calculates values of the decision variables that maximize the storage number, which is the objective function, using a mathematical optimization solver under the constraint conditions, and that defines the number of products stored in the storage shelf as an objective function, and the storage shelf in which the collection is stored and the arrangement position in the storage shelf, the number of stacked layers of the products that make up the collection, and the arrangement number in the width direction and the depth direction as decision variables; The calculation unit outputs each value of the decision variable to a predetermined device based on a result of the calculation. The inventory placement optimization system is characterized by:
2. The calculation unit is The number of times the product is replenished from the storage area to the picking area is calculated by subtracting the replenishment point from the replenishment limit, which is the number of storages, and dividing the total number of shipments of the product in a specified period in the past by the value obtained, and outputting the calculated number to a specified device.
2. The inventory placement optimization system according to claim 1 .
3. The storage unit is As the information on the constraint condition, information on a constraint condition that prohibits product placement in a specific portion of the assembly facing an opening surface of the storage shelf in order to secure a space for picking operations is further stored; The calculation unit is The calculation is performed under information of the constraint conditions including a constraint condition that prohibits the product placement.
2. The inventory placement optimization system according to claim 1 .
4. The storage unit is As the information on the constraint condition, information on a constraint condition on a protruding length by which the product can protrude from the storage shelf in excess of the arrangement length is further stored; The calculation unit is The calculation is performed under information of the constraint conditions including the constraint condition of the protrusion length.
2. The inventory placement optimization system according to claim 1 .
5. The storage unit is As the information on the constraint condition, information on a constraint condition regarding an upper limit of the number of products that may be moved in the storage shelf based on the result of the calculation is further stored; The calculation unit is The calculation is performed under information of the constraint conditions including the constraint condition of the upper limit of the number of products.
2. The inventory placement optimization system according to claim 1 .
6. The calculation unit is Regarding an objective function including as a term a constraint condition function that maximizes the number of products stored in the storage shelf when each of the constraint conditions is satisfied, The storage shelf and the arrangement position on the storage shelf are each set as a spin, and an Ising model is calculated in which the sensitivity between variables in the constraint function is set as the strength of interaction between the spins.
2. The inventory placement optimization system according to claim 1 .
7. 7. The inventory placement optimization system according to claim 6, wherein the inventory placement optimization system is a CMOS annealing machine that solves a combinatorial optimization problem with respect to the Ising model.
8. The information processing system a storage unit stores information on each of the constraints regarding a picking area in a logistics warehouse, the position and size of each storage shelf for the products, the size of each product stored in the storage shelf and a replenishment point that is the minimum number of products required, a collection form in which the same type of products are accumulated in a row on the storage shelf, the arrangement intervals between the collections in which the products are accumulated in a row, and the height and the arrangement length in the width direction and depth direction of the collection on the storage shelf; The number of the products stored in the storage shelf is an objective function, and the storage shelf in which the collection is stored and the arrangement position in the storage shelf, the number of stacked layers of the products constituting the collection, and the arrangement number in the width direction and depth direction are each decision variables, and a mathematical optimization solver is used to maximize the storage number, which is the objective function, and values of the decision variables are output to a specified device based on the results of the calculation. The inventory allocation optimization method according to the present invention is characterized in that
Citation Information
Patent Citations
Centralized replenishment path determination method, device and equipment and storage medium
CN111612196A
Component shelf layout design device and program
JP2015079318A
Rack of automatic warehouse and assembly method of the same
JP2015193469A
Optimization device, optimization method and optimization program
JP2020194273A
Article arrangement optimization system and method
JP2021120891A
