Plan creation device, plan creation method and program

The planning device groups articles by attributes to create efficient transportation plans, addressing the inefficiencies in existing techniques by appropriately placing items in storage areas despite known attributes, thereby reducing calculation load.

JP2024162383APending Publication Date: 2024-11-21NIPPON STEEL CORPORATION
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2023077828
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-10
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Existing transportation planning techniques fail to account for the specific attributes of steel materials such as size and weight when determining storage locations, leading to inefficient and inappropriate placement of items in storage areas.

Method used

A planning device that groups articles based on their attributes and calculates a transportation plan using article restriction information, grouping units, and calculation units to specify transportation plans for specific storage areas, reducing the need to process each item individually and minimizing calculation load.

Benefits of technology

The solution allows for the creation of a transportation plan that appropriately places items in storage areas, reducing calculation load and ensuring efficient transportation even when attributes are determined for each storage location.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024162383000001_ABST
    Figure 2024162383000001_ABST
Patent Text Reader

Abstract

To properly place articles in respective sections in a storage space even when attributes of articles which can be placed are determined by a plurality of sections in the storage space.SOLUTION: A plan creation device 100 groups a plurality of coils to be planned based upon storage space restriction information 300 and coil attribute information 420, and calculates first coil conveyance information (an amount xi,j,p,t of conveyance to a quay warehouse 230) for specifying conveyance plans of coils from addresses 231a to 231c by at least parts of the same group.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a plan creation device, a plan creation method, and a program. [Background technology]

[0002] Patent Documents 1 and 2 disclose techniques for determining in which of a plurality of divided zones in a storage yard an article is to be placed when the article is transported to the storage yard.

[0003] Patent Document 1 discloses that the allocation of steel materials at each address on a daily basis is calculated so as to reduce the difference in the allocation state of steel materials at adjacent addresses in a yard.

[0004] Patent document 2 discloses that the transport route for each steel material is calculated so as to increase the proportion of steel materials passing through the main transport route for each lot (the transport route through which the largest number of steel materials pass among the transport routes through which steel materials belonging to a lot pass) from the time the steel materials are received in a yard from an upstream process to the time they are discharged to a downstream process. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2004-303176 A [Patent Document 2] JP 2010-254429 A Summary of the Invention [Problem to be solved by the invention]

[0006] However, the techniques described in Patent Documents 1 and 2 are based on the premise that each address can accept steel materials with any attributes, regardless of the attributes of the steel materials, such as size and weight. In other words, the attributes of steel materials that can be placed are not specified for each address, and every address is a candidate destination for each steel material. Therefore, if the attributes of items that can be placed are specified for each storage area, there is a risk that a transportation plan will be created that does not allow items to be placed appropriately in each storage area.

[0007] The present invention has been made in consideration of the above-mentioned problems, and aims to make it possible to create a transportation plan that can appropriately transport items to each storage location, even when the attributes of the items that can be placed there are determined for each storage location. [Means for solving the problem]

[0008] The plan creation device of the present invention is a plan creation device that creates a transportation plan for multiple items, and is equipped with a grouping unit that groups the multiple items based on item constraint information for identifying the attributes of items that can be placed in each of multiple first storage locations and item attribute information for identifying the attributes of the multiple items that are the subject of the transportation plan, and a calculation unit that calculates transportation plan identification information for identifying the transportation plan, and the transportation plan identification information includes first item transportation information for identifying the transportation plan for the items to the first storage locations for at least a portion of the same group.

[0009] The planning method of the present invention is a planning method for creating a transportation plan for a plurality of items, and includes a grouping process for grouping the plurality of items based on item constraint information for identifying attributes of items that can be placed in each of a plurality of first storage locations and item attribute information for identifying attributes of the plurality of items that are the subject of the transportation plan, and a calculation process for calculating transportation plan identification information for identifying the transportation plan, wherein the transportation plan identification information includes first item transportation information for identifying a transportation plan for the items to the first storage locations for at least a portion of the same group.

[0010] The program of the present invention causes a computer to function as each unit of the plan creation device. Effect of the Invention

[0011] According to the present invention, even if the attributes of the items that can be placed in each storage location are determined, it is possible to create a transport plan that can transport items appropriately to each storage location. [Brief description of the drawings]

[0012] [Figure 1] FIG. 2 is a diagram illustrating an example of a functional configuration of a plan creation device. [Diagram 2] FIG. 1 is a diagram showing a specific example of a route through which an article passes (logistics). [Diagram 3] FIG. 11 is a diagram showing an example of parking space restriction information. [Figure 4] FIG. 11 is a diagram illustrating an example of coil information. [Diagram 5] FIG. 11 is a diagram illustrating an example of grouping information. [Figure 6] FIG. 11 is a diagram illustrating an example of a target accumulated transport amount. [Figure 7] 11 is a diagram showing an example of a warehouse initial inventory amount, a shipping line warehouse inventory amount, and a warehouse inventory upper limit amount. FIG. [Figure 8] 13 is a diagram showing an example of an upper limit of inventory on a shipping line, a maximum amount of inventory to be transported to a quay warehouse, and a maximum amount of inventory to be transported to a shipping ship. [Figure 9] FIG. 11 is a diagram illustrating an example of a weighting coefficient. [Figure 10] FIG. 13 is a diagram showing an example of an accounted amount. [Figure 11] FIG. 13 is a diagram showing an example of a possible negation number of a parking space. [Figure 12] FIG. 13 is a diagram showing an example of an optimal solution for the amount of delayed shipments and the amount of early loading. [Figure 13] FIG. 13 is a diagram illustrating an example of an optimal solution for warehouse inventory. [Figure 14] 11 is a flowchart illustrating an example of a plan creation method. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. In addition, the term "compared objects" including length, position, size, spacing, etc., being the same includes not only objects that are strictly the same, but also objects that are different within the scope of the invention (for example, objects that differ within the tolerance range determined at the time of design).

[0014] 1 is a diagram showing an example of a functional configuration of the plan creation device 100. The hardware of the plan creation device 100 is realized, for example, by using an information processing device including a processor, a main storage device, an auxiliary storage device, and various user interfaces. In addition, the plan creation device 100 may be realized by a PLC (Programmable Logic Controller) or dedicated hardware such as an ASIC (Application Specific Integrated Circuit).

[0015] The plan creation device 100 creates a transportation plan for a plurality of items. The plan creation device 100 calculates transportation plan specification information for specifying the transportation plan. The transportation plan is a plan that determines the transportation time (timing) of the planned items in the planning period, and the transportation source and the transportation destination of the items to be transported at each transportation time. The planned items are transported to one of the first storage yard among the plurality of first storage yard. In the transportation plan, at least the items to be transported to the first storage yard are specified. It is assumed that the attributes of the items that can be placed in the plurality of first storage yard are determined. The attribute of the item is, for example, at least one of the size and weight of the item. Therefore, there may be a storage yard among the first storage yard that cannot be a candidate for the transportation destination of the item.

[0016] Furthermore, the items to be planned are not limited. The items to be planned may be, for example, finished products (including semi-finished products) or raw materials. However, in order to make the explanation easier to understand, an example of the functions of the plan creation device 100 will be explained using a specific example of an item. Therefore, before explaining an example of the functions of the plan creation device 100, a specific example of the route (logistics) of the items will be explained. Note that a semi-finished product is a product that is manufactured in an upstream factory of a manufacturer before becoming a final product (a product shipped to the manufacturer's customer).

[0017] <Specific examples of goods transit routes (logistics)> FIG. 2 is a diagram showing a specific example of a route through which an article passes (physical distribution). In FIG. 2, the hot rolling line 210 performs hot rolling on a steel material such as a coil to manufacture a hot rolled coil (a hot rolled steel sheet wound into a coil shape). The hot rolled coil is transported to the shipping line 220 and made ready for shipment (ready to be transported to the quay warehouse 230). For example, packaging is performed on the shipping line 220. Packaging may also be performed on the shipping line 220 after refinement (cutting, etc.) and pickling. In the following description, the hot rolled coil ready for shipment (ready to be transported to the quay warehouse 230) is abbreviated to coil as necessary. The coil being ready for shipment (ready to be transported to the quay warehouse 230) on the shipping line 220 is referred to as accounting as necessary. Note that in this embodiment, a case is illustrated in which the attributes of the goods that can be placed in the coil storage areas 221a to 221b on the shipping line 220 are not defined. Furthermore, the number of coil storage areas 221a to 221b on the shipping line 220 may be one or more.

[0018] The recorded coils are transported from the shipping line 220 to the quay warehouse 230. The coil storage areas 231a to 231c in the quay warehouse 230 are divided into areas by address. The addresses serve as information (addresses) for uniquely identifying the coil storage areas 231a to 231c in the quay warehouse 230. In FIG. 2, there are three storage areas 231a to 231c in the quay warehouse 230, and different addresses are assigned to the storage areas 231a to 231c. The attributes of the coils that can be stored in the storage areas 231a to 231c at each address, such as the weight and outer diameter of the coil, are determined for the storage areas 231a to 231c at each address. In the following description, the storage area at the address will be abbreviated to the address as necessary. The number of storage areas in the quay warehouse 230 is not limited to three, as long as it is two or more.

[0019] The coils transported to the quay warehouse 230 are transported (loaded) to a shipping ship 240 and shipped. In this embodiment, a case is exemplified in which the attributes of the goods that can be placed in the coil storage area 241 on the shipping ship 240 are not defined. However, the attributes of the goods that can be placed in the coil storage area 241 on the shipping ship 240 may be defined. In addition, the number of shipping ships 240 may be one, or two or more. When there are multiple shipping ships 240, the coils are transported to one of the multiple shipping ships 240. In addition, the number of coil storage areas 241 on the shipping ship 240 may be one, or multiple. In this embodiment, a case is exemplified in which there are two shipping ships 240, and each shipping ship 240 has one coil storage area 241. Therefore, transporting the coils to the shipping ship 240 is equivalent to transporting the coils to the coil storage area 241 on the shipping ship 240. Therefore, in the following description, it is assumed that the destination of the goods from the quay warehouse 230 is the shipping ship 240.

[0020] As described above, in this embodiment, the case where the goods are coils and the multiple (three in FIG. 2) addresses 231a-231c are each a first yard is exemplified. Also, in this embodiment, the case where the shipping ships 240 (yards 241) are each a second yard and the multiple yards 221a-221b for coils on the shipping line 220 are each a third yard is exemplified. However, as described above, the goods are not limited to coils. Also, the yard where the goods are placed, including the first yard, is determined according to the place where the goods pass through and is not limited to the yard 221a-221b, 231a-231c, and 241 shown in FIG. 2.

[0021] <Summary> Next, an overview of an example of the functions of the plan creation device 100 of this embodiment will be described. As described above, the attributes of the coils that can be placed at each of the addresses 231a to 231c in the quay warehouse 230, such as the weight and outer diameter of the coils, are set. Therefore, even though the entire quay warehouse 230 has vacant spaces, a situation may arise in which a large amount of coils must be placed at only some of the addresses, and it may become necessary to transport to the address a coil that exceeds the upper limit of the amount of coils that can be placed at the address. In this case, the transport of coils from the shipping line 220 stops. In this way, when the attributes of the coils that can be placed at each address are set, it becomes extremely difficult for a person to determine the appropriate amount of coils to be transported to each address and the appropriate transport timing, compared to when they are not set. Furthermore, when these are calculated by a device, the calculation load increases when a large amount of coils are handled individually, and there is a risk that the calculation time will become enormous. The more addresses and coils there are, the more pronounced this tendency becomes.

[0022] Therefore, in this embodiment, the multiple coils to be planned are grouped based on the placement constraint information (see reference numerals 320 to 340 in FIG. 3 described later) for specifying the attributes of the coils that can be placed at each of the multiple addresses 231a to 231c, and the coil attribute information 420 (see FIG. 4 described later) for specifying the attributes of the coils to be planned. Then, as the transport plan specification information, the first coil transport information for specifying the coil transport plan to the multiple addresses 231a to 231c for at least a part of the same group is calculated. In this way, when planning the coil transport plan to the multiple addresses 231a to 231c, it is not necessary to process a large number of coils individually, and the coils are processed in groups. Therefore, the number of targets to be processed in the transport plan can be reduced, and the calculation load can be reduced. Note that, for example, the coil transport plan to the multiple addresses 231a to 231c specifies which group of coils to transport to which address among the multiple addresses 231a to 231c, at what timing, and how many coils to transport. In the present embodiment, a case will be illustrated in which the first coil transport information is the first item transport information.

[0023] Furthermore, when grouping multiple coils to be planned, if there are multiple destinations (shipping ships 240) for the coils from each of the addresses 231a to 231c, it is preferable to group the coils by destination (shipping ship 240). In this way, coils belonging to the same group can be transported to the same destination (shipping ship 240) and shipped.

[0024] Also, second coil transportation information may be calculated to specify a transportation plan for the coils from each of the addresses 231a-231c of the quay warehouse 230. In this way, it is possible to consistently create a transportation plan for the coils from the time they leave the shipping line 220 until they enter the shipping ship 240. Note that, for example, the weight to be transported from each of the addresses 231a-231c of the quay warehouse 230 at a certain timing is specified by the transportation plan for the coils from each of the addresses 231a-231c of the quay warehouse 230. In the case where there are multiple shipping ships 240, it is preferable that, for example, the total amount (weight) of coils to be transported from each of the addresses 231a-231c of the quay warehouse 230 to each of the shipping ships 240 at what timing is specified by the transportation plan for the coils from each of the addresses 231a-231c of the quay warehouse 230.

[0025] In this case, the transport plan of the coils from each of the addresses 231a-231c of the quay warehouse 230 may be specified for at least a part of the same group among the groups obtained by grouping as described above. However, the coils placed at each of the addresses 231a-231c have an attribute that allows them to be placed at that address. Therefore, in the second coil transport information, a case is illustrated in which the coils to be transported from each of the addresses 231a-231c of the quay warehouse 230 are not specified for at least a part of the same group, but are specified for each address 231a-231c. In this embodiment, a case is illustrated in which the second coil transport information is second item transport information.

[0026] It is also preferable to further calculate address inventory information for identifying the stock amount of coils at each of the addresses 231a to 231c. In this way, the stock amount of each of the addresses 231a to 231c of the quay warehouse 230 can be included in the transportation plan. In this case, the coils placed at each of the addresses 231a to 231c of the quay warehouse 230 may be identified for at least a part of the same group among the groups obtained by grouping as described above. However, the coils placed at each of the addresses 231a to 231c have an attribute that allows them to be placed at the address. Therefore, in the address inventory information, a case is illustrated in which the stock amount of coils at each of the addresses 231a to 231c is not identified for at least a part of the same group, but is identified for each of the addresses 231a to 231c. Note that the stock amount of coils at each of the addresses 231a to 231c is identified, for example, at the timing when the coils are transported. In this embodiment, a case is illustrated in which the address inventory information is the first yard inventory information.

[0027] In addition, it is preferable to calculate shipping line inventory information for identifying the inventory amount of coils that can be transported on the shipping line 220. In this way, the inventory amount of the shipping line 220 can be included in the transportation plan. In this case, the inventory amount of coils that can be transported on the shipping line 220 may be identified for at least a part of the same group among the groups obtained by grouping as described above. However, the group of coils transported from the shipping line 220 is identified by the first coil transportation information. Therefore, in this embodiment, a case is illustrated in which the inventory amount of coils that can be transported on the shipping line 220 is not identified for at least a part of the same group, but is identified as the inventory amount of the entire shipping line 220. Note that the inventory amount of coils that can be transported on the shipping line 220 is identified, for example, at the timing when the coils are transported. In this embodiment, a case is illustrated in which the shipping line inventory information is the second storage yard inventory information.

[0028] In this embodiment, the attribute of the coil that can be placed in the coil storage 241 on the shipping ship 240 is not defined. However, the attribute of the coil that can be placed in the storage 241 (the coil storage 241 on the shipping ship 240 in the example shown in FIG. 2) may be defined as the storage 241 to which the coils placed in the addresses 231a to 231c of the quay warehouse 230 are transported. In this case, the coils transported from the addresses 231a to 231c of the quay warehouse 230 may be grouped in the same manner as described above, and the coils transported to the storage 241 may be specified for at least a part of the same group. In this case, the attribute of the coil that can be placed in the coil storage 241 on the shipping ship 240 is used instead of the attribute of the coil that can be placed in the addresses 231a to 231c of the quay warehouse 230.

[0029] In addition, it is preferable to set each of the first coil transport information, the second coil transport information, the address inventory information, and the shipping line inventory information as a decision variable, and calculate an optimal solution of the decision variable by solving a mathematical programming problem (note that the mathematical programming problem is also called a mathematical optimization problem). In this way, it is possible to calculate the first coil transport information, the second coil transport information, the address inventory information, and the shipping line inventory information by evaluating evaluation indexes for the transport plan, such as the delivery date of the coil, the transport capacity of the coil from the quay warehouse 230 to the shipping ship 240, and the transport capacity of the shipping ship 240. Note that the solution method for the mathematical programming problem may be a known method according to the formulation of the mathematical programming problem, and may be linear programming, mixed integer programming, or other methods. In addition, a metaheuristic method such as a genetic algorithm may be used, or a method other than the method for solving the mathematical programming problem (for example, a machine learning model) may be used.

[0030] <Example of coil grouping method> Here, a specific example of a method for grouping coils will be described. FIG. 3 is a diagram showing an example of the yard constraint information 300. In FIG. 3, the address 310 is information for uniquely identifying the addresses 231a to 231c of the quay warehouse 230. In FIG. 3, the "p" in parentheses in the column of the address 310 corresponds to the address p shown in the section <Example of formulation in mathematical programming problem> described later. FIG. 3 illustrates a case in which the weight 320, width 330, and outer diameter 340 of the coil are defined for each of the addresses 231a to 231c as attributes of the coil that can be placed at the addresses 231a to 231c in the yard constraint information 300. In FIG. 3, only coils having attributes (coil attribute information) of the coil that satisfy all conditions of the weight 320, width 330, and outer diameter 340 (yard constraint information) of the coil associated in the same row can be placed at each address p. However, the attributes of the coil are not limited to the weight 320, width 330, and outer diameter 340. For example, the coil attributes may include the shape of the coil in addition to or instead of at least one of these. In this embodiment, a case where the storage space constraint information 300 is item constraint information is illustrated.

[0031] 4 is a diagram showing an example of the coil information 400. The coil information 400 is information on the coils that are the subject of the planning. In Fig. 4, coil number 410 is information for uniquely identifying a coil. Coil information 400 includes coil attribute information 420 for identifying the attributes of the coil. Fig. 4 illustrates an example in which the coil attribute information 420 includes the weight, width, and outer diameter of the coil as an example of the attributes of the coil to be planned. In this embodiment, an example in which the coil attribute information 420 is item attribute information is illustrated.

[0032] The coil information 400 includes a ship number 430. The ship number 430 is information for uniquely identifying the shipping ship 240 that transports the coil. In FIG. 4, the "i" in parentheses in the ship number 430 column corresponds to the ship number i shown in the section <Example of formulation in mathematical programming problem> described later. In this embodiment, a case is illustrated in which the shipping ship 240 that transports the coil is either a shipping ship 240 with a ship number 430 of "1" or a shipping ship 240 with a ship number 430 of "2". In this embodiment, a case is illustrated in which the ship number 430 is item destination information.

[0033] In addition, FIG. 4 illustrates an example in which the coil information 400 also includes a current state 440 and an accounting date 450. The current state 440 indicates the state of the coil at the time when the creation of the transportation plan is started. In this embodiment, a case is illustrated in which the current state 440 specifies whether the coil has been accounted for and where the coil that has not been accounted for is located. In FIG. 4, "Accounted for" indicates that the coil has been accounted for (the coil is ready to be shipped on the shipping line 220). Also, "Intermediate storage area A" indicates that the coil has not yet been accounted for and is in intermediate storage area A on the shipping line 220. Note that intermediate storage area A may be one of the coil storage areas 221a to 221b on the shipping line 220 shown in FIG. 2, or may be a storage area different from the storage area.

[0034] The accounting date 450 indicates the date on which the coil is accounted for. In this embodiment, for ease of explanation, a case where the coil is transported once a day is exemplified. Therefore, the accounting date 450 indicates the month and date on which the coil is accounted for (note that the accounting date 450 may be the year, month, and day). However, the timing of transporting the coil is not limited to once a day. For example, the coil may be transported multiple times a day.

[0035] Furthermore, in this embodiment, a case where the planning start timing is October 9th is exemplified. Therefore, in FIG. 4, the current status 440 of the coils with coil numbers 410 of "2" to "5" whose accounting date 450 is before October 9th becomes "already accounted for", and the accounting date 450 becomes the date when it was actually accounted for (before October 9th). On the other hand, the accounting date 450 of the coil with coil number 410 of "1" that has not been accounted for on October 9th becomes the scheduled date (after October 10th). This scheduled date may be specified by the operator or may be calculated by the plan creation device 100.

[0036] An example of a method for the plan creation device 100 to predict and calculate the accounting date 450 (scheduled date) will be described later in the section <Calculation unit 130>. Also, details of an example of how the current state 440 and the accounting date 450 are used will be described later in the section <Calculation unit 130>. 4 indicates that there is other information (this notation is the same in the other drawings). In the coil information 400, there are records for the number of coils to be planned.

[0037] FIG. 5 is a diagram showing an example of grouping information 500. The grouping information 500 is information showing the results of grouping the coils to be planned. Note that, from the viewpoint of viewability, FIG. 5 illustrates an example in which the coil attribute information 420 and the ship number 430 are included in the grouping information 500. However, since the coil attribute information 420 and the ship number 430 are included in the coil information 400, they do not need to be included in the grouping information 500.

[0038] 5, grouping information 500 includes possible placement patterns 510. Possible placement patterns 510 are information indicating whether or not coils can be placed at each of addresses 231a to 231c identified by "1," "2," and "3" shown in the address 310 column of FIG. 3. In this embodiment, a case is illustrated in which "1," "2," and "3" in the address 310 column shown in FIG. 3 are the identification numbers of addresses 231a, 231b, and 231c shown in FIG. 2, respectively. Note that "j" shown in parentheses in the possible placement patterns 510 column in FIG. 5 corresponds to possible placement pattern j shown in the section <Example of formulation in mathematical programming problem> described later.

[0039] Fig. 5 illustrates an example in which possible placement pattern 510 is represented by a combination of three pieces of 0-1 information indicating, from the left, whether or not coils can be placed at addresses 231a, 231b, and 231c with identification numbers "1," "2," and "3." Fig. 5 also illustrates an example in which the 0-1 information being "1" indicates that placement is possible, and the 0-1 information being "0" indicates that placement is not possible.

[0040] For example, in FIG. 5, the possible arrangement pattern 510 of coils whose coil numbers 410 are "1" to "3" is [1,0,0]. [1,0,0] indicates that a coil can be placed at address 231a whose identification number is "1", but cannot be placed at addresses 231b to 231c whose identification numbers are "2" and "3". The possible arrangement pattern 510 of coils whose coil number 410 is "4" is [1,1,0]. [1,0,0] indicates that a coil can be placed at addresses 231a to 231b whose identification numbers are "1" and "2", but cannot be placed at address 231c whose identification number is "3". The possible arrangement pattern 510 of coils whose coil number 410 is "5" is [1,1,1]. [1,1,1] indicates that the coil can be placed in all addresses 231a to 231c whose identification numbers are "1," "2," and "3." Note that possible arrangement patterns 510 may include other patterns (e.g., [0,1,1]), but for simplicity of explanation, this embodiment illustrates an example in which possible arrangement patterns 510 are any of [1,0,0], [1,1,0], and [1,1,1].

[0041] When the storage space constraint information 300 and the coil information 400 are determined as shown in FIG. 3 and FIG. 4, for each coil with the coil number 410, an address 310 is calculated in which the weight, width, and outer diameter included in the coil attribute information 420 are within the range of the weight 320, width 330, and outer diameter 340 included in the storage space constraint information 300, thereby calculating a possible arrangement pattern 510 for the coil (see the section on <grouping unit 120> described later).

[0042] For example, in FIG. 4, the weight (=500 kg), width (=1000 mm), and outer diameter (=2000 mm) included in the coil attribute information 420 of the coil with coil number 410 of "1" are within the ranges of weight 320 (≦500 kg), width 330 (≦2000 mm), and outer diameter 340 (≦2000 mm) defined for address 310 (address 231a shown in FIG. 2) with identification number "1" in FIG. 3, respectively.

[0043] On the other hand, in FIG. 4, the weight (=500 kg) and outer diameter (=2000 mm) included in the coil attribute information 420 of the coil having the coil number 410 of "1" are not within the ranges of the weight 320 (≦300 kg) and outer diameter 340 (≦1000 mm) defined for the address 310 (address 231b shown in FIG. 2) having the identification number of "2" in FIG. 3.

[0044] In addition, in FIG. 4, the outer diameter (=2000 mm) included in the coil attribute information 420 of the coil having the coil number 410 of "1" does not fall within the range of the outer diameter 340 (≦1000 mm) of the record having the identification number of "3" at address 310 (address 231c shown in FIG. 2) in FIG. 3.

[0045] 4, a coil with coil number 410 of "1" can be placed in address 231a with identification number "1", but cannot be placed in addresses 231b to 231c with identification numbers "2" and "3". Therefore, as described above with reference to Fig. 5, possible arrangement pattern 510 for coil with coil number 410 of "1" is [1,0,0]. Possible arrangement patterns 510 are calculated in the above manner for all coils with coil numbers 410.

[0046] In this embodiment, in FIG. 5, a case is illustrated in which coils having the same coil number 410 and the same ship number 430 and the same arrangement pattern 510 are grouped into the same group. In FIG. 5, the grouping information 500 includes a group number 520. The group number 520 is information for uniquely identifying each group obtained by grouping coils as described above. Note that in FIG. 5, the group number is shown to easily indicate which group each coil belongs to. The group number itself is not used in the formula formulated in the section <Example of formulation in mathematical programming problem> described later. In the section <Example of formulation in mathematical programming problem> described later, a case is illustrated in which a group is identified by a variable i that identifies the ship number 430 and a variable j that identifies the arrangement pattern 510.

[0047] 4 and 5, the possible arrangement patterns 510 of the coils with coil numbers 410 of "1" to "3" are the same, i.e., [1,0,0]. However, the ship number 430 (="1") of the coils with coil numbers 410 of "1" and "3" is different from the ship number 430 (="2") of the coil with coil number 410 of "2". Therefore, in FIG. 5, the group to which the coils with coil numbers 410 of "1" and "3" belong (the group with group number 520 of "1") and the group to which the coil with coil number 410 of "2" belongs (the group with group number 520 of "2") are mutually different groups. As a result of grouping in the above manner, there may be a case where only one coil belongs to one group. In the present embodiment, a case where a group containing only one coil is also treated as a group will be exemplified.

[0048] In this embodiment, a case is illustrated in which the group to which the coil of each coil number 410 belongs can be specified by the arrangement pattern 510 and the ship number 430. Therefore, the grouping information 500 does not need to include the group number 520. In addition, in this embodiment, a coil that cannot be placed at any of the addresses 231a to 231c (because it cannot be transported to the addresses 231a to 231c) is not a coil to be planned, and is not grouped (belongs to no group). For example, a coil whose coil attribute information 420 (weight, width, and outer shape) shown in FIG. 4 is not within the attribute range (weight 320, width 330, and outer diameter 340) defined for each address 310 in the parking space constraint information 300 shown in FIG. 3 is such a coil. However, such a coil may also be included in the coil to be planned. For example, the coil may be grouped into one group as a coil that cannot be transported to the addresses 231a to 231c, and the information that the coil cannot be transported to the addresses 231a to 231c may be calculated as information for identifying the transport plan.

[0049] <Example of formulation in mathematical programming problem> Below, an example of formulas (constraint equations and objective functions) used when calculating the first coil transport information, the second coil transport information, the address inventory information, and the shipping line inventory information by solving a mathematical programming problem is described.

[0050] Let i∈N be the set of ship numbers 430. I Let us assume that. Note that the N written after ∈ represents a natural number (this means that N I As described above, in this embodiment, the case where the shipping ship 240 transporting the coil is either the shipping ship 240 with the ship number 430 of "1" or the shipping ship 240 with the ship number 430 of "2" is illustrated. Therefore, i is 1 or 2.

[0051] Let j∈N be the set of indices of the possible arrangement patterns 510. J Let us assume that. As described above, in this embodiment, the possible arrangement patterns 510 are exemplified as being any of [1,0,0], [1,1,0], and [1,1,1]. Therefore, j is 1, 2, or 3 (for example, j=1 indicates [1,0,0], j=2 indicates [1,1,0], and j=3 indicates [1,1,1]).

[0052] Let the set of times be t∈N. T Let us assume that. As described above, in this embodiment, the coil is transported once a day. Therefore, t=1 indicates the planning start date, and t=2 indicates the day after the planning start date.

[0053] Let p∈N be the set of addresses 231a to 231c of the quay warehouse 230. P Let us assume that. As described above, in this embodiment, a case is exemplified in which there are three addresses 231a to 231c in the quay warehouse 230. Therefore, p is 1, 2, or 3 (in this embodiment, p=1 indicates the address 231a, p=2 indicates the address 231b, and p=3 indicates the address 231c).

[0054] <<constraint expression>> The constraint formula is a mathematical formula expressing a constraint imposed when transporting an item. When the constraint formula is determined, the constraint imposed when transporting an item may include a constraint imposed when transporting an item to any one of a plurality of yard and placing it in the yard. The constraint imposed when transporting an item may also include a constraint imposed when transporting an item from each yard after transporting the item to any one of a plurality of yard and placing it in the yard. In this embodiment, the constraint imposed when transporting a coil includes a constraint imposed when transporting the coil from the shipping line 220 to any one of a plurality of addresses 231a to 231c of the quay warehouse 230 and placing it in the address, and then transporting the coil from each address 231a to 231c to the shipping ship 240. More specifically, in this embodiment, the following constraint formula is used. Note that the following constraint equations are merely specific examples shown to make the explanation easier to understand, and the constraint equations indicating the constraints imposed when transporting a coil are not limited to the following constraint equations. The constraint equations include the following equation (1).

[0055]

number

[0056] Here, the amount of transportation to the quay warehouse 230 is x i,j,p,t' is a variable indicating the total weight of coils that belong to a group whose ship number 430 is i and whose arrangement pattern 510 is j and that are transported to the address p of the quay warehouse 230 at time t', and is one of the decision variables. In this embodiment, the transport amount x i,j,p,t 5, and the grouping information 500, a coil transport plan (which group of coils is to be transported to which address and at what timing) for a plurality of addresses 231a to 231c of the quay warehouse 230 is specified for at least a part of the same group. i,j,p,t Here, the case where the amount of transport to the quay warehouse 230 x is an example of the first coil transport information (first item transport information) is illustrated.i,j,p,t By using x as a decision variable, it is not necessary to determine the transportation plan for each coil to the multiple addresses 231a to 231c of the quay warehouse 230, so that the number of decision variables can be reduced. i,j,p,t is a variable for each group determined by a combination of ship number i and possible deployment pattern j. In contrast, when the transport amount to the quay warehouse 230 is determined for each individual coil, the transport amount to the quay warehouse 230 becomes a variable for each coil. Since the number of groups is smaller than the number of coils to be planned, the number of decision variables can be reduced as described above.

[0057] Cumulative Accounted Amount H i,j,t is the total weight of coils recorded on the shipping line 220 during the period from time 1 to time t among the coils belonging to the group whose ship number 430 is i and whose possible arrangement pattern 510 is j, and is one of the constants. Equation (1) is the transport amount ΣΣx of the coils belonging to the group transported to the quay warehouse 230 during the period from time 1 to time t. i,j,p,t' is the cumulative amount of coils in the group at time t, H i,j,t This indicates that you cannot do more than The constraint equations include the following equation (2).

[0058]

number

[0059] Here, the warehouse inventory amount s i,p,t is a variable indicating the total weight of coils (inventory) stored at address p of the quay warehouse 230 at time t that will be transported to the shipping ship 240 with ship number i (after time t), and is one of the decision variables. In this embodiment, the warehouse inventory amount s i,p,t The case where the inventory amount of coils at each address 231a to 231c is specified at each time t is illustrated, and the warehouse inventory amount s i,p,t This illustrates an example in which the item is address inventory information (first yard inventory information).

[0060] Warehouse initial inventory amount S initial i,p indicates the total weight of coils that are already placed at address p of the quay warehouse 230 at the time when planning begins (t=1) among the coils to be transported to the shipping ship 240 with ship number 430 i (initial inventory amount at address p), and is one of the constants.

[0061] Equation (2) expresses the inventory quantity s of coils stored at address p of the quay warehouse 230 at the start of planning (t=1) that will be transported to the shipping ship 240 with ship number i of the ship number 430. i,p,t (t=1) is the initial warehouse inventory S of coils to be transported to the shipping ship 240 among the coils placed at the address p. initial i,p Note that S initial i,p corresponds to the symbol “initial” and “i, p” arranged vertically to the right of S in equation (2) (the same notation will be used for other decision variables and constants). The constraint equations include the following equation (3).

[0062]

number

[0063] Here, the amount of transportation to the shipping ship 240 y i,p,t is a variable indicating the total weight of coils stored at address p of the quay warehouse 230 and transported to the shipping ship 240 with ship number i at time t, and is one of the decision variables. In this embodiment, the transport amount y i,p,t 4, and the coil information 400, a coil transport plan from each of the addresses 231a to 231c of the quay warehouse 230 to the shipping ship 240 (total quantity (weight) of the coils placed at each of the addresses 231a to 231c of the quay warehouse 230, timing and to which shipping ship 240) is specified. i,p,tis the second coil transport information (second item transport information).

[0064] Equation (3) expresses the amount of coils (inventory) stored at address p of the quay warehouse 230 at time t+1 that will be transported to the shipping ship 240 with ship number i of ship number 430. i,p,t+1 is the amount of coils in the warehouse that are to be transported to the shipping ship 240 among the coils placed at the address p at time t. i,p,t Among the coils transported to the address p at time t, the amount of coils transported to the shipping ship 240 and the quay warehouse 230 is Σx i,j,p,t The amount of coils transported to the shipping ship 240 at the address p at time t is calculated by adding y i,p,t must match the result minus The constraint equations include the following equation (4).

[0065]

number

[0066] Here, the upper limit of warehouse stock S upper p indicates the upper limit of the weight of a coil that can be placed at address p of the quay warehouse 230, and is one of the constants. Equation (4) expresses the inventory quantity Σs of warehouse 230 at address p at time t. i,p,t is the upper limit of warehouse inventory for the address p, S upper p Indicates that the following must be true: The constraint equations include the following equation (5).

[0067]

number

[0068] Here, the maximum transport volume C to the quay warehouse 230 in_upper t indicates the upper limit of the weight of the coil that can be transported from the shipping line 220 to the quay warehouse 230 at time t, and is one of the constants. Equation (5) is the transport amount ΣΣΣx of the coils transported to the quay warehouse 230 at time t. i,j,p,t is the maximum transport volume C to the quay warehouse 230 at the time t. in_upper t Indicates that the following must be true: The constraint equations include the following equation (6).

[0069]

number

[0070] Here, the maximum transport volume C to the shipping vessel 240 out_upper t indicates the upper limit of the weight of the coil that can be transported from the quay warehouse 230 to the shipping ship 240 at time t, and is one of the constants. Equation (6) expresses the amount of transport to the shipping ship 240 at time t, ΣΣy i,p,t is the maximum amount of cargo C to be transported to the shipping vessel 240 at the time t. out_upper t Indicates that the following must be true: The constraint equations include the following equation (7).

[0071]

number

[0072] Here, the target cumulative transport amount F i,t indicates the target value of the total weight of coils loaded onto the shipping ship 240 with ship number 430 i by time t (coils loaded onto the shipping ship 240 during the period from time 1 to time t), and is one of the constants.

[0073] In addition, the amount of delayed cargo a minus i,t is the target cumulative delivery volume F of the shipping vessel 240 with vessel number i. i,t It is one of the decision variables. minus i,tThe fact that is positive indicates that all of the coils that should have been loaded onto the shipping ship 240 with ship number i at time t have not been loaded onto that shipping ship 240 (i.e., a delay in shipment has occurred).

[0074] Equation (7) expresses the amount of cargo delay a minus i,t is the target cumulative transportation amount F at time t for the shipping ship 240 i,t From the above, the amount of transportation to the shipping ship 240 during the period from time 1 to time t, ΣΣy i,p,t Indicates that the value must be greater than or equal to the value subtracted from . The constraint equations include the following equation (8).

[0075]

number

[0076] Here, the early loading amount a plus i,t is the target cumulative delivery volume F of the shipping vessel 240 with vessel number i. i,t It is one of the decision variables. plus i,t The fact that i is a positive value indicates that the coils to be loaded onto a shipping ship 240 with ship number 430 i at a time after time t have already been loaded onto the shipping ship 240 at time t (so-called early loading has occurred).

[0077] Equation (8) expresses the amount of early loading a plus i,t is the amount of transportation to the shipping ship 240 during the period from time 1 to time t. i,p,t From the above, the target cumulative transportation amount F i,t Indicates that the value must be greater than or equal to the value subtracted from . The constraint equations include the following equation (9).

[0078]

number

[0079] Here, the shipping delivery time T DL i indicates the shipping delivery date of the shipping ship 240 whose ship number 430 is i, and is one of the constants. All coils transported to the shipping ship 240 whose ship number 430 is i are delivered at time T DL i It is necessary for the cargo to be delivered to the shipping vessel 240 by that date.

[0080] Equation (9) is time 1 to time T DL i The amount of coils transported to the shipping vessel 240 with vessel number 430 i during the period is ΣΣy i,p,t is the time t=T DL i Target cumulative transport volume F i,t must be equal to The constraint equations include the following equation (10).

[0081]

number

[0082] Here, the number of possible negations in the field is Ω j,p indicates whether or not a coil belonging to the placement pattern j can be placed at the address p of the quay warehouse 230, and is one of the constants. j,p If is "1", it means that the coil belonging to the placement pattern j can be placed at address p of the quay warehouse 230, and the placement location negation number Ω j,p is “0”, it is shown that a coil belonging to the arrangement pattern j cannot be placed at the address p of the quay warehouse 230.

[0083] Equation (10) indicates that if a coil belonging to the possible arrangement pattern j cannot be placed at address p of the quay warehouse 230, the coil belonging to the possible arrangement pattern j must not be transported to the address p. The constraint equations include the following equation (11).

[0084]

number

[0085] Equation (11) is the target cumulative transport volume F i,t If "0", the amount of transport y i,p,t indicates that it must be "0". The constraint equations include the following equation (12).

[0086]

number

[0087] Here, the shipping line inventory amount s mill t indicates the total weight of coils recorded on the shipping line 220 at time t (the inventory amount on the shipping line 220), and is one of the decision variables. In this embodiment, the shipping line inventory amount s mill t This illustrates a case where the inventory amount of coils that can be transported at the storage location 241 on the shipping line 220 is specified at each time t, and the shipping line inventory amount s mill t is shipping line inventory information (second yard inventory information). In addition, the initial inventory of the shipping line S mill_initial indicates the total weight of coils already recorded on the shipping line 220 at time 1 (initial inventory amount of the shipping line 220), and is one of the constants.

[0088] Equation (12) expresses the coil shipping line inventory s mill t is the initial inventory amount S of the shipping line mill_initial must be equal to The constraint equations include the following equation (13).

[0089]

number

[0090] Here, the accounted amount K i,j,t indicates the total weight of coils that are recorded on the shipping line 220 at time t among the coils that belong to a group whose ship number 430 is i and whose available arrangement pattern 510 is j, and is one of the constants. Equation (13) expresses the coil shipping line inventory s mill t+1 is the shipping line inventory amount s of coils recorded in the shipping line 220 up to time t mill t , the amount of coils already accounted for at the shipping line 220 at time t, ΣΣK i,j,t From the above, the transportation amount to the quay warehouse 230 at time t is ΣΣΣx i,j,p,t This indicates that the number must equal the sum of the two. The constraint equations include the following equation (14).

[0091]

number

[0092] Here, the upper limit of the shipping line inventory S mill_upper t indicates the upper limit of the total weight of coils recorded on the shipping line 220 at time t (the inventory amount on the shipping line 220 at time t), and is one of the constants. Equation (14) expresses the coil shipping line inventory s mill t is the upper limit of the shipping line inventory at time t, S mill_upper t Indicates that the following must be true:

[0093] <<Objective function>> The objective function is a function including an evaluation index for evaluating a transportation plan. The evaluation index is not limited as long as it is an index that indicates the degree of quality of the transportation plan. The number of evaluation indexes may be one or more. In this embodiment, the evaluation index is a function including a decision variable a minus i,t , a plus i,t , s mill t In this case, the objective function J is expressed by, for example, the following equation (15).

[0094]

number

[0095] Here, W minus , W plus , W stock are the amount of delayed shipments a minus i,t , early loading amount a plus i,t , shipping line inventory amount s mill t is a weighting coefficient for each evaluation index, which corresponds to the relative importance of each evaluation index and is a constant for balancing each evaluation index. Equation (15) illustrates the case where the minimum value of the objective function J is calculated (the "Min." before J indicates this). Therefore, the weighting coefficient W minus , W plus , W stock is preferably a positive number.

[0096] <<Optimization calculation>> When using the constraint equations (1) to (14) and the objective function (15) as described above, the decision variable x when the value of the objective function J in (15) is minimized within the range in which the constraint equations (1) to (14) are satisfied is i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill tis calculated as the optimal solution. The calculation of the optimal solutions for these decision variables can be realized by using a known solver such as CPLEX, and therefore a detailed description thereof will be omitted here. Here, an example is given in which the problem is formulated as a linear programming problem. However, for example, when a constraint equation that cannot be formulated as a linear programming problem is used, the problem may be formulated as another mathematical programming problem such as a mixed integer programming problem. For example, when the decision variable x i,j,p,t , y i,p,t , s i,p,t In addition to the decision variables (weight) such as the above, for example, a 0-1 variable indicating whether to transport or not may be used as a decision variable. In this case, the transport amount x i,j,p,t The decision variable corresponding to may be, for example, a variable that is "1" when all or some of the coils belonging to a group whose ship number 430 is i and whose possible arrangement pattern 510 is j are transported to address p of the quay warehouse 230 at time t, and "0" otherwise. Even in this way, the coils to be transported are identified for at least some of the same group. Furthermore, equation (15) illustrates an example in which the mathematical programming problem is a minimization problem. However, the mathematical programming problem is not limited to a minimization problem, and may be a maximization problem. In this case, for example, the objective function is obtained by multiplying each term on the right side of equation (15) by (-1).

[0097] Next, an example of the functions of each unit of the plan creation device 100 shown in FIG. 1 will be described. <Acquisition part 110> The acquisition unit 110 acquires pre-collected information that is information required in advance for the plan creation device 100 to create a transportation plan. The pre-collected information includes, for example, site constraint information 300, coil information 400, and constant information.

[0098] The constant information includes at least one of information indicating the constants described in the section <Example of formulation in mathematical programming> and information required to calculate the constants described in the section <Example of formulation in mathematical programming>. In this embodiment, a case is illustrated in which the constant information includes both information indicating the constants and information required to calculate the constants. Note that, in relation to the information acquired by the acquisition unit 110 described above as an example of a method for grouping coils, a case is illustrated in which the coil information 400 (information about each coil) is distinguished from other constant information, but the coil information 400 is also information included in the constant information.

[0099] An example of constant information will be described with reference to Figs. 6 to 9. In Fig. 6 and subsequent figures, "***" indicates that information (value, name, etc.) is provided. Also, "-" indicates that no information setting is required (however, information such as 0 (zero) may be set). Also, Fig. 6 and subsequent figures will illustrate the case where the planning start timing is October 9th, as in Fig. 4.

[0100] Figure 6 shows the target cumulative transport amount F i,t 6 illustrates an example of a planning period from October 9 to October 14 (the period from time 1 to time 6 (t=1 to 6)). In FIG. 6, the shipping ship 240 with the ship number 430 of "1" (i=1) is anchored from October 12 to October 14 (the period from time 4 to time 6 (t=4-6)) to load coils transported from the quay warehouse 230. Therefore, the shipping due date T DL In FIG. 6, the shipping ship 240 with the ship number 430 of "2" (i=2) will be anchored from October 10 to October 12 (the period from time 2 to time 4 (t=2-4)) to load coils transported from the quay warehouse 230. Therefore, the shipping due date T DL 2 will be October 12th (time 6 (t=4)).

[0101] Figure 7 shows the initial warehouse inventory S initial i,p (Fig. 7(a)), Shipping line warehouse inventory S mill_initial (Fig. 7(b)), and the upper limit of warehouse stock S upper p FIG. 7(c) is a diagram showing an example of the configuration shown in FIG. Figure 8 shows the upper limit of the shipping line inventory S mill_upper t , Maximum transport volume to quay warehouse 230 C in_upper t , and the maximum transport volume C to the shipping vessel 240 out_upper t FIG. Figure 9 shows the weighting factor W minus , W plus , W stock FIG.

[0102] <Grouping unit 120> The grouping unit 120 groups a plurality of coils to be planned based on the yard constraint information 300 (see FIG. 3) and the coil information 400 (see FIG. 4). An example of a method for grouping coils in this way is as described above in the section <Example of a method for grouping coils>. As described above, FIG. 5 illustrates a case in which coils of each coil number 410 are grouped into groups with the same ship number 430 and arrangement possible pattern 510. Specifically, in this embodiment, the grouping unit 120 first calculates an arrangement possible pattern 510 for each coil based on a comparison between the yard constraint information 300 and the coil attribute information 420, and stores the calculated arrangement possible pattern 510 in association with the coil number (see FIG. 5). Then, the grouping unit 120 performs grouping of coils based on the ship (ship number 430) and arrangement possible pattern 510 associated with each coil included in the coil information 400. As described above, in this embodiment, a case where a group is determined by the ship number 430 and the possible arrangement pattern 510 is exemplified. Also, in the section <Example of formulation in mathematical programming problem>, a case where a group is specified by the variable i that identifies the ship number 430 and the variable j that identifies the possible arrangement pattern 510 is exemplified. In this case, the grouping unit 120 may perform the above grouping by storing the ship number 430 and the possible arrangement pattern 510 in association with the coil number, and the group number that identifies each group may or may not be stored in association with the coil number. Note that, when a variable for each group number is used in the formulation, the grouping unit 120 may perform the above grouping by storing the group number that identifies each group in association with the coil number.

[0103] <Calculation unit 130> The calculation unit 130 calculates the transport plan identification information. The transport plan identification information includes the first coil transport information. As described above in the <Overview> section, in this embodiment, the first coil transport information is information for identifying the transport plan of the coil to the multiple addresses 231a to 231c for at least a part of the same group.

[0104] As described above in the section <Overview>, this embodiment illustrates a case where the calculation unit 130 further calculates second coil transportation information, address inventory information, and shipping line inventory information as transportation plan specification information in addition to the first coil transportation information. This embodiment illustrates a case where the second coil transportation information is information for specifying a transportation plan of the coil from each of the addresses 231a to 231c of the quay warehouse 230, the address inventory information is information for specifying the coil inventory amount at each of the addresses 231a to 231c at the time when the coil is transported, and the shipping line inventory information is information for specifying the inventory amount of the coil that is ready to be transported at the storage areas 221a to 221b of the shipping line 220 at the time when the coil is transported.

[0105] As described above in the section <Overview>, in this embodiment, the calculation unit 130 calculates the first coil transport information, the second coil transport information, the address inventory information, and the shipping line inventory information by solving a mathematical programming problem. As described above in the section <Example of formulation in mathematical programming problem>, in this embodiment, the transport amount x i,j,p,t is the first coil transport information, and the transport amount y i,p,t is the second coil transport information, and the warehouse inventory amount s i,p,t is the street inventory information, and the shipping line inventory amount s mill t is the shipping line inventory information, and the calculation unit 130 calculates the decision variable x i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill t The case where the following is calculated as the optimal solution will be exemplified.

[0106] In this embodiment, among the constants included in the formulas (1) to (14), the cumulative accounted amount H i,j,t, the number of possible negations Ω shown in Eq. (10) j,p , and the accounted amount K shown in Eq. (13) i,j,t A case will be illustrated in which constants other than H are included in the constant information acquired by the acquisition unit 110. i,j,t , Ω j,p , K i,j,t The constants other than F i,t (See Figure 6) DL i (See Figure 6), S initial i,p (See Fig. 7(a)), S mill_initial (See Fig. 7(b)). upper p (See Fig. 7(c)). mill_upper t (See Figure 8) in_upper t (See Figure 8) out_upper t (See Figure 8), and W minus , W plus , W stock (See Figure 9).

[0107] In this case, the cumulative amount H i,j,t , the number of possible negations in the place j,p , and the accounted amount K i,j,t The constant information itself is not included in the constant information acquired by the acquisition unit 110. Therefore, in this embodiment, the calculation unit 130 calculates the cumulative counted amount H i,j,t and the accounted amount K i,j,t Calculate the number of possible locations Ω based on the grouping information 500. j,p The case of calculating the following will be exemplified.

[0108] First, the cumulative amount H i,j,t An example of a method for calculating the above will be described. Based on the grouping information 500, the calculation unit 130 identifies the group to which the coil with each coil number 410 belongs (coils with the same ship number i and arrangement possible pattern j). Next, the calculation unit 130 calculates the recorded amount K by integrating the weight of each coil of the same recording date 450 and group included in the coil information 400. i,j,t However, if the accounting date 450 is before the planning start timing, the calculation unit 130 integrates the weight of the coil by regarding the accounting date 450 as the planning start timing.

[0109] As described with reference to FIG. 4 and FIG. 6, in this embodiment, the case where the planning start timing is October 9th is exemplified. Therefore, for records in FIG. 4 in which the accounting date 450 is October 5th, October 8th, October 4th, and October 7th, the calculation unit 130 assumes that the accounting date 450 is October 9th and accumulates the weight of the coil for each coil with the same accounting date 450 and group. On the other hand, if the accounting date 450 is later than the planning start timing, the calculation unit 130 uses the accounting date 450 included in the coil information 400 as the accounting date 450 as it is, and accumulates the weight of the coil for each coil with the same accounting date 450 and group. Therefore, for records in FIG. 4 in which the accounting date 450 is October 10th, the calculation unit 130 assumes that the accounting date 450 is October 10th as it is, and accumulates the weight of the coil for each coil with the same accounting date 450 and group. In this way, the total weight of the coils calculated for each coil with the same accounting date 450 and group is the amount already recorded K i,j,t It is calculated as:

[0110] Figure 10 shows the accounted amount K i,j,t FIG. As described above with reference to FIG. 6, in this embodiment, a case where a shipping ship 240 with a ship number 430 of "2" (i=2) is anchored from October 10 to October 12 (from time 2 to time 4 (t=2-4)) is illustrated. Therefore, FIG. 10 illustrates a case where coils (coils belonging to groups with group numbers "2" and "3") to which the shipping ship 240 with a ship number 430 of "2" (i=2) is the destination are not recorded after October 13 (time 5 (t=5)), when the shipping ship 240 does not exist. In FIG. 10, the "-" shown in the columns with group numbers "2" and "3" and dates "October 13" and "October 14" indicates this. However, this is not necessarily the case. For example, it may be arranged not to record on "October 12".

[0111] Also, here, an example is shown in which a shipping ship 240 with ship number 430 of "1" (i=1) is anchored from October 12th to October 14th (the period from time 4 to time 6 (t=4-6)). Therefore, in FIG. 10, for coils (coils belonging to groups with group numbers "1" and "4") to which the shipping ship 240 with ship number 430 of "1" (i=1) is the destination, an example is shown in which it is possible to record the amount for the entire planning period (from October 9th to October 14th (the period from time 1 to time 6 (t=1-6))). However, this is not necessarily required. For example, it may be possible not to record the amount on "October 14th".

[0112] Next, the cumulative amount H i,j,t An example of a method for calculating the above will be described. The calculation unit 130 calculates the accounted amount K of the coils belonging to the group whose ship number 430 is i and whose arrangement pattern 510 is j at the time t. i,j,t The amount of coils in the group that have already been accounted for at each time 1 to t-1 prior to the time t is K i,j,1 ~K i,j,t-1 By adding H i,j,tFor example, the cumulative amount H of coils that belong to the group in which the ship number 430 is "1" and the arrangement pattern 510 is "1" on October 11 (time 3 (t=3)) is calculated. 1,1,3 is the amount of coils in the group that have been recorded on October 10 (time 3 (t=3)) 1,1,3 The amount of coils in the group that have already been recorded on October 10 (time 2 (t=2)) is K 1,1,2 and the amount of coils in the group that have already been accounted for on October 9 (time 1 (t=1)), K 1,1,1 (H 1,1,3 =K 1,1,1 +K 1,1,2 +K 1,1,3 ).

[0113] As described above with reference to FIG. 4 in the section <Example of a method for grouping coils>, the recording date of a coil that has not been recorded when the planning start timing is October 9th becomes the scheduled date. This scheduled date may be specified by an operator or calculated by the planning device 100. When the planning device 100 calculates the date (scheduled date) on which the coil is recorded, the acquisition unit 110 may, for example, acquire recording required time information indicating the time required for recording a coil at each position on the shipping line 220 for each position on the shipping line 220, and output it to the calculation unit 130. In this case, the calculation unit 130 may, for example, specify the current position of the coil from the current state 440 included in the coil information 400, specify the time required for recording a coil at the specified position from the recording required time information, and add the specified time to the planning start timing to calculate the date (scheduled date) on which the coil is recorded.

[0114] Finally, the number of possible negations in the place j,p An example of a method for calculating the above will be described. The calculation unit 130 calculates the arrangement pattern 510 included in the grouping information 500 by the arrangement possibility negation number Ω. j,p It is calculated as follows. Figure 11 shows the number of possible negations for the place j,p FIG. 11 is a diagram showing an example of the negation number Ω of the storage space. j,pcorresponds to the arrangement possible pattern 510. Therefore, even if the groups are different from each other, if the arrangement possible pattern 510 is the same, the arrangement possibility negation number Ω of the groups is j,p For example, in FIG. 10, the arrangement pattern 510 of the "group" with group number "1" and the arrangement pattern 510 of the group with group number "2" are both [1, 0, 0] (j=1). Therefore, the placement possibility number Ω of the coils belonging to the "group" with group number "1" is j,p and the number of coils that belong to the group with group number "2" is Ω j,p will have the same value.

[0115] <Output unit 140> The output unit 140 outputs at least a part of the transport plan specifying information calculated by the calculation unit 130. As described above, in this embodiment, the calculation unit 130 outputs the decision variable x i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill t The output unit 140 calculates the optimal solution of these decision variables x i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill t In the present embodiment, the output unit 140 outputs information indicating at least one of the optimal solutions. In the present embodiment, a case is illustrated in which the output unit 140 displays the transport plan specifying information on a computer display. However, the output form of the transport plan specifying information is not limited to displaying on a computer display. For example, in addition to or instead of displaying on a computer display, at least one of transmitting to an external device and storing in a storage medium inside or outside the plan creation device 100 may be executed.

[0116] Figure 12 shows the amount of delayed shipments aminus i,t The optimal solution of (Fig. 12(a)) and the early loading amount a plus i,t FIG. 12(b) is a diagram showing an example of an optimal solution of As described above with reference to Figures 6 and 10, this embodiment illustrates an example in which a shipping ship 240 with ship number 430 of "1" (i=1) is anchored from October 12th to October 14th (the period from time 4 to time 6 (t=4~6)).

[0117] Therefore, in FIG. 12(a), there will be no cargo delay for the shipping ship 240 with ship number 430 being "1" (i=1) before October 12. In FIG. 12(a), the "-" shown in the column with ship number 430 being "1" and the date being "October 13" to "October 14" indicates this. Note that if a coil that needs to be delivered on October 13 to the shipping ship 240 with ship number 430 being "1" (i=1) is delivered on October 14, then a cargo delay will have occurred. Therefore, in FIG. 12(a), the value in the column with ship number 430 being "1" and the date being "October 14" may exceed "0."

[0118] In addition, in FIG. 12(b), early loading does not occur for the shipping vessel 240 with vessel number 430 of "1" (i=1) before October 11 or after October 14. In FIG. 12(b), the "-" shown in the column where vessel number 430 is "1" and the date is "October 9" to "October 11" and "October 14" indicates this. Note that early loading occurs when a coil that needs to be delivered to the shipping vessel 240 with vessel number 430 of "1" (i=1) on October 13 or 14 is delivered on October 12. Therefore, in FIG. 12(b), the value in the column where vessel number 430 is "1" and the date is "October 12" may exceed "0".

[0119] In this embodiment, the case where the shipping ship 240 with the ship number 430 of "2" (i=2) is anchored from October 10th to October 12th (from time 2 to time 4 (t=2 to 4)) is illustrated as an example. Therefore, in Figure 12(a), there will be no cargo delays for the shipping ship 240 with ship number 430 of "2" (i=2) before October 10 or after October 13. In Figure 12(a), the "-" shown in the columns where the ship number 430 is "2" and the dates are "October 9" to "October 10" and "October 13" to "October 14" indicates this.

[0120] Also, in Figure 12(b), there will be no early loading for the shipping vessel 240 with vessel number 430 of "2" (i=2) before October 9th or after October 12th. In Figure 12(b), the "-" shown in the columns where the vessel number 430 is "2" and the dates are "October 9th" and "October 12th" to "October 14th" indicates this.

[0121] Figure 13 shows the warehouse inventory s i,p,t FIG. 13 is a diagram showing an example of an optimal solution. As described above with reference to Figures 6 and 10, this embodiment illustrates an example in which a shipping ship 240 with ship number 430 of "1" (i=1) is anchored from October 12th to October 14th (the period from time 4 to time 6 (t=4~6)).

[0122] Therefore, in Fig. 13, there is no coil transported to the shipping ship 240 with the ship number 430 of "1" (i=1) remaining in stock at the quay warehouse 230 on October 14th. In Fig. 13, the "-" shown in the column where the ship number 430 is "1" and the date is "October 14th" indicates this.

[0123] In this embodiment, the case where the shipping ship 240 with the ship number 430 of "2" (i=2) is anchored from October 10th to October 12th (from time 2 to time 4 (t=2 to 4)) is illustrated as an example.

[0124] Therefore, in Fig. 13, the coils transported to the shipping ship 240 with the ship number 430 of "2" (i=2) will not remain in stock at the quay warehouse 230 after October 12th. In Fig. 13, the "-" shown in the column where the ship number 430 is "2" and the dates are "October 12th" to "October 14th" indicates this.

[0125] The output unit 140 outputs the amount of shipment delay a as shown in, for example, FIG. 12 and FIG. 13. minus i,t Optimal solution for early loading amount a plus i,t The optimal solution for and the warehouse inventory level s i,p,t As described above, the transportation plan specification information output by the output unit 140 is not limited to these pieces of information. For example, the output unit 140 does not need to output information indicating at least one of these optimal solutions. Furthermore, the output unit 140 may output, instead of or in addition to these optimal solutions, information indicating the transportation amount x i,j,p,t The optimal solution and the transportation amount y i,p,t Alternatively, information indicating at least one of the optimal solution of

[0126] <Changes in transportation plan> The operator judges whether or not it is necessary to change the transport plan based on the optimization calculated by the plan creation device 100, based on the transport plan specifying information output by the output unit 140. For example, when the transport plan cannot be adopted for business purposes, the operator judges that it is necessary to change the transport plan.

[0127] In this case, the acquisition unit 110 reacquires the pre-collected information. The pre-collected information reacquired by the acquisition unit 110 is at least partially different from the pre-collected information already acquired by the acquisition unit 110. For example, the operator operates a user interface of the plan creation device 100 to instruct the plan creation device 100 as to whether or not it is necessary to change the transportation plan.

[0128] When it is necessary to change the transportation plan, for example, the operator may change at least one of the coil weight 320, width 330, and outer diameter 340 included in the storage site constraint information 300 shown in FIG. 3, and input the changed storage site constraint information 300 to the plan creation device 100. At that time, the change may be made to loosen the constraints imposed by the storage site constraint information 300, or may be made to tighten them. Also, for example, the operator may change the coils (coils to be planned) included in the coil information 400 shown in FIG. 4, and input the changed coil information 400 to the plan creation device 100. At that time, the number of coils to be planned may be increased, decreased, or replaced. Also, for example, the operator may change a constant (F i,t , S initial i,p , S mill_initial , S upper p , S mill_upper t , C in_upper t , C out_upper t , W minus , W plus , W stock ) and input the changed constants to the plan creation device 100. Also, for example, the operator may change the planning period (range of time t) and input the target cumulative transport amount F i,t may be input to the plan creation device 100. In this case, the plan period may be lengthened or shortened.

[0129] When the acquiring unit 110 acquires the changed pre-collected information in this manner, the grouping unit 120 again groups the coils, the calculating unit 130 again calculates the optimal solution, and the output unit 140 again outputs information indicating a transportation plan, based on the changed pre-collected information. Note that if there are no changes to the storage site constraint information 300 and the coil information 400, the grouping of the coils by the grouping unit 120 may be omitted.

[0130] Here, a case where an operator judges whether or not it is necessary to change the transport plan is exemplified. However, this is not necessarily required. For example, the plan creation device 100 may automatically judge whether or not it is necessary to change the transport plan based on the optimal solution. For example, when a transport plan based on the optimal solution does not satisfy a preset condition, the plan creation device 100 may judge that it is necessary to change the transport plan based on the optimal solution. In this case, the plan creation device 100 may change at least a part of the pre-collected information according to a preset rule, or may notify the operator that re-input of the pre-collected information is necessary.

[0131] <Flowchart> Next, an example of a plan creation method executed by the plan creation device 100 will be described with reference to the flowchart of FIG. First, in step S1401, the acquiring unit 110 acquires pre-collected information. Next, in step S1402, the grouping unit 120 groups a plurality of coils to be planned based on the pre-collected information (the parking space constraint information 300 and the coil information 400), and creates grouping information 500.

[0132] Next, in step S1403, the calculation unit 130 calculates the decision variable x when the value of the objective function J in equation (15) is minimized within the range that satisfies the constraint equations (1) to (14), based on the pre-collected information (coil information 400 and constant information) and the grouping information 500. i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill t The optimal solution is calculated as information regarding the transportation plan.

[0133] Next, in step S1404, the output unit 140 outputs at least a part of the transport plan specifying information calculated by the calculation unit .

[0134] Next, in step S1405, the plan creation device 100 determines whether or not it is necessary to change the transportation plan. As described above in the section <Change of Transportation Plan>, the determination in step S1405 may be made based on an input operation of the user interface of the plan creation device 100 by an operator, or may be made automatically by the plan creation device 100.

[0135] If it is determined that the transport plan needs to be changed (YES in step S1405), the process of step S1401 is performed again. In step S1401 that is performed again, the acquisition unit 110 acquires pre-collected information that is at least partially different from the pre-collected information that has already been acquired. Then, the processes of steps S1402 to S1404 are performed again based on the pre-collected information. The processes of steps S1401 to S1405 are repeated until it is determined in step S1405 that the transport plan does not need to be changed. Then, if it is determined in step S1405 that there is no need to change the transportation plan, the processing according to the flowchart in FIG. 14 ends.

[0136] <Summary> As described above, in this embodiment, the plan creation device 100 groups a plurality of coils to be planned based on the yard constraint information 300 and the coil attribute information 420, and generates the first coil transport information (the transport amount x to the quay warehouse 230) for specifying the transport plan of the coils to the addresses 231a to 231c for at least a part of the same group. i,j,p,t Therefore, even if the attributes of the coils that can be placed are determined by the addresses 231a to 231c, a transport plan that can appropriately transport the coils to each of the addresses 231a to 231c can be created without imposing a large calculation load.

[0137] Furthermore, in this embodiment, the plan creation device 100 groups multiple coils to be planned based on the yard constraint information 300, the coil attribute information 420, and the ship number 430. Therefore, even if there are multiple destinations (ship number 430) for the coils from the quay warehouse 230, it is possible to group the coils by destination, and it is possible to prevent multiple coils with different destinations from being classified into the same group.

[0138] In the present embodiment, the plan creation device 100 generates second coil transport information (a transport amount y i,p,t Therefore, a coil transportation plan can be created consistently from the time the coil leaves the shipping line 220 until the time the coil enters the shipping ship 240.

[0139] In the present embodiment, the plan creation device 100 also generates second coil transportation information (the transportation amount y i,p,t ) to calculate information for identifying a transport plan from each address 231a to 231c to each shipping ship 240. Therefore, even if there are multiple shipping ships 240, it is possible to consistently create a transport plan for the coils from when they leave the shipping line 220 until when they enter the shipping ship 240.

[0140] In the present embodiment, the plan creation device 100 also generates second coil transportation information (the transportation amount y i,p,t ) the coil transport plan from each of the addresses 231a to 231c is specified for each of the addresses 231a to 231c. Therefore, it is not necessary to distinguish the second coil transport information by unnecessary groups, and an increase in the calculation load can be suppressed.

[0141] In this embodiment, the plan creation device 100 also stores address inventory information (warehouse inventory amount s i,p,t Therefore, it is possible to create a transportation plan that takes into account the (time-varying) stock amount of coils at each of the addresses 231a to 231c.

[0142] In this embodiment, the plan creation device 100 also uses the address inventory information (warehouse inventory amount s i,p,t ) the stock amount of coils at each of the addresses 231a to 231c is specified for each of the addresses 231a to 231c. Therefore, it is not necessary to distinguish the address stock information into unnecessary groups, and an increase in the calculation load can be suppressed.

[0143] In the present embodiment, the plan creation device 100 also calculates shipping line inventory information (shipping line inventory amount s mill t Therefore, it is possible to create a transportation plan that takes into consideration the inventory amount (time transition) of coils that can be transported on the shipping line 220.

[0144] In this embodiment, the plan creation device 100 also calculates the shipping line inventory information (shipping line inventory amount s mill t ), the inventory amount of coils that can be transported on the shipping line 220 is specified as the total inventory amount of the shipping line 220. Therefore, it is not necessary to distinguish between unnecessary groups for the shipping line inventory information, and an increase in the calculation load can be suppressed.

[0145] In this embodiment, the plan creation device 100 also calculates the decision variable x i,j,p,t , y i,p,t , s i,p,t , a minus i,t , a plus i,t , s mill t The optimal solution for is calculated by solving a mathematical programming problem. Therefore, it is possible to create a transportation plan taking into account the evaluation index for the transportation plan.

[0146] In this embodiment, the plan creation device 100 predicts and calculates the timing when it will be possible to transport the coil to each of the addresses 231a to 231c (timing when it will be recorded). Therefore, after predicting the timing when the coil that has not been recorded at the timing of planning (calculating the planned date of recording 450), the first coil transport information for the coil (transport amount to the quay warehouse 230 x i,j,p,t ) can be calculated.

[0147] <Other embodiments> The above-described embodiment of the present invention can be realized by a computer executing a program. A computer-readable recording medium on which the program is recorded and a computer program product such as the program can also be applied as an embodiment of the present invention. Examples of the recording medium that can be used include a flexible disk, a hard disk, an optical disk, a magneto-optical disk, a CD-ROM, a magnetic tape, a non-volatile memory card, and a ROM. Furthermore, the above-described embodiments of the present invention are merely examples of the implementation of the present invention, and the technical scope of the present invention should not be interpreted as being limited by these. In other words, the present invention can be implemented in various forms without departing from its technical concept or main features.

[0148] The disclosure of the above embodiment can be, for example, as follows. (Disclosure 1) A planning creation device for creating a transportation plan for a plurality of items, a grouping unit that groups a plurality of items based on item constraint information for specifying attributes of items that can be placed in each of a plurality of first storage locations and item attribute information for specifying attributes of the plurality of items that are targets of the transportation plan; A calculation unit that calculates transport plan identification information for identifying the transport plan; Equipped with A plan creation device, wherein the transport plan identification information includes first item transport information for identifying a transport plan for the item to the first storage location for at least a portion of the same group. (Disclosure 2) The plan creation device described in Disclosure 1, wherein the grouping unit groups multiple items that are the subject of the transportation plan based on the item constraint information, the item attribute information, and item destination information indicating the destination of the item from the first storage location. (Disclosure 3) The plan creation device according to Disclosure 1 or 2, wherein the transportation plan identification information further includes second item transportation information for identifying a transportation plan for the item from the first storage location. (Disclosure 4) The article is transported from the first storage area to any one of a plurality of second storage areas; The plan creation device according to disclosure 3, wherein the second item transport information is information for identifying a transport plan for the item from the first storage location to the second storage location. (Disclosure 5) The plan creation device according to Disclosure 3 or 4, wherein in the second item transport information, a transport plan for the item from the first storage location is specified for each of the first storage locations. (Disclosure 6) The plan creation device according to any one of Disclosures 1 to 5, wherein the transportation plan specifying information further includes first storage yard inventory information for specifying an inventory amount of the item in the first storage yard. (Disclosure 7) 7. The plan creation device according to disclosure 6, wherein the first yard inventory information specifies an inventory amount of the item in the first yard for each of the first yard. (Disclosure 8) The article is transported from a third storage area to the first storage area, The plan creation device according to any one of Disclosures 1 to 7, wherein the transportation plan identification information further includes second storage location inventory information for identifying the inventory amount of the item in the third storage location that has become available for transportation to the first storage location. (Disclosure 9) The plan creation device according to Disclosure 8, wherein in the second storage location inventory information, the inventory amount of the item in the third storage location that has become transportable to the first storage location is identified as the inventory amount of the entire third storage location. (Disclosure 10) The plan creating device according to any one of claims 1 to 9, wherein the calculation unit calculates an optimal solution of a decision variable indicating the transportation plan specifying information by solving a mathematical programming problem. (Disclosure 11) A method for creating a transportation plan for a plurality of items, comprising the steps of: a grouping step of grouping the plurality of items based on item constraint information for specifying attributes of items that can be placed in each of a plurality of first storage locations and item attribute information for specifying attributes of the plurality of items that are targets of the transportation plan; a calculation step of calculating transportation plan identification information for identifying the transportation plan; Equipped with A plan creation method, wherein the transport plan identification information includes first item transport information for identifying a transport plan for the item to the first storage location for at least a portion of the same group. (Disclosure 12) A program for causing a computer to function as each unit of the plan creation device according to any one of Disclosures 1 to 10. [Explanation of symbols]

[0149] 100 Planning device 110 Acquisition Department 120 Grouping section 130 Calculation section 140 Output section 210 Hot Rolling Line 220 Shipping Line 221a~221b Coil storage area on the shipping line 230 Wharf Warehouse Addresses 231a-231c (coil storage area at the wharf warehouse) 240 Shipping Ship 241 Coil storage area on shipping ships 300 Storage Restriction Information Number 310 320 coil weight 330 Coil width 340 Coil outer diameter 400 Coil Information 410 Coil number 420 Coil Attribute Information 430 Ship No. 440 Current situation 450 Recorded date 500 Grouping Information 510 possible patterns 520 Group Number a minus i,t Amount of delayed shipments a plus i,t Early loading amount s i,p,t Warehouse inventory s mill t Shipping line inventory x i,j,p,t Amount transported to wharf warehouse y i,p,t Amount transported to shipping vessels C in_upper t Maximum transport volume to quayside warehouse C out_upper t Maximum amount of cargo to be transported to shipping vessel F i,t Target cumulative transport volume H i,j,t Cumulative Accounted Amount K i,j,t Accounted amount S initial i,p Warehouse initial inventory S mill_initial Shipping line initial inventory S upper p Warehouse inventory limit S mill_upper t Shipping line inventory limit T DL i Shipping Delivery Time W minus Weighting factor for delayed shipments W plus Weighting factor for early loading W stock Weighting factor for shipping line inventory

Claims

1. A planning creation device for creating a transportation plan for a plurality of items, a grouping unit that groups a plurality of items based on item constraint information for specifying attributes of items that can be placed in each of a plurality of first storage locations and item attribute information for specifying attributes of the plurality of items that are targets of the transportation plan; A calculation unit that calculates transport plan identification information for identifying the transport plan; Equipped with A plan creation device, wherein the transport plan identification information includes first item transport information for identifying a transport plan for the item to the first storage location for at least a portion of the same group.

2. The plan creation device according to claim 1 , wherein the grouping unit groups a plurality of items that are the subject of the transportation plan based on the item constraint information, the item attribute information, and item destination information indicating a destination of the item from the first storage location.

3. The plan creation device according to claim 1 or 2, wherein the transportation plan specifying information further includes second item transportation information for specifying a transportation plan for the item from the first storage location.

4. The article is transported from the first storage location to any one of a plurality of second storage locations; The plan creation device according to claim 3 , wherein the second item transport information is information for specifying a transport plan for the item from the first storage location to the second storage location.

5. 4. The plan creation device according to claim 3, wherein in the second item transport information, a transport plan for the item from the first storage location is specified for each of the first storage locations.

6. 3. The plan creation device according to claim 1, wherein the transportation plan specifying information further includes first yard inventory information for specifying an inventory amount of the item in the first yard.

7. 7. The plan creation device according to claim 6, wherein the first yard inventory information specifies an inventory amount of the item in the first yard for each of the first yard.

8. The article is transported from a third storage location to the first storage location, 3. The plan creation device according to claim 1, wherein the transportation plan specifying information further includes second yard inventory information for specifying an inventory amount of the item in the third yard that has become transportable to the first yard.

9. 9. The plan creation device according to claim 8, wherein in the second yard inventory information, the inventory amount of the item in the third yard that is capable of being transported to the first yard is specified as the inventory amount of the entire third yard.

10. The plan creation device according to claim 1 , wherein the calculation unit calculates an optimal solution of a decision variable indicating the transportation plan specifying information by solving a mathematical programming problem.

11. A method for creating a transportation plan for a plurality of items, comprising the steps of: a grouping step of grouping the plurality of items based on item constraint information for specifying attributes of items that can be placed in each of a plurality of first storage locations and item attribute information for specifying attributes of the plurality of items that are targets of the transportation plan; a calculation step of calculating transportation plan identification information for identifying the transportation plan; Equipped with A plan creation method, wherein the transport plan identification information includes first item transport information for identifying a transport plan for the item to the first storage location for at least a portion of the same group.

12. A program for causing a computer to function as each unit of the plan creation device according to claim 1 or 2.

Citation Information

Patent Citations

  • Layout plan preparing method and device, layout physical distribution controlling method and device, computer-readable storage medium and computer program

    JP2004303176A

  • Carrying control method, carrying control device and computer program

    JP2010254429A