JP5692182B2 - Transportation planning device - Google Patents

Description

  The present invention relates to a transportation plan planning apparatus and a transportation plan planning method for planning transportation of parts when delivering parts from a plurality of suppliers to produce a finished product.

  2. Description of the Related Art In recent years, various techniques for creating a logistics plan for supplying parts for production when a finished product such as a vehicle is produced are known. For example, when production is actually performed in a factory or the like, the amount of production fluctuates, so that it is necessary to appropriately formulate a plan for conveying parts to the production line.

  On the other hand, there is known a technique for determining the supply frequency of parts so as to minimize the space cost related to the space for storing the parts and the work cost related to the time for transporting the parts (for example, see Patent Document 1). .

JP 2010-0661260 A

  However, in the technique shown in Patent Document 1, the number of parts transported is not sufficiently optimized, and transport resources may become excessive.

  The present invention has been made to solve such problems, and it is a main object of the present invention to provide a transportation plan planning apparatus and a transportation plan planning method that can optimize transportation resources.

One aspect of the present invention for achieving the above object is a transportation plan planning device that plans transportation of the parts when delivering parts from a plurality of suppliers to produce a finished product. Delivery planning means for calculating the number, type and delivery timing of each part delivered from each supplier based on the production plan information, and the number, type and delivery of each part calculated by the delivery planning means Based on the timing, each part delivered from each supplier will be packed and calculated, and the parts will be delivered from the supplier. Work to calculate the number of trucks transported in each transportation round based on the transportation diagram information when transporting to the line at predetermined time intervals and the packaging form of each part calculated by the packaging form calculation means The amount calculation means and the work amount calculation means Resource minimizing means for minimizing the total number of times of transportation by shifting the number of trucks in the transportation times at equal intervals calculated from the carriages transported in each transportation time to the next transportation time only for the same number of trucks; The delivery plan means includes the number, type, and delivery timing of each part delivered from each supplier using the delay time of the parts caused by the shift executed by the resource minimizing means. It is a transportation planning device characterized by recalculating.
In this aspect, the number of carts that can be transported at one time in each transport time is set in advance, and the resource minimizing means is configured to reduce the difference between the maximum number of carts and the minimum number of carts in each transport time. The shifting may be executed.
In this aspect, the work amount calculating means calculates the number of carriages transported in each transporting time for each supplier, and the resource minimizing means is configured to shift the shift for each supplier. Further, the shift may be executed with priority from the supplier having a small number of appearances in the entire transportation times.
In this aspect, the resource minimizing means divides the number of trolleys for each transportation time by the number of trolleys that can be transported to the production line at a time to calculate the number of trolleys respectively, and the calculated minimum value of the number of trolleys When the number of trucks does not match the preset number of trucks, the shifting may be executed in order from the transporting time with the smallest number of trucks.
In this aspect, the delivery plan means includes the production plan information indicating the number of the finished products produced for each production date, component part information indicating the type and number of parts constituting the finished product, Based on the parts ordering condition information indicating the supplier and delivery date, the schedule information of the delivery flights between each supplier and the production factory, and the safety time information indicating the time that each part stays due to the shift. In addition, the number, type, and delivery timing of each delivered part may be calculated so that each part arrives in time for production on the production line.
In this aspect, the delivery plan means includes an external logistics lead time from each supplier to the production factory, an on-site logistics lead time from the delivery to the production line, The delivery timing may be calculated such that each part arrives in accordance with production on the production line based on a time obtained by adding a safety time indicating a time during which each part stays due to the shift.
In this one aspect, each part delivered from the supplier is housed in a box, the box is placed on a skid, the skid is transported by the carriage, and the packing form calculating means Production based on the box size information indicating the size of the box in which the parts are accommodated and the integration condition information indicating the constraint conditions when each of the parts is accommodated in the box and the box is placed on the skid. You may calculate the skid number required for mounting of the said box of each part for every day and every supplier.
In this one aspect, the work amount calculation means sets a transportation time when transporting at the predetermined time interval using the schedule information of the delivery flights between each supplier and the production factory, and The number of skids calculated by the appearance calculating means may be assigned to each transportation time, and the number of skids required for each transportation time may be calculated for each supplier.
In this aspect, the information processing apparatus may further include output means for outputting the number, type, and delivery timing of each part delivered from each supplier recalculated by the delivery date planning means.
On the other hand, one aspect of the present invention for achieving the above object is a transportation planning method for planning transportation of the parts when delivering the parts from a plurality of suppliers to produce a finished product. Calculating the number, type and delivery timing of each part delivered from each supplier based on the production plan information of the product, and based on the calculated number, type and delivery timing of each part A step of calculating a packing form when each part delivered from each supplier is placed on a carriage and transported; and each part delivered from each supplier is sent to a production line at a predetermined time interval. A step of calculating the number of carriages transported in each of the transporting times based on the transporting schedule information at the time of transporting, and the calculated package of each part; and the transporting times of the calculated equal intervals Carry the number of trucks in each transport round Shifting the number of trolleys of the same number of trolleys from the trolley to the next transport time, and minimizing the total number of transport times. It may be a transportation planning method characterized by recalculating the number, type, and delivery timing of each part delivered from the front.

  ADVANTAGE OF THE INVENTION According to this invention, the conveyance plan planning apparatus which can optimize conveyance resources, and the conveyance plan planning method can be provided.

It is a block diagram which shows the schematic system configuration | structure of the conveyance planning apparatus which concerns on one embodiment of this invention. It is a figure which shows an example of the state which mounted the box in which components were accommodated on the skid. It is a figure which shows an example of the relationship table | surface which shows the relationship between a supplier and conveyance timing. It is a figure which shows an example of the state which assigned the skid delivered from each supplier with respect to each (circle) in the relationship table of the supplier and conveyance timing shown in FIG. It is a flowchart which shows an example of the resource minimization process flow by a resource minimization process part. It is a figure for demonstrating shifting of the trolley | bogie by a resource minimization process part. It is a figure for demonstrating shifting of the trolley | bogie by a resource minimization process part. It is a figure for demonstrating shifting of the trolley | bogie by a resource minimization process part. It is a figure for demonstrating shifting of the trolley | bogie by a resource minimization process part. It is a figure for demonstrating shifting of the trolley | bogie by a resource minimization process part.

Embodiment Hereinafter, an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a schematic system configuration of a transportation plan planning apparatus according to an embodiment of the present invention. The transportation plan planning apparatus 1 according to the present embodiment includes a delivery instruction calculation unit 2, a delivery package calculation unit 3, an on-site transportation work calculation unit 4, and a resource minimization processing unit 5.

  The transportation planning apparatus 1 temporarily stores, for example, a CPU (Central Processing Unit) that performs arithmetic processing, a ROM (Read Only Memory) that stores arithmetic programs executed by the CPU, processing data, and the like. A hardware configuration is provided with a microcomputer having a random access memory (RAM) as a center. The CPU, ROM, and RAM are connected to each other by a data bus.

  The delivery instruction calculation unit 2 is a specific example of a delivery plan means, and parts delivery plan information for giving a delivery instruction for each part so that a plurality of parts constituting the finished product reach the production line in a so-called just-in-time manner. Calculate The delivery instruction calculation unit 2 includes production plan information stored in the production plan database 6, component part information stored in the component part database 7, parts order condition information stored in the part order condition database 8, and delivery flights. Based on the delivery service schedule information stored in the diagram database 9 and the on-site safety time information stored in the on-site safety time database 10, for example, which parts, when and how many parts are delivered to the production plant (each Calculate part delivery plan information (part types, number, delivery timing). Note that the production plan information, component parts information, parts ordering condition information, delivery service diagram information, and on-site safety time information are not directly related to the databases 6, 7, 8, 9, 10. It may be configured to be input to or preset.

The production plan database 6 stores, for example, information on production plans for finished products such as vehicles and engines (information such as the number of each finished product produced on each production date). The component database 7 stores, for example, information on component parts attached to the finished product (information such as which parts are attached to the finished product). The part ordering condition database 8 stores, for example, part ordering condition information including information such as to which supplier each part constituting the finished product is ordered and how long after the ordering is delivered. . The delivery flight diagram database 9 stores , for example, schedule information of delivery flights such as trucks between the supplier and the production factory . The in-house safety time database 10 stores, for example, safety time information in which parts stay in a production factory by shifting described later.

  For example, when the finished product of the production factory is a vehicle, the delivery instruction calculation unit 2 acquires production plan information such as the number of finished products produced on each production date as follows from the production plan database 6. The production plan information is, for example, X day: 200 vehicles A, 100 vehicles B, 50 vehicles C, X + 1 day: 200 vehicles A, 80 vehicles B, and 70 vehicles C.

  Further, the delivery instruction calculation unit 2 acquires the following component information of each vehicle from the component database 7. As the component information, for example, the component configuration of the vehicle A (two components A, one component B, one component C), and the component configuration of the vehicle B (two components A, two components D) 1), the parts configuration of the vehicle C is (2 parts A, 1 part E, 2 parts).

  And the delivery instruction | indication calculation part 2 uses the production plan information acquired from the production plan database 6 as mentioned above, and the component information acquired from the component parts database 7, and the kind of parts required for each production day And calculate the number. For example, as the required number of parts on the X day, parts a (supplier A): 200 × 2 + 100 × 2 + 50 × 2 = 700, parts b (supplier A): 200 × 1 = 200, parts c ( Supplier B): 200 × 1 = 200

  The delivery instruction planning unit 2 stores the calculated number of parts necessary for each production date in the parts delivery plan database 11 as parts delivery plan information. The delivery instruction planning unit 2 may output the part delivery plan information directly to the delivery package calculation unit 3 without using the parts delivery plan database 11.

  The delivery packaging form calculation unit 3 is a specific example of the packaging form calculation means, and calculates the packaging form of parts delivered from each supplier based on the parts delivery plan information stored in the parts delivery plan database 11. To do. Based on the box size information stored in the box size database 12 and the product condition information stored in the product condition database 13, the delivery package calculation unit 3 determines when the object to be transported on the premises (when the skid is How many are generated). The box size information and the product condition information may be directly input to the delivery package calculation unit 3 without going through the box size database 12 and the product condition database 13, or may be input to the delivery package calculation unit 3 in advance. It may be set.

  The box size database 12 stores, for example, box size information indicating the size of a box that accommodates each part. The product condition database 13 stores product condition information indicating the product condition of boxes on the skid, for example.

  The delivery form calculation unit 3 acquires the following box size information from the box size database 12. Box size information includes, for example, the size (vertical x horizontal x height) of the box in which each part is stored and the type of box (typically the type of box determined by the box size and material), Includes information on the number of parts that can be accommodated. For example, the box size information includes parts a: (box type Box_1, length 300 mm x width 200 mm x height 200 mm, 10 can be accommodated), parts b: (box type Box_2, length 500 mm x width 400 mm x height 600 mm, 4 Can be accommodated).

  The delivery form calculation unit 3 acquires the following product condition information from the product condition database 13. The loading condition information includes, for example, condition information on the height of a box that can be loaded on one skid, condition information that defines whether or not stacking is possible between a certain box type and a certain box type, and the like. . For example, as the integration condition information, the height of 1000 mm per skid is the upper limit, nothing can be placed on the box type Box_2, and the box type Box_1 and the box type Box_3 can be stacked together (FIG. 2). For example, as shown in FIG. 2, the skid is a table on which a load is placed. However, the amount of load placed on one skid (table) may be referred to as one skid.

  The delivery form calculation unit 3 first uses the number of parts of the part delivery plan information acquired from the parts delivery plan database 11 and the number of parts that can be accommodated in the box of the box size information acquired from the box size database 12. 1. Generate information on how many boxes are instructed to be delivered per day. Then, the delivery form calculation unit 3 performs a three-dimensional simulation using the integration condition information acquired from the integration condition database 13 as a constraint, and tries various combinations of boxes, for example, the number of skids is minimized. In this way, the packing form (number of skids) is calculated for each supplier. For example, the packing form on day X is supplier A: 30 skid, supplier B: 50 skid, supplier C: 20 skid.

If the number of box types is small, the delivery form calculation unit 3 may estimate the number of skids by assuming that the volume of the box is 1 m ³ = 1 skid without performing the three-dimensional simulation. If daily production fluctuations are not large, the delivery package calculation unit 3 may use the number of skids obtained empirically in the field survey.

  The delivery packaging form calculation unit 3 stores the estimated delivery packaging form (the number of skids for each supplier) in the transportation object database 14 as transportation object information. The delivery form calculation unit 3 may output the transportation object information directly to the on-site transportation work calculation unit 4 without using the transportation object database 14.

  The on-site transportation work calculation unit 4 is a specific example of the work amount calculation means, and each transportation is based on the diagram information acquired from the delivery flight diagram database 9 and the transportation target information acquired from the transportation target database 14. Calculate the amount of work in the time zone (skid transport amount). The on-site transportation work amount calculation unit 4 first sets the transportation time for transportation at predetermined time intervals using the diagram information acquired from the delivery flight diagram database 9. Then, the on-site transportation work calculation unit 4 assigns the number of skids of the transportation object information acquired from the transportation object database 14 to each transportation time. In the following example, a day is equally divided by a specified number of times (for example, transportation times # 1 to # 12), and parts delivered to the production factory are conveyed to the production line of the production factory at the predetermined time interval. A method will be described.

  FIG. 3 is a diagram showing an example of a relationship table showing the relationship between the supplier and the transportation timing. In FIG. 3, for example, the transportation time # 1 starts 8:00 transportation, the transportation time # 2 starts 9:00 transportation, the transportation time # 3 starts 10:00 transportation, the transportation time # 4 starts 11:00 transportation, It has become.

  The on-site transportation work calculation unit 4 generates a relationship table between the supplier and the transportation timing as described above. The on-site transport work calculation unit 4 first uses the diamond information acquired from the delivery flight diagram database 9 to determine which transport timing (transport time # 1 to transport time # 12) for each supplier A, B, or C. ) To calculate whether the string can be attached.

  For example, as shown in FIG. 3, the time when the delivery of the supplier C can finish the unloading from the truck and start the transportation toward the production line, 8:30, 11:30, 14:30, 17 : 30 is assumed. In this case, it is possible to attach a string to the luggage at the transportation times # 2, # 5, # 8, and # 11 (◯ in FIG. 3) in the factory.

  Next, the on-site transportation work calculation unit 4 assigns a plurality of skids delivered from each of the suppliers A, B, and C to each circle in the relationship table between the suppliers and the transportation timing. (FIG. 4). Here, it is assumed that a plurality of skids delivered from the suppliers A, B, and C are placed on a plurality of carts, and the carts are connected and transported. For example, it is assumed that one skid is placed on one carriage.

  For example, when one person can carry 6 carts at a time, as shown in FIG. 4, the carriage in the transportation time # 1 uses 12 carriages. I understand. Further, as described above, the work amount is expressed by using “the number of carriages that can be carried at one time”. However, the work amount is not limited thereto, and may be expressed by, for example, “time required for one transport operation”. In this case, the on-site transportation work calculation unit 4 uses the traveling time of each carriage in the transportation work and the time for supplying the parts box from each carriage to the production line (how many seconds it takes to supply one box). Calculate the transport time per time. The on-site transport work calculation unit 4 stores the work amount information calculated as described above in the work amount database 15.

  The resource minimization processing unit 5 is a specific example of the resource minimizing means, and based on the work amount information acquired from the work amount database 15 and the optimization condition information stored in the optimization condition database 16, While appropriately shifting the transportation timing (delaying it), a resource minimization process is performed to calculate transportation plan information that is an optimal transportation resource with little variation in one day. The optimization condition database 16 stores various kinds of optimization condition information necessary for performing a resource minimization process described later.

  The resource minimization processing unit 5 stores the calculated transportation plan information in the on-site transportation plan database 17. The transportation plan information stored in the local transportation plan database 17 is output by the output unit 18. The transportation plan information is output as a transportation instruction form by a printer or the like or displayed by a display device, for example. Further, the resource minimization processing unit 5 stores the shifted time in the local safety time database 10 as the local safety time information in the resource minimization process. Note that the resource minimization processing unit 5 may directly output the on-site safety time information to the delivery form calculation unit 3 without using the on-site safety time database 10.

  Production plan database 6, component parts database 7, parts ordering condition database 8, delivery service diagram database 9, on-site safety time database 10, parts delivery plan database 11, box size database 12, product condition database 13, transportation object database 14, the work load database 15, the optimization condition database 16, and the on-site transportation plan database 17 are configured as separate bodies. Each of the databases 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 can be configured by an arbitrary storage device such as a magnetic disk device, an optical disk device, or a RAM. it can.

  Next, resource minimization processing by the resource minimization processing unit will be described in detail. FIG. 5 is a flowchart illustrating an example of a resource minimization processing flow by the resource minimization processing unit.

The resource minimization processing unit 5 searches for a transportation time that minimizes the number of remaining carts (step S1). The resource minimization processing unit 5 calculates the number of excess carts using, for example, the following formula. In the following formula, MOD (a, b) is a function for calculating the remainder when a is divided by b.
Surplus number of trucks = MOD (number of trucks in each transport cycle, number of trucks that can be transported at one time)
For example, as shown in FIG. 4, when the number of carriages that can be carried at one time is six in the transportation time # 3, the number of the remaining carriages = MOD (11, 6) = 5. The resource minimization processing unit 5 calculates the number of surplus carts in each transport time using the above formula, searches for the transport times that minimize the number of surplus carts, and sets the retrieved transport times to the variable “transport times”. .

  The resource minimization processing unit 5 selects a cart, for example, in units of suppliers in each transportation time (step S2). The resource minimization processing unit 5 preferentially selects, for example, a supplier cart with a small number of appearances per day. In the case shown in FIG. 4, the resource minimization processing unit 5 preferentially selects the trolley of supplier B (appears 6 times) over the trolley of supplier A (appears 12 times), and The trolley of supplier C (appears four times) is preferentially selected over the trolley (appears six times).

  The resource minimization processing unit 5 determines whether or not the supplier's cart selected in the above (Step S2) has already been “trially moved (unfixed shift)” or “moved (fixed shift)”. Determine (step S3). Here, shifting means shifting the timing of carriage transportation from the transportation time to the next transportation time.

  When the resource minimization processing unit 5 determines that the cart of the selected supplier has not already been “trially moved (trial shift)” or “moved (determined shift)” (NO in step S3), the following (step The process proceeds to S4). On the other hand, when it is determined that the cart of the selected supplier has already been “trially moved” and “moved” (YES in step S3), the resource minimizing processing unit 5 returns to the above-described process (step S2). In addition, although the example which performs a shift once is shown in FIG. 5, it is not restricted to this, You may perform a shift twice or more.

  The resource minimization processing unit 5 shifts the transport timing of the cart for each supplier (step S4). Thereby, the work amount per hour can be adjusted. In addition, about the trolley | bogie of the same supplier, the said shift is performed in the state which maintained the conveyance space | interval.

  For example, as shown in FIG. 6, when shifting is performed with respect to a certain carriage, the same supplier truck is also shifted at an equal pitch while maintaining the transport interval. That is, the resource minimization processing unit 5 performs the next transportation times # 2 and # 4 only for the same number (one in this case) of the carts transported at the equally spaced transportation times # 1, # 3, and # 5. , Move to # 6.

  In this way, by performing shifting while keeping the conveyance interval, it is possible to always supply parts to the production line at a constant interval. In addition, when parts are always used at the same transportation interval on the production line, it is always necessary to have a certain amount of safety stock.

  Moreover, it is preferable that the resource minimization processing unit 5 is executed for each supplier when the carriage is shifted. When carrying out transportation based on a plan, it is necessary to issue a transportation instruction. At this time, it is possible to easily determine whether or not the cart is the object of shifting by looking at the supplier column of the skid label attached to the skid itself or the supplier column attached to the box. Note that the resource minimization processing unit 5 executes shifting in units of suppliers. However, the resource minimizing processing unit 5 is not limited thereto, and shifting may be performed in arbitrary units.

  The resource minimization processing unit 5 sets a “tryed” flag for the cart in the supplier unit for which the above-described shifting has been executed (step S5).

  The resource minimization processing unit 5 determines whether or not the number of times of transportation is smaller than the total number of times of transportation as a result of executing the shift (step S6). For example, in FIG. 7, if the number of carts that one person can carry at a time is five, the total number of necessary resources is nine, and the total number of times of conveyance is nine. When shifting is executed in the state of FIG. 7, the required resources are 6 in total as shown in FIG. 8, and the total number of times of transportation is 6. Therefore, the resource minimization processing unit 5 determines that the total number of times of transportation is reduced from 9 times to 6 times as a result of executing the shift.

  When the resource minimization processing unit 5 determines that the number of times of transportation is smaller than the total number of times of transportation as a result of executing the shift (YSE in step S6), the process proceeds to the following process (step S9). On the other hand, when the resource minimization processing unit 5 determines that the total number of times of transportation does not decrease the number of times of transportation (NO in step S6) as a result of executing the above shift, the process proceeds to the following (step S7).

  The resource minimization processing unit 5 determines whether or not the difference between the minimum number of carts and the maximum number of carts has become smaller in the number of carts in each transportation cycle by executing the above-described shift (step S7). . When the resource minimization processing unit 5 determines that the difference between the minimum number of carts and the maximum number of carts is small in the number of carts in each transportation cycle by executing the above-described shift (YES in Step S7), The process proceeds to the following (step S9). On the other hand, when the resource minimization processing unit 5 determines that the difference between the minimum number of carts and the maximum number of carts is not small in the number of carts in each transportation cycle by executing the above-described shift (step S7). NO), the process proceeds to the following (step S8).

  For example, in FIG. 9, if the number of carts that one person can carry at a time is five, the total number of necessary transportation resources is nine, the total number of transportation is nine, and the maximum number of carts is seven, which is the minimum. The difference from the number of three cars is four. When shifting is performed in the state of FIG. 9, as shown in FIG. 10, the necessary transportation resources are 9 people in total, and the total number of transportation times is 9 times, but the maximum number of carriages is 6 and the smallest The difference from the number of trucks, which is four, is two, which is smaller. Therefore, in the example shown in FIG. 9 and FIG. 10, since the difference between the minimum number of carriages and the maximum number of carriages is small in the number of carriages in each transportation time by performing the above-mentioned shift, resource minimization is achieved. The processing unit 5 employs the conveyance pattern shown in FIG. In the above example, one carriage is shifted, but not limited to this, a plurality of carriages may be shifted.

  In (Step S8), the resource minimization processing unit 5 does not improve the transport pattern even if the shift is performed as described above, so the shift trial is temporarily stopped and the next supplier is shifted. Therefore, the process returns to the above (step S2). Note that the resource minimization processing unit 5 returns to the above-described process (step S1) when the process (step S8) is executed even if all possible loads are shifted.

  In (Step S9), the resource minimization processing unit 5 performs a process for determining the executed shift. The resource minimum processing unit 5 substitutes the value of the current number of times of transportation for the total number of times of transportation, and clears the “tested” flag. In order to shorten the calculation time, the resource minimization processing unit 5 determines the shift when the shift for improving the transport pattern can be executed as described above, and returns to the process of (Step S1).

  Note that the resource minimization processing unit 5 executes the shifting trials in the order of the smaller number of carts in each transportation time. For example, when the number of carts that one person can carry at a time is five, the resource minimization processing unit 5 first eliminates the transport times of one surplus cart, and then the number of surplus carts is two. The shift trial is executed so as to eliminate the transportation times, eliminate the transportation times with the surplus trucks of 3, and eliminate the transportation times with the surplus trucks of 4. In this way, the transport times with a small number of trolleys have a higher probability of reducing the total number of transport times than the transport times with a large number of trolleys, so that the solution can be converged earlier.

  When the resource minimization processing unit 5 repeats the processes of (Step S1) to (Step S9) described above, all the resources are shifted (YES in Step S10), and when a predetermined end condition is determined (Step S11). YES), the resource minimization process is terminated. Note that the resource minimization processing unit 5 may end the resource minimization process after performing the above calculation a specified number of times or after completing the above calculation at a predetermined time. By executing this resource minimization process, the number of transporting carts per time approaches the upper limit value of the number of carts that one person can transport at a time, and the total number of transporting operations decreases. Accordingly, the transportation resources can be reduced. The resource minimization processing unit 5 outputs, for example, the on-site transportation plan information that has been subjected to the resource minimization processing as described above, as a form, a signal display, or an automatic facility for transportation, etc. To give instructions. Specifically, by instructing a supplier how many times to carry it, a person or equipment moves the target supplier's skid to the departure lane in a timely manner, Can wait.

  At this time, the resource minimization processing unit 5 calculates the safety time on the premises. If the transport timing of the skids to be transported is shifted and delayed, the arrival of parts will be delayed as much as viewed from the production line side. Therefore, if parts are secured in stock for the delay, safety against parts supply shortage increases. For example, when the interval of each transportation time is 1 hour, if the transportation timing for one transportation is shifted, it is preferable to keep the parts for one hour as safety stock, and that one hour is the safety time. The resource minimization processing unit 5 calculates the safety time as described above for all the components that have been shifted as described above, and stores them in the local safety time database 10 as safety time information.

  The delivery instruction calculation unit 2 outputs the delivery instruction and then delivers and accepts it to the actual production factory (usually the external logistics lead time for logistics between the supplier and the production factory). In addition to the above, the time for transportation to the production line after receiving the product at the production factory (on-site logistics lead time) is added, and the calculated safety time is added. Accordingly, it is possible to perform a backward calculation in consideration of only a necessary time from the timing of using the parts on the production line, and to issue a delivery instruction to each supplier at a just right timing. As a result, it is possible to carry out a delivery instruction that is just-in-time and requires minimal transportation resources on the premises. That is, transportation resources can be optimized.

  Note that the present invention is not limited to the above-described embodiment, and can be changed as appropriate without departing from the spirit of the present invention.

DESCRIPTION OF SYMBOLS 1 Transportation planning device 2 Delivery instruction calculation part 3 Delivery package figure calculation part 4 On-site transportation work calculation part 5 Resource minimization processing part 6 Production plan database 7 Component parts database 8 Parts ordering condition database 9 Delivery flight diagram database 10 On-site safety time Database 11 Parts delivery plan database 12 Box size database 13 Product condition database 14 Transport target database 15 Work load database 16 Optimization condition database 17 On-site transport plan database 18 Output section

Claims (9)

A transportation plan planning device that plans transportation of parts when delivering parts from a plurality of suppliers to produce a finished product,
A delivery planning means for calculating the number, type, and delivery timing of each part delivered from each supplier based on the production plan information of the finished product;
Packing form for calculating the packing form when each part delivered from each supplier is placed and transported on a cart based on the number, type and delivery timing of each part calculated by the delivery planning means Calculation means;
Based on the transportation schedule information when each part delivered from each supplier is transported to the production line at a predetermined time interval , and the packaging form of each part calculated by the packaging form calculation means. And a workload calculation means for calculating the number of carriages transported in each of the transportation times,
The total number of times of transportation is minimized by shifting the number of trolleys in the transportation times at equal intervals calculated by the workload calculation means from the trolleys transported in each transportation time to the next transportation time only for the same number of trolleys. Resources minimizing means,
The delivery planning means recalculates the number, type, and delivery timing of each part delivered from each supplier by using the delay time of parts caused by the shifting executed by the resource minimizing means. And
The number of carriages that can be carried at one time in each of the transportation times is preset,
The total number of transportation times is the sum of the number of transportation times of each transportation time when transported at a time with the set number of carriages,
Transportation planning device characterized by that. A transportation planning apparatus according to claim 1,
The number of carriages that can be carried at one time in each of the transportation times is preset,
The said resource minimization means performs the said shift so that the difference of the largest trolley number and the minimum trolley number in each conveyance time may reduce, The conveyance plan planning apparatus characterized by the above-mentioned. A transportation planning apparatus according to claim 1 or 2,
The work amount calculation means calculates the number of carriages transported in each transportation time for each supplier,
The resource minimizing means executes the shifting for each supplier, and further executes the shifting preferentially from the supplier having a small number of appearances in the entire transportation times. Transportation planning device. A transportation plan planning device according to any one of claims 1 to 3,
The resource minimizing means divides the number of trolleys for each transportation time by the number of trolleys that can be transported to the production line at a time to calculate the number of surplus trolleys, and executes the shift in order from the transportation time with the least number of trolleys A transportation planning device characterized by A transportation plan planning device according to any one of claims 1 to 4,
The delivery plan means is:
The production plan information indicating the number of finished products produced per production date, component information indicating the type and number of parts constituting the finished product, and part ordering condition information indicating the supplier and delivery date of each part And each of the parts for production on the production line based on the schedule information of the delivery service between each supplier and the production factory and the safety time information indicating the time that each part stays due to the shift. A transportation planning apparatus characterized in that the number, type, and delivery timing of each delivered part are calculated so as to arrive together. A transportation plan planning device according to any one of claims 1 to 5,
The delivery planning means includes: an external logistics lead time from delivery to a production factory from each supplier; an on-site logistics lead time from delivery to transportation to the production line; A transportation plan characterized in that, based on a time obtained by adding a safety time indicating a staying time, the timing at which each part reaches the production line from each supplier in accordance with production on the production line is calculated. Planning device. A transportation plan planning device according to any one of claims 1 to 6,
Each part delivered from the supplier is housed in a box, the box is placed on a skid, the skid is transported by the carriage,
The package appearance calculation means
Based on box size information indicating the size of the box in which each part is accommodated, and product condition information indicating a constraint condition when each part is accommodated in the box and the box is placed on the skid. And a transportation plan drafting device for calculating the number of skids required for placing the parts box for each production date and for each supplier. A transportation plan planning device according to claim 7,
The work amount calculating means sets a transportation time when transporting at the predetermined time interval using the schedule information of a delivery flight between each supplier and the production factory, and is calculated by the package shape calculating means. A transportation plan drafting apparatus, wherein the number of skids assigned is assigned to each transportation time, and the number of skids required for each transportation time is calculated for each supplier. A transportation plan planning device according to any one of claims 1 to 8,
A transportation plan planning apparatus, further comprising output means for outputting the number, type, and delivery timing of each part delivered from each supplier recalculated by the delivery date planning means.

Images