Information processing method, information processing device, and information processing program

Abstract

This information processing device: acquires a priority level set for a transportation route connecting a goods supply location and a location where a warehouse storing goods is provided, said priority level indicating the degree to which the transportation volume along the transportation route is to be stabilized; acquires the demand volume for the goods for each predetermined period; acquires route information indicating the transportation route; acquires cost information indicating costs regarding the warehouse; determines the allowable change in transportation volume along the transportation route according to the priority level; optimizes the transportation volume of goods along the transportation route and the inventory volume of goods in the warehouse on the basis of the demand volume, the route information, the cost information, and the allowable change in volume; and outputs the optimized transportation volume and inventory volume.

Description

Information processing method, information processing device, and information processing program

[0001] This disclosure relates to a technology for simultaneously creating a transportation plan for transporting goods from a supply location to a base and an inventory placement plan for storing goods at the base.

[0002] For example, Patent Document 1 discloses an inventory allocation plan determination device that predicts the timing of future demand for a part based on demand information regarding the demand for the part and search history information regarding the history of searches for the part, and generates an inventory allocation plan for the inventory of the part at a logistics base based on the prediction result.

[0003] However, while the conventional technology described above creates inventory placement plans for parts at logistics centers, it does not consider transportation plans for transporting parts to these centers. Therefore, it is difficult to stabilize the volume of goods transported along the transportation route with this conventional technology, and further improvements were needed.

[0004] Japanese Patent Publication No. 2024-54704

[0005] This disclosure was made to solve the above-mentioned problems and aims to provide a technology that can stabilize the volume of goods transported along a transportation route.

[0006] An information processing method according to one aspect of the present disclosure is an information processing method performed by a computer, comprising: obtaining a priority indicating the degree to which the amount of goods transported along a transport route is stabilized, which is set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is provided; obtaining the amount of goods in demand for each predetermined period; obtaining route information indicating the transport route; obtaining cost information indicating the costs related to the warehouse; determining an allowable amount of change in the amount of goods transported along the transport route according to the priority; optimizing the amount of goods transported along the transport route and the amount of goods in stock at the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and outputting the optimized amount of goods transported and the amount of stock.

[0007] According to this disclosure, the volume of goods transported along the transport route can be stabilized.

[0008] This figure shows an example of the configuration of the information processing system according to this embodiment. This figure is for explaining the priority in this embodiment. This figure is for explaining the optimization processing by the optimization processing unit in this embodiment. This figure is for explaining the calculation of the demand quantity for each base when there are multiple bases in this embodiment. This is a flowchart for explaining the information processing by the server in the embodiment of this disclosure. This figure shows an example of a display screen displayed on the display unit when the priority of the transport route to the relay base is level 1 and the priority of the transport route to the demand area is level 2. This figure shows an example of a display screen displayed on the display unit when the priority of the transport route to the relay base is level 1 and the priority of the transport route to the demand area is level 1. This figure shows an example of a display screen displayed on the display unit when the priority of the transport route to the relay base is level 1 and the priority of the transport route to the demand area is not set. This figure shows an example of a display screen displayed on the display unit when the priority of the transport route to the relay base is level 1, the priority of the transport route to the demand area is level 3 and the fluctuation period is set to 4.

[0009] (Knowledge forming the basis of this disclosure) In the logistics industry, a shortage of transporters (e.g., truck drivers) has been a long-standing problem. Furthermore, the harsh working conditions of transporters have been pointed out, and improving these working conditions is also a challenge.

[0010] Traditionally, inventory placement plans for storing goods at logistics centers and transportation plans for transporting goods to these centers were created separately. In this case, transportation volumes fluctuated in accordance with changes in demand, potentially leading to instability in transportation volume. Instability in transportation volume could also lead to instability in the employment of transporters who transport products.

[0011] In the conventional technology described above, an inventory placement plan is created for the amount of parts stocked at a logistics center, but the transportation plan for the amount of goods transported along the transportation route to the logistics center is not considered. Therefore, it is difficult to stabilize the amount of goods transported along the transportation route with the conventional technology. In addition, in the conventional technology, the transportation plan and the inventory placement plan are created separately, which increases the number of processing steps for the computer to create the transportation plan and the inventory placement plan, potentially increasing the burden on the computer.

[0012] To address the above challenges, the following technologies are disclosed.

[0013] (1) An information processing method according to one aspect of the present disclosure is an information processing method performed by a computer, which includes: obtaining a priority indicating the degree to which the amount of goods to be transported along a transport route is stabilized, set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is provided; obtaining the amount of goods to be demanded for each predetermined period; obtaining route information indicating the transport route; obtaining cost information indicating the costs related to the warehouse; determining an allowable amount of change in the amount of goods to be transported along the transport route according to the priority; optimizing the amount of goods to be transported along the transport route and the amount of goods to be stocked in the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and outputting the optimized amount of goods to be transported and the amount of stock.

[0014] According to this configuration, a priority is obtained for the transportation route connecting the source of goods and the location where the goods are stored in a warehouse. This priority indicates the degree to which the transportation volume along the route should be stabilized, and the allowable change in the transportation volume along the route is determined according to the priority. Then, based on the demand, route information, cost information, and allowable change, the transportation volume of goods along the route and the inventory level of goods in the warehouse are optimized.

[0015] Therefore, by optimizing the volume of goods transported along the transport route and the inventory level of goods in the warehouse so that the change in transport volume along the transport route is less than or equal to the allowable change, the volume of goods transported along the transport route can be stabilized. Furthermore, by stabilizing the transport volume, the employment of transporters can be stabilized. In addition, inventory placement that takes into account the stabilization of transport volume can be achieved.

[0016] Furthermore, since transportation plans and inventory placement plans are created simultaneously, the number of computer processing steps required to create these plans can be reduced, thereby lessening the burden on the computer.

[0017] (2) In the information processing method described in (1) above, the supply location includes at least one supply location, the base includes at least one demand location for the goods and at least one transit base located between the at least one supply location and the at least one demand location, and the transport route may include a plurality of transport routes connecting each of the at least one supply location, the at least one transit base, and the at least one demand location.

[0018] This configuration makes it possible to stabilize the volume of goods transported along each of the multiple transport routes connecting at least one supply point, at least one transit point, and at least one demand point.

[0019] (3) In the information processing method described in (1) or (2) above, the optimization of the transport volume and the inventory volume may include further optimizing the warehouse capacity required for the warehouse, and the output of the transport volume and the inventory volume may also include further outputting the optimized warehouse capacity.

[0020] This configuration further optimizes the required warehouse capacity, and the optimized warehouse capacity is output, making it possible to present a warehouse capacity design plan that takes into account the stabilization of transportation volume.

[0021] (4) In the information processing method described in any one of (1) to (3) above, the acquisition of the demand quantity may include acquiring the demand quantity for each predetermined period in the past.

[0022] This configuration allows for the acquisition of historical demand data for predetermined periods, enabling simulation of past transportation volumes of goods along transportation routes and past inventory levels of goods in warehouses. The simulation results can then be used to create future transportation plans and inventory placement plans.

[0023] (5) In the information processing method described in any one of (1) to (3) above, the acquisition of the demand quantity may include acquiring the demand quantity for each predetermined period in the future.

[0024] With this configuration, future demand quantities for predetermined periods are obtained, allowing for the simulation of future transport volumes of goods along transportation routes and future inventory levels of goods in warehouses. Based on the simulation results, future transportation plans and inventory placement plans can be created.

[0025] (6) In the information processing method described in any one of (1) to (5) above, the cost information includes warehouse construction costs indicating the costs required to construct the warehouse, warehouse operation costs indicating the costs required to operate the warehouse, and warehouse temporary excess costs indicating the costs required to temporarily store the goods in excess of the required warehouse capacity, and the optimization of the transport volume and the inventory volume is performed by setting the warehouse capacity at base i to W ｉ Let v be the temporary warehouse capacity for the period t in which the goods are temporarily stored in excess of the warehouse capacity at the aforementioned base i. ｉ Let [t] be the cost of constructing the warehouse, and c ｗ And the warehouse operating costs are set to c ｏ The aforementioned warehouse temporary excess costs are set to c ｖ Let the inventory quantity at the aforementioned location i during period t be s ｉ Let [t] be the transport volume during period t in the transport route toward base i, and p ｉ Let [t] be the amount of demand at the base i during period t, and D ｉ Let [t] be the limiting factor, and let the allowable change be ε. The objective function f shown in equation (1) below satisfies the constraints shown in equations (2) to (5) below and is minimized, such that the pｉ [t] and the said s ｉ [t] and the said W ｉ and the said v ｉ It may include calculating [t] and.

[0026] f = W ｉ *c ｗ + W ｉ *c ｏ *t + Σv ｉ [t]*c ｖ ...(1) s ｉ [t] ≤ W ｉ + v ｉ [t]...(2) v ｉ [t] ≥ 0...(3) s ｉ [t] - s ｉ [t - 1] = p ｉ [t - 1] - D ｉ [t - 1]...(4) |p ｉ [t] - p ｉ [t - 1]| ≤ ε...(5)

[0027] According to this configuration, the objective function f shown in the above formula (1) satisfies the constraint conditions shown in the above formulas (2) to (5) and is minimized, so that p ｉ [t] and s ｉ [t] and W ｉ and v ｉ [t] and are calculated, so that the optimal values of the transportation volume, inventory volume, and temporary warehouse capacity for each predetermined period at the base, and the optimal value of the warehouse capacity at the base can be calculated.

[0028] (7) In the information processing method described in (6) above, when there are a first base, a second base to which the article is transported from the first base, and a third base to which the article is transported from the first base, the demand at the first base may be replaced with a value obtained by summing the first transportation volume in the first transportation route connecting the first base and the second base and the second transportation volume in the second transportation route connecting the first base and the third base.

[0029] The quantity demanded represents the amount of goods to be delivered from the point of demand to the consumer. At the point of demand, the optimal values ​​for transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity are calculated using the quantity demanded. In contrast, at the first location, which is not a point of demand, the optimal values ​​for transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity at the first location are calculated by summing the first transport volume on the first transport route connecting the first and second locations, and the second transport volume on the second transport route connecting the first and third locations. Therefore, the optimal values ​​for transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity at locations that are not points of demand can be calculated.

[0030] (8) In the information processing method described in any one of (1) to (7) above, the allowable change amount may decrease as the priority increases.

[0031] With this configuration, the higher the priority of the transport route, the less the volume of goods transported over a predetermined period will change, thus stabilizing the volume of goods transported along the transport route.

[0032] (9) In the information processing method described in any one of (1) to (8) above, if there are multiple locations, the optimization of the transport volume and the inventory volume may include optimizing the transport volume and the inventory volume for each of the multiple locations in the order from the demand location to the supply location.

[0033] With this configuration, if there are multiple locations, the transport volume and inventory volume can be recursively calculated for each of the locations in the order from the demand area to the supply area.

[0034] Furthermore, this disclosure can be implemented not only as an information processing method that performs the characteristic processing described above, but also as an information processing device having a characteristic configuration corresponding to the characteristic processing performed by the information processing method. It can also be implemented as a computer program that causes a computer to execute the characteristic processing included in such an information processing method. Therefore, the same effects as the above-described information processing method can be achieved in the following other embodiments.

[0035] (10) An information processing device according to another aspect of the present disclosure is an information processing device comprising a processor, the processor acquires a priority indicating the degree to which the amount of goods to be transported along a transport route is set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is provided, acquires the amount of goods to be transported along the transport route, acquires the amount of goods to be transported along the transport route for a predetermined period of time, acquires route information indicating the transport route, acquires cost information indicating the costs related to the warehouse, determines the allowable amount of change in the amount of goods to be transported along the transport route according to the priority, optimizes the amount of goods to be transported along the transport route and the amount of goods to be stocked in the warehouse based on the amount of goods to be transported along the transport route and the amount of goods to be stocked in the warehouse, and outputs the optimized amount of goods to be transported and the amount of stock.

[0036] (11) An information processing program according to another aspect of the present disclosure acquires a priority indicating the degree to which the amount of goods to be transported along a transport route is stabilized, which is set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is located; acquires the amount of demand for the goods at predetermined intervals; acquires route information indicating the transport route; acquires cost information indicating the costs related to the warehouse; determines the allowable amount of change in the amount of goods to be transported along the transport route according to the priority; optimizes the amount of goods to be transported along the transport route and the amount of goods to be stocked in the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and causes the computer to function to output the optimized amount of goods to be transported and the amount of stock.

[0037] (12) Non-temporary computer-readable recording media relating to other aspects of the present disclosure record the information processing programs described in (11) above.

[0038] Embodiments of this disclosure will be described below with reference to the attached drawings. Note that the embodiments described below are all specific examples of this disclosure. The numerical values, shapes, components, steps, and order of steps shown in the following embodiments are examples only and are not intended to limit this disclosure. Furthermore, components in the following embodiments that are not described in the independent claim representing the highest-level concept will be described as optional components. Also, in all embodiments, the contents of each can be combined.

[0039] (Embodiment) Figure 1 is a diagram showing an example of the configuration of the information processing system 1 according to this embodiment.

[0040] The information processing system 1 includes a server 10 and a terminal 20.

[0041] Server 10 is an example of an information processing device and computer. Server 10 and terminal 20 are connected to each other via a network so that they can communicate with one another. An example of a network is the internet. Server 10 is, for example, a cloud server composed of one or more computers. However, this is just an example, and Server 10 may be composed of an edge server or implemented on terminal 20.

[0042] Terminal 20 is, for example, a smartphone, a tablet computer, or a personal computer. Terminal 20 displays an image on the display unit 23 according to the control of the server 10. Terminal 20 includes an input unit 21, a processor 22, a display unit 23, and a communication unit 24.

[0043] The input unit 21 consists of, for example, a keyboard, a touch panel, and a mouse, and accepts various types of information input from the user.

[0044] The processor 22 is composed of, for example, a central processing unit (CPU), and displays the display screen indicated by the display data received by the communication unit 24 on the display unit 23.

[0045] The display unit 23 is composed of various display devices, such as a liquid crystal display or an organic EL (Electro-Luminescence) display, and displays various display screens under the control of the processor 22.

[0046] The communication unit 24 is a communication interface that connects the terminal 20 to the network. The communication unit 24 transmits various information received from the user by the input unit 21 to the server 10. The communication unit 24 also receives display data from the server 10 for displaying various screens.

[0047] The server 10 includes a processor 11, memory 12, and a communication unit 13. The processor 11 is, for example, a central processing unit (CPU). The processor 11 includes a priority acquisition unit 101, a demand information acquisition unit 102, a route information acquisition unit 103, a cost information acquisition unit 104, a change amount determination unit 105, and an optimization processing unit 106. The priority acquisition unit 101, the demand information acquisition unit 102, the route information acquisition unit 103, the cost information acquisition unit 104, the change amount determination unit 105, and the optimization processing unit 106 may be implemented by the processor 11 executing an information processing program, or they may be configured as dedicated hardware circuits such as ASICs. The information processing program may be recorded on a non-temporary computer-readable recording medium.

[0048] The communication unit 13 is a communication interface that connects the server 10 to the network. The communication unit 13 receives various information from the user via the terminal 20. The communication unit 13 also transmits display data to the terminal 20 for displaying various screens.

[0049] The memory 12 consists of a non-volatile rewritable storage device such as a hard disk drive or a solid-state drive. The memory 12 includes a demand information storage unit 201, a route information storage unit 202, a cost information storage unit 203, and a warehouse capacity storage unit 204.

[0050] In this embodiment, the article is, for example, a product. The place of supply is, for example, a factory. Products produced at the factory are shipped to the base. The base includes a place of demand. The place of demand is, for example, a store. At the store, products are sold to consumers. The quantity of the article sold to consumers at the place of demand is the quantity of demand. The base is equipped with a warehouse for storing the article. The base may also include a transit point established between the place of supply and the place of demand. The article is transported from the place of supply to the transit point. Thereafter, the article is transported from the transit point to the place of demand.

[0051] Furthermore, there may be multiple supply locations, or at least one supply location. Also, there may be multiple bases, or at least one base. Also, there may be multiple demand locations, or at least one demand location. Also, there may be multiple relay bases, or at least one relay base.

[0052] The priority acquisition unit 101 acquires the priority set for the transportation route connecting the source of goods and the base where the warehouse for storing the goods is located. The priority indicates the degree to which the transportation volume along the transportation route is stabilized. The priority is expressed in three levels, for example, Level 1, Level 2, and Level 3. Level 1 has the highest priority, Level 2 has the second highest priority, and Level 3 has the lowest priority. A priority is set for the transportation route according to the degree to which the transportation volume is stabilized.

[0053] In this embodiment, priority is expressed in three levels, but this disclosure is not limited thereto, and priority may be expressed in four or more levels. Also, priority does not have to be set for the transport route.

[0054] The input unit 21 receives user input regarding the priority of the transport route. The user inputs one of three priority levels (1 to 3) for the transport route. The communication unit 24 transmits information indicating the priority entered by the input unit 21 to the server 10. The communication unit 13 of the server 10 receives the information indicating the priority transmitted by the terminal 20. The priority acquisition unit 101 acquires the priority received by the communication unit 13.

[0055] Figure 2 is a diagram illustrating the priority order in this embodiment.

[0056] In Figure 2, the logistics network includes a supply point 300, a first transit point 301, a second transit point 302, a first demand point 303, a second demand point 304, a third demand point 305, and a fourth demand point 306.

[0057] For example, a first transport route 311 connecting the supply point 300 and the first transit point 301 is assigned a priority level of 3, and a second transport route 312 connecting the supply point 300 and the second transit point 302 is assigned a priority level of 3. Also, for example, a third transport route 313 connecting the first transit point 301 and the first demand point 303 is assigned a priority level of 2, a fourth transport route 314 connecting the first transit point 301 and the second demand point 304 is assigned a priority level of 1, a fifth transport route 315 connecting the second transit point 302 and the third demand point 305 is assigned a priority level of 1, and a sixth transport route 316 connecting the second transit point 302 and the fourth demand point 306 is assigned a priority level of 1.

[0058] If there are multiple transportation routes connecting at least one supply point, at least one transit point, and at least one demand point, the priority acquisition unit 101 acquires multiple priorities set for the multiple transportation routes.

[0059] For example, a user can prioritize transportation routes where securing carriers is difficult. By setting a higher priority, the volume of goods transported on those routes at predetermined intervals becomes stable. On the other hand, the stable volume of goods transported increases the inventory level at the distribution center at predetermined intervals.

[0060] The demand information storage unit 201 stores in advance the demand quantity of the goods for each predetermined period. The demand information storage unit 201 stores the past demand quantity of the goods for each predetermined period. The demand information storage unit 201 may also store the future demand quantity of the goods for each predetermined period. The predetermined period is, for example, one day, one week, or one month. The demand information storage unit 201 may store past demand records of the goods, or it may store predicted future demand for the goods.

[0061] The demand information acquisition unit 102 acquires the demand quantity of an item for each predetermined period. The predetermined period is, for example, one day, one week, or one month. The demand quantity indicates the number of items sold to consumers from the demand location, which is the base of operations. If there are multiple demand locations, the demand information acquisition unit 102 acquires the demand quantity for each of the multiple demand locations. The demand information acquisition unit 102 reads the past demand quantity of the item for each predetermined period from the demand information storage unit 201. The demand information acquisition unit 102 may also read the future demand quantity of the item for each predetermined period from the demand information storage unit 201.

[0062] The route information storage unit 202 stores route information indicating the transportation route in advance. The route information is represented by an adjacency matrix of a directed graph. That is, the rows and columns of the adjacency matrix R correspond to sets of supply locations, bases, and consumers. If a transportation route exists from base i to base j adjacent to base i, the element (i, j) of the adjacency matrix R becomes 1, and if there is no transportation route from base i to base j adjacent to base i, the element (i, j) of the adjacency matrix R becomes 0.

[0063] The route information acquisition unit 103 acquires route information indicating the transportation route. The route information acquisition unit 103 reads the route information from the route information storage unit 202.

[0064] The cost information storage unit 203 stores cost information indicating costs related to the warehouse. The costs are used in the objective function described later. The cost information includes warehouse construction costs, which indicate the costs required to construct the warehouse; warehouse operation costs, which indicate the costs required to operate the warehouse; and warehouse temporary excess costs, which indicate the costs required to temporarily store goods in excess of the required warehouse capacity. Warehouse construction costs, warehouse operation costs, and warehouse temporary excess costs are quantified. The values ​​of each cost may be predetermined or set by the user.

[0065] The cost information acquisition unit 104 acquires cost information that shows the costs related to the warehouse. The cost information acquisition unit 104 reads the cost information from the cost information storage unit 203.

[0066] The warehouse capacity storage unit 204 pre-stores warehouse capacity information indicating the current warehouse capacity of the warehouse at the base. The warehouse capacity information is information that associates information identifying the base with the current warehouse capacity of the warehouse at that base. Warehouse capacity is expressed as the number of items that can be stored in the warehouse.

[0067] The change amount determination unit 105 determines the allowable change in transport volume to be allowed along the transport route according to the priority acquired by the priority acquisition unit 101. The change amount determination unit 105 reads the warehouse capacity associated with the base from the warehouse capacity storage unit 204. The change amount determination unit 105 determines the allowable change amount based on the priority and the current warehouse capacity.

[0068] More specifically, the change amount determination unit 105 determines the allowable change amount by multiplying the warehouse capacity by a percentage corresponding to the priority level. For example, a priority level of 1 is set to a percentage of 0%, a priority level of 2 is set to a percentage of 10%, and a priority level of 3 is set to a percentage of 20%.

[0069] For example, if the warehouse capacity is 1000 units and the priority is level 1, the change amount determination unit 105 determines the allowable change amount to be 0 by multiplying 0% by 1000. For example, if the warehouse capacity is 1000 units and the priority is level 2, the change amount determination unit 105 determines the allowable change amount to be 100 by multiplying 10% by 1000. For example, if the warehouse capacity is 1000 units and the priority is level 3, the change amount determination unit 105 determines the allowable change amount to be 200 by multiplying 20% ​​by 1000.

[0070] If multiple transport routes exist, the change amount determination unit 105 determines multiple allowable change amounts according to the multiple priorities acquired by the priority acquisition unit 101. Furthermore, the allowable change amount decreases as the priority increases.

[0071] Furthermore, if no priority is set for the transport route, the change amount determination unit 105 determines the allowable change amount for the transport route to be infinite or a value greater than the warehouse capacity.

[0072] The optimization processing unit 106 optimizes the amount of goods transported along the transport route and the amount of goods in stock at the warehouse based on the demand quantity acquired by the demand information acquisition unit 102, the route information acquired by the route information acquisition unit 103, the cost information acquired by the cost information acquisition unit 104, and the allowable change amount determined by the change amount determination unit 105.

[0073] Figure 3 is a diagram illustrating the optimization process performed by the optimization processing unit 106 in this embodiment.

[0074] The optimization processing unit 106 determines the warehouse capacity at site i to be W ｉ Let v be the temporary warehouse capacity for the period t to store goods at location i in excess of the warehouse capacity. ｉ Let [t] be the cost of constructing the warehouse, and c ｗ And warehouse operating costs are c ｏ And the warehouse temporary excess costs are c ｖ Let's assume that the amount of inventory at location i during period t is s ｉ Let [t] be the transport volume during period t on the transport route heading to base i, and p ｉ Let [t] be the amount of demand at base i during period t, and D ｉ Let [t] be the limit function f shown in equation (6) below, and let the allowable change be ε. Then, p must be minimized while satisfying the constraints shown in equations (7) to (10) below. ｉ [t] and s ｉ [t] and W ｉ and v ｉ Calculate [t].

[0075] f = W ｉ *c ｗ +W ｉ *c ｏ *t + Σv ｉ [t] *c ｖ ... (6) s ｉ [t] ≤ W ｉ +v ｉ [t]...(7) v ｉ [t]≧0...(8) s ｉ [t]-s ｉ [t-1] = p ｉ [t-1]-D ｉ[t-1]...(9) |p ｉ [t]-p ｉ [t-1]|≦ε...(10)

[0076] Constraint equation (7) indicates that the inventory quantity is less than or equal to the sum of the warehouse capacity and the temporary warehouse capacity. Constraint equation (8) indicates that the temporary warehouse capacity is 0 or greater. Constraint equation (9) indicates that the warehouse flow rate is preserved. That is, constraint equation (9) indicates that the value obtained by subtracting the inventory quantity in period t-1 from the inventory quantity in period t is equal to the value obtained by subtracting the demand quantity in period t-1 from the transport quantity in period t-1. Constraint equation (10) indicates a constraint condition regarding the stability of transport quantity. That is, constraint equation (10) indicates that the absolute value of the value obtained by subtracting the transport quantity in period t-1 from the transport quantity in period t is less than or equal to the allowable change.

[0077] Also, for example, warehouse construction cost c ｗ The value is 1, and the warehouse operating cost is c. ｏ The value is 0.2, and the warehouse temporary excess cost c ｖ It is 1.3.

[0078] Furthermore, if base i is a demand area, the optimization processing unit 106 calculates the demand quantity D for base i during period t, which is obtained by the demand information acquisition unit 102. ｉ [t] is used. On the other hand, if base i is a relay base, the optimization processing unit 106 calculates the demand D during period t as the sum of at least one transport volume transported from base i to the next at least one base j. ｉ Used as [t]

[0079] Figure 4 is a diagram illustrating the calculation of the demand volume for each location when there are multiple locations in this embodiment.

[0080] The logistics network shown in Figure 4 includes a supply point A, a rear transit point A, a forward transit point A, a forward transit point B, a demand point A, a demand point B, and a demand point C. First, goods are transported from supply point A to rear transit point A. Goods transported to rear transit point A are then transported from rear transit point A to forward transit points A and B. Goods transported to forward transit point A are then transported from forward transit point A to demand point A. Goods transported to forward transit point B are then transported from forward transit point B to demand points B and C. Goods transported to demand point A are sold to consumer A. Goods transported to demand point B are sold to consumer B. Goods transported to demand point C are sold to consumer C.

[0081] The optimization processing unit 106 calculates the demand amount D at relay stations other than the demand area based on the following equation (11). ｉ Calculate.

[0082] D ｉ = Σ ｊ R(i,j)*p ｊ ... (11)

[0083] In equation (11) above, R(i,j) represents the element (i,j) of the adjacency matrix R included in the route information, where i represents the base number and j represents the base number connected to the i-th base. If a transport route exists from base i to base j, the element (i,j) of the adjacency matrix R is 1, and if there is no transport route from base i to base j, the element (i,j) of the adjacency matrix R is 0. Also, in equation (11) above, p ｊ This represents the transport volume at the j-th station, which is the next station after the i-th station, i.e., the transport volume along the transport route from station i to station j.

[0084] For example, the adjacency matrix R of the logistics network shown in Figure 4 is expressed by the following equation (12).

[0085]

[0086] The rows and columns of the adjacency matrix R correspond to the sets of supply points, bases, and consumers. The rows and columns of the adjacency matrix R shown in the above formula (12) are arranged in the order of supply point A, rear relay base point A, front relay base point A, front relay base point B, demand point A, demand point B, demand point C, consumer A, consumer B, and consumer C.

[0087] For example, the transportation volume p ｉ ２，Ａ [t] of demand point A is calculated using the demand volume D ｉ Ａ [t], and the transportation volume p ｉ ２，Ｂ [t] of demand point B is calculated using the demand volume D ｉ Ｂ [t], and the transportation volume p ｉ ２，Ｃ [t] of demand point C is calculated using the demand volume D ｉ Ｃ [t].

[0088] For example, the transportation volume p ｉ １，Ａ [t] of front relay base point A is calculated using the transportation volume p ｉ ２，Ａ [t] as the demand volume D ｉ [t]. Also, for example, the transportation volume p ｉ １，Ｂ [t] of front relay base point B is calculated using the sum of the transportation volume p ｉ ２，Ｂ [t] and the transportation volume p ｉ ２，Ｃ [t] as the demand volume D ｉ [t]. Also, for example, the transportation volume p ｉ ０ [t] of rear relay base point A is calculated using the sum of the transportation volume p ｉ １，Ａ [t] and the transportation volume p ｉ １，Ｂ [t] as the demand volume D ｉ [t].

[0089] If there is a first base, a second base to which goods are transported from the first base, and a third base to which goods are transported from the first base, the demand at the first base is replaced by the sum of the first transport volume on the first transport route connecting the first base and the second base, and the second transport volume on the second transport route connecting the first base and the third base. For example, the demand D at forward relay base B. ｉ [t] is the first transport volume p in the first transport route connecting forward relay station B and demand area B. ｉ ２，Ｂ [t] and the second transport volume p in the second transport route connecting forward relay station B and demand area C ｉ ２，Ｃ It can be replaced with the sum of [t] and [t].

[0090] If there are multiple locations, the optimization processing unit 106 optimizes the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations in the order from the demand location to the supply location. The number i representing each location is assigned in order from the location closest to the supply location. For example, the number i representing supply location A is 0, the number i representing back-end relay location A is 1, the number i representing forward relay location A is 2, the number i representing forward relay location B is 3, the number i representing demand location A is 4, the number i representing demand location B is 5, the number i representing demand location C is 6, the number i representing consumer A is 7, the number i representing consumer B is 8, and the number i representing consumer C is 9. The optimization processing unit 106 optimizes the locations in order from the location with the largest number i value, p ｉ [t] and s ｉ [t] and W ｉ and v ｉ [t] is calculated recursively. For example, in the logistics network shown in Figure 4, the transport volume p at each location is calculated in the order of demand location C, demand location B, demand location A, forward relay location B, forward relay location A, and rear relay location A. ｉ [t], stock amount s ｉ [t], warehouse capacity W ｉ , and temporary warehouse capacity v ｉ [t] is calculated.

[0091] The optimization processing unit 106 outputs the optimized transport volume and inventory volume to the communication unit 13. The communication unit 13 transmits the transport volume and inventory volume optimized by the optimization processing unit 106 to the terminal 20. The communication unit 24 of the terminal 20 receives the transport volume and inventory volume transmitted by the server 10. The processor 22 displays the transport volume and inventory volume received by the communication unit 24 on the display unit 23. The display unit 23 displays the transport volume and inventory volume. The display unit 23 displays the transport volume and inventory volume at predetermined intervals. The display unit 23 may also display the transport volume and inventory volume along with the logistics network, including supply locations, bases, and consumers.

[0092] Furthermore, if there are multiple locations, the optimization processing unit 106 outputs the optimized transport volume and inventory volume for each of the multiple locations to the communication unit 13. The communication unit 13 transmits the optimized transport volume and inventory volume for each of the multiple locations to the terminal 20. The communication unit 24 of the terminal 20 receives the transport volume and inventory volume for each of the multiple locations transmitted by the server 10. The processor 22 displays the transport volume and inventory volume for each of the multiple locations received by the communication unit 24 on the display unit 23. The display unit 23 displays the transport volume and inventory volume for each of the multiple locations. The display unit 23 displays the transport volume and inventory volume for each of the multiple locations at predetermined intervals. The display unit 23 may also display the transport volume and inventory volume for each of the multiple locations along with the logistics network, including the supply location, locations, and consumers.

[0093] The optimization processing unit 106 may further output the optimized warehouse capacity. The optimization processing unit 106 may output the optimized transport volume, inventory volume, and warehouse capacity to the communication unit 13. The communication unit 13 may transmit the transport volume, inventory volume, and warehouse capacity optimized by the optimization processing unit 106 to the terminal 20. The communication unit 24 of the terminal 20 may receive the transport volume, inventory volume, and warehouse capacity transmitted by the server 10. The processor 22 may display the transport volume, inventory volume, and warehouse capacity received by the communication unit 24 on the display unit 23. The display unit 23 may display the transport volume, inventory volume, and warehouse capacity. The display unit 23 may also display the transport volume and inventory volume at predetermined intervals, as well as the warehouse capacity. The display unit 23 may also display the transport volume, inventory volume, and warehouse capacity along with the logistics network, including supply locations, bases, and consumers.

[0094] Furthermore, if there are multiple locations, the optimization processing unit 106 may output the optimized transport volume, inventory volume, and warehouse capacity for each of the multiple locations to the communication unit 13. The communication unit 13 may transmit the optimized transport volume, inventory volume, and warehouse capacity for each of the multiple locations to the terminal 20. The communication unit 24 of the terminal 20 may receive the transport volume, inventory volume, and warehouse capacity for each of the multiple locations transmitted by the server 10. The processor 22 may display the transport volume, inventory volume, and warehouse capacity for each of the multiple locations received by the communication unit 24 on the display unit 23. The display unit 23 may display the transport volume, inventory volume, and warehouse capacity for each of the multiple locations. The display unit 23 may also display the transport volume and inventory volume for each of the multiple locations at predetermined intervals, as well as the warehouse capacity for each of the multiple locations. In addition, the display unit 23 may display the transport volume, inventory volume, and warehouse capacity for each of the multiple locations along with the logistics network, including the supply locations, locations, and consumers.

[0095] Furthermore, the optimization processing unit 106 may output the optimized temporary warehouse capacity. The optimization processing unit 106 may output the optimized transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity to the communication unit 13. The communication unit 13 may transmit the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity optimized by the optimization processing unit 106 to the terminal 20. The communication unit 24 of the terminal 20 may receive the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity transmitted by the server 10. The processor 22 may display the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity received by the communication unit 24 on the display unit 23. The display unit 23 may display the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity at predetermined intervals, as well as display the warehouse capacity. Furthermore, the display unit 23 may also display the logistics network, including the supply location, base, and consumer, as well as the volume of goods transported, the amount of inventory, the warehouse capacity, and the temporary warehouse capacity.

[0096] Furthermore, if there are multiple locations, the optimization processing unit 106 may output the optimized transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations to the communication unit 13. The communication unit 13 may transmit the optimized transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations to the terminal 20. The communication unit 24 of the terminal 20 may receive the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations transmitted by the server 10. The processor 22 may display the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations received by the communication unit 24 on the display unit 23. The display unit 23 may display the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple locations at predetermined intervals, as well as display the warehouse capacity for each of the multiple locations. Furthermore, the display unit 23 may also display the logistics network, including the supply location, base, and consumer, along with the transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity for each of the multiple bases.

[0097] Figure 5 is a flowchart illustrating the information processing performed by the server 10 in the embodiment of this disclosure.

[0098] First, in step S1, the priority acquisition unit 101 acquires at least one priority set for at least one transportation route connecting at least one supply location and at least one base. The priority acquisition unit 101 acquires at least one priority entered by the user.

[0099] Next, in step S2, the demand information acquisition unit 102 acquires the amount of goods in demand for a predetermined period at at least one demand location among the at least one base from the demand information storage unit 201. If the at least one base includes multiple demand locations, the demand information acquisition unit 102 acquires the amount of goods in demand for a predetermined period at each of the multiple demand locations. The predetermined period is, for example, one month. For example, the demand information acquisition unit 102 may acquire the amount of goods in demand for a predetermined period at least one demand location for each month over the past year.

[0100] Next, in step S3, the route information acquisition unit 103 acquires route information from the route information storage unit 202 that shows the transportation route from the supply location to the consumer.

[0101] Next, in step S4, the cost information acquisition unit 104 acquires cost information indicating the costs related to the warehouse from the cost information storage unit 203.

[0102] Next, in step S5, the change amount determination unit 105 determines at least one allowable change amount of transport volume to be allowed in at least one transport route, according to at least one priority obtained by the priority acquisition unit 101.

[0103] Next, in step S6, the optimization processing unit 106 optimizes the amount of goods transported on at least one transport route leading to at least one base, the amount of goods stockpiled in the warehouse of at least one base, the warehouse capacity of at least one base, and the temporary warehouse capacity of at least one base, based on the demand quantity acquired by the demand information acquisition unit 102, the route information acquired by the route information acquisition unit 103, the cost information acquired by the cost information acquisition unit 104, and the allowable change amount determined by the change amount determination unit 105.

[0104] Next, in step S7, the optimization processing unit 106 outputs the optimized transport volume and inventory volume. The optimization processing unit 106 may also output the optimized transport volume, inventory volume, and warehouse capacity. Alternatively, the optimization processing unit 106 may output the optimized transport volume, inventory volume, warehouse capacity, and temporary warehouse capacity.

[0105] In this way, a priority is obtained for the transportation route connecting the source of goods and the location where the goods are stored in a warehouse, indicating the degree to which the transportation volume along the route should be stabilized. The allowable change in the transportation volume along the route is determined according to the priority. Then, based on the demand, route information, cost information, and allowable change, the transportation volume of goods along the route and the inventory level of goods in the warehouse are optimized.

[0106] Therefore, by optimizing the volume of goods transported along the transport route and the inventory level of goods in the warehouse so that the change in transport volume along the transport route is less than or equal to the allowable change, the volume of goods transported along the transport route can be stabilized. Furthermore, by stabilizing the transport volume, the employment of transporters can be stabilized. In addition, inventory placement that takes into account the stabilization of transport volume can be achieved.

[0107] Furthermore, since transportation plans and inventory placement plans are created simultaneously, the number of computer processing steps required to create these plans can be reduced, thereby lessening the burden on the computer.

[0108] Users may prioritize transportation routes where securing carriers is difficult. However, prioritizing these routes to stabilize transportation volume will also increase inventory levels at the distribution points. Therefore, users should determine priorities by comparing inventory levels with transportation volume. Users may also adjust the priority of transportation routes based on the output results of transportation volume and inventory levels. For example, lowering the priority of a distribution point with high inventory levels can reduce inventory levels.

[0109] Figure 6 shows an example of the display screen 501 displayed on the display unit 23 when the priority of the transportation route to the relay point is level 1 and the priority of the transportation route to the demand area is level 2.

[0110] The inventory and transport volumes shown in Figure 6 represent the inventory and transport volumes for periods t, t-1, t-2, t-3, t-4, t-5, t-6, and t-7, respectively, from top to bottom. Period t is, for example, one month. For example, period t is January 2024, period t-1 is December 2023, period t-2 is November 2023, period t-3 is October 2023, period t-4 is September 2023, period t-5 is August 2023, period t-6 is July 2023, and period t-7 is June 2023.

[0111] If the priority of the transport route to the relay point is level 1, the change amount determination unit 105 determines the allowable change amount ε of the transport route to the relay point. Ａ This is determined to be 0, which is 0% of the current warehouse capacity. The current warehouse capacity is, for example, 2500. Also, if the priority of the transportation route to the demand area is level 2, the change amount determination unit 105 determines the allowable change amount ε of the transportation route to the demand area. Ｂ We will set this at 250, which is 10% of the current warehouse capacity.

[0112] In the transport route to the relay station, the allowable change amount ε Ａ Since it is 0, the stability of the transport volume is ensured, and the transport volume is 1750 for the entire period. On the other hand, in the transport route to the demand area, the allowable change amount ε Ｂ Since the value is 250, the stability of the transport volume is gradually ensured, and the change in transport volume is kept below 250 for all periods.

[0113] In this way, by setting a higher priority for rear-end hubs (transit points) than for forward hubs (demand points), a gradual and gradual stability is ensured at each transportation route. Furthermore, inventory levels at both rear-end hubs (transit points) and forward hubs (demand points) are leveled out, and excess warehouse capacity is suppressed. In addition, it is possible to respond to sudden fluctuations in demand.

[0114] Figure 7 shows an example of the display screen 502 that is displayed on the display unit 23 when the priority of the transportation route to the relay point is level 1 and the priority of the transportation route to the demand area is level 1.

[0115] The inventory and transport volumes shown in Figure 7 represent the inventory and transport volumes for periods t, t-1, t-2, t-3, t-4, t-5, t-6, and t-7, respectively, from top to bottom. Period t is, for example, one month. For example, period t is January 2024, period t-1 is December 2023, period t-2 is November 2023, period t-3 is October 2023, period t-4 is September 2023, period t-5 is August 2023, period t-6 is July 2023, and period t-7 is June 2023.

[0116] If the priority of the transport route to the relay point is level 1, the change amount determination unit 105 determines the allowable change amount ε of the transport route to the relay point. Ａ This is determined to be 0, which is 0% of the current warehouse capacity. Also, if the priority of the transportation route to the demand area is level 1, the change amount determination unit 105 determines the allowable change amount ε of the transportation route to the demand area. Ｂ This is set to 0, which is 0% of the current warehouse capacity.

[0117] In the transport route to the relay station, the allowable change amount ε Ａ Since is 0, the stability of the transport volume is ensured, and the transport volume is 1833 for the entire period. Similarly, in the transport route to the demand area, the allowable change ε Ｂ Since it is 0, the stability of the transport volume is ensured, and the transport volume is 1833 for the entire period.

[0118] In this way, by setting the priority of both the rear hubs (transit points) and the forward hubs (demand points) to the highest level, stability is ensured along each transportation route. Furthermore, since inventory is located at the forward hubs (demand points), if demand fluctuates rapidly, adjustments must be made in transportation at the forward hubs (demand points).

[0119] Figure 8 shows an example of the display screen 503 that is displayed on the display unit 23 when the priority of the transportation route to the relay point is level 1 and no priority has been set for the transportation route to the demand area.

[0120] The inventory and transport volumes shown in Figure 8 represent the inventory and transport volumes for periods t, t-1, t-2, t-3, t-4, t-5, t-6, and t-7, respectively, from top to bottom. Period t is, for example, one month. For example, period t is January 2024, period t-1 is December 2023, period t-2 is November 2023, period t-3 is October 2023, period t-4 is September 2023, period t-5 is August 2023, period t-6 is July 2023, and period t-7 is June 2023.

[0121] If the priority of the transport route to the relay point is level 1, the change amount determination unit 105 determines the allowable change amount ε of the transport route to the relay point. Ａ This is determined to be 0, which is 0% of the current warehouse capacity. Also, if no priority is set for the transportation route to the demand area, the change amount determination unit 105 determines the allowable change amount ε of the transportation route to the demand area. Ｂ We will set the capacity at 10,000, which is sufficiently larger than the current warehouse capacity.

[0122] In the transport route to the relay station, the allowable change amount ε Ａ Since it is 0, the stability of the transport volume is ensured, and the transport volume is 1800 for the entire period. On the other hand, in the transport route to the demand area, the allowable change amount ε Ｂ Since the value is 10,000, the stability of the transport volume is not ensured, and the amount of change in the transport volume is not constant throughout the entire period.

[0123] In this way, by setting the priority of only the rear-end hubs (transit points) to the highest level, inventory is placed at these hubs. This allows for temporary increases or decreases in transport volume in the event of sudden fluctuations in demand. In this case, the stability of the rear-end hubs (transit points) is ensured, but the stability of the forward hubs (demand points) is not.

[0124] In this embodiment, the stability of the transport volume is ensured by reducing the change between the transport volume in period t and the transport volume in period t-1. However, this disclosure is not limited to this, and the stability of the transport volume may also be ensured by considering the periodicity of employment, such as hiring at predetermined intervals.

[0125] Figure 9 shows an example of the display screen 504 displayed on the display unit 23 when the priority of the transport route to the relay point is level 1, the priority of the transport route to the demand area is level 3, and the fluctuation period is set to 4.

[0126] The inventory and transport volumes shown in Figure 8 represent the inventory and transport volumes for periods t, t-1, t-2, t-3, t-4, t-5, t-6, and t-7, respectively, from top to bottom. Period t is, for example, one day. For example, period t is January 31, 2024, period t-1 is January 30, 2024, period t-2 is January 29, 2024, period t-3 is January 28, 2024, period t-4 is January 27, 2024, period t-5 is January 26, 2024, period t-6 is January 25, 2024, and period t-7 is January 24, 2024.

[0127] If the priority of the transport route to the relay point is level 1, the change amount determination unit 105 determines the allowable change amount ε of the transport route to the relay point. Ａ The current warehouse capacity is set to 0, which is 0% of the current warehouse capacity. The current warehouse capacity is, for example, 2500. Also, if the priority of the transportation route to the demand area is level 3, the change amount determination unit 105 determines the allowable change amount ε of the transportation route to the demand area. Ｂ The current warehouse capacity is set to 500, which is 20% of the current warehouse capacity. Also, the fluctuation period of the relay point x Ａ and the fluctuation period x of the demand area Ｂ It is the 4th.

[0128] In this case, the optimization processing unit 106 uses the constraint condition of equation (13) below instead of the constraint condition of equation (10) above.

[0129] |p ｉ [t]-p ｉ [t-x ｉ ] | ≤ ε ... (13)

[0130] In the above equation (13), x ｉ x indicates the fluctuation period that ensures stability. For example, if the transport volume is to be stabilized every four days, x ｉ The answer is 4.

[0131] In this way, the priority of the rear bases (transit points) is set higher than the priority of the forward bases (demand points), and the fluctuation period for both the rear bases (transit points) and forward bases (demand points) is set to four days. As a result, stability is ensured in the transportation routes of the rear bases (transit points) with a four-day cycle. Furthermore, a gradual stability is also ensured in the transportation routes of the forward bases (demand points) with a four-day cycle.

[0132] Furthermore, some or all of the functions of the apparatus according to the embodiments of this disclosure may be realized by a processor such as a CPU executing a program.

[0133] Furthermore, all figures used above are illustrative examples provided to illustrate this disclosure, and this disclosure is not limited to these illustrative figures.

[0134] Furthermore, the order in which the steps shown in the flowchart above are performed is illustrative for the purpose of specifically illustrating this disclosure, and other orders are acceptable as long as similar effects are achieved. Also, some of the steps above may be performed simultaneously (in parallel) with other steps.

[0135] The technology described herein can stabilize the volume of goods transported along the transport route, and is therefore useful as a technology for simultaneously creating a transport plan for transporting goods from the supply source to the base and an inventory placement plan for storing goods at the base.

Claims

1. An information processing method performed by a computer, comprising: obtaining a priority indicating the degree to which the amount of goods transported along a transport route is stabilized, set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is located; obtaining the amount of demand for the goods at predetermined intervals; obtaining route information indicating the transport route; obtaining cost information indicating the costs related to the warehouse; determining an allowable amount of change in the amount of goods transported along the transport route according to the priority; optimizing the amount of goods transported along the transport route and the amount of inventory of the goods in the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and outputting the optimized amount of goods transported and the amount of inventory.

2. The information processing method according to claim 1, wherein the supply location includes at least one supply location, the base includes at least one demand location for the goods and at least one transit base located between the at least one supply location and the at least one demand location, and the transport route includes a plurality of transport routes connecting each of the at least one supply location, the at least one transit base, and the at least one demand location.

3. The information processing method according to claim 1, wherein the optimization of the transport volume and the inventory volume includes further optimizing the warehouse capacity required for the warehouse, and the output of the transport volume and the inventory volume includes further outputting the optimized warehouse capacity.

4. The information processing method according to claim 1, wherein the acquisition of the demand quantity includes acquiring the demand quantity for each predetermined period in the past.

5. The information processing method according to claim 1, wherein the acquisition of the demand quantity includes acquiring the demand quantity for each predetermined period in the future.

6. The cost information includes a warehouse construction cost indicating the cost required to construct the warehouse, a warehouse operation cost indicating the cost required to operate the warehouse, and a temporary warehouse excess cost indicating the cost required to store the articles temporarily exceeding the required warehouse capacity. The optimization of the transportation volume and the inventory quantity is such that the warehouse capacity at the base i is W ｉ is represented as, and the temporary warehouse capacity during the period t for storing the articles temporarily exceeding the warehouse capacity at the base i is v ｉ is represented as [t], the warehouse construction cost is c ｗ is represented as, the warehouse operation cost is c ｏ is represented as, the temporary warehouse excess cost is c ｖ is represented as, the inventory quantity during the period t at the base i is s ｉ is represented as [t], the transportation volume during the period t on the transportation route towards the base i is p ｉ is represented as [t], the demand volume during the period t at the base i is D ｉ is represented as [t], and when the allowable change amount is ε, the objective function f shown in the following formula (1) calculates the p ｉ such that [t], the s ｉ such that [t], the W ｉ and the v ｉ such that [t] satisfy the constraint conditions shown in the following formulas (2) to (5) and are minimized. f = W ｉ * c ｗ + W ｉ * c ｏ * t + Σv ｉ such that [t] * c ｖ ... (1) s ｉ such that [t] ≤ W ｉ + v ｉ such that [t]... (2) v ｉ such that [t] ≥ 0... (3) s ｉ such that [t] - s ｉ such that [t - 1] = p ｉ such that [t - 1] - D ｉ such that [t - 1]... (4) |p ｉ such that [t] - p ｉ such that [t - 1]| ≤ ε... (5) The information processing method according to any one of claims 1 to 5.

7. The information processing method according to claim 6, in the case where there is a first base, a second base to which the goods are transported from the first base, and a third base to which the goods are transported from the first base, the demand at the first base is replaced with the sum of the first transport volume on the first transport route connecting the first base and the second base and the second transport volume on the second transport route connecting the first base and the third base.

8. The information processing method according to any one of claims 1 to 5, wherein the allowable amount of change decreases as the priority increases.

9. When multiple locations exist, the optimization of the transport volume and the inventory volume includes optimizing the transport volume and the inventory volume for each of the multiple locations in the order from the demand location to the supply location. This is the information processing method according to any one of claims 1 to 5.

10. An information processing device comprising a processor, wherein the processor acquires a priority indicating the degree to which the amount of goods transported along a transport route is stabilized, which is set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is provided; acquires the amount of goods in demand for each predetermined period; acquires route information indicating the transport route; acquires cost information indicating the costs related to the warehouse; determines the allowable amount of change in the amount of goods transported along the transport route according to the priority; optimizes the amount of goods transported along the transport route and the amount of goods in stock at the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and outputs the optimized amount of goods transported and the amount of stock.

11. An information processing program that obtains a priority indicating the degree to which the amount of goods transported along a transport route is stabilized, set for a transport route connecting a place of supply of goods and a base where a warehouse for storing the goods is located; obtains the amount of demand for the goods at predetermined intervals; obtains route information indicating the transport route; obtains cost information indicating the costs related to the warehouse; determines the allowable amount of change in the amount of goods transported along the transport route according to the priority; optimizes the amount of goods transported along the transport route and the amount of goods in stock at the warehouse based on the amount of demand, the route information, the cost information, and the allowable amount of change; and causes a computer to function to output the optimized amount of goods transported and the amount of stock.

Images