JP2007018083A - Method for preparing operation plan of transport vehicle - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a method for preparing the transport plan of a transport vehicle by making a transport vehicle transport raw materials manufactured by a plurality of factories A to a plurality of factories B, and satisfying the request time, request quantity, request components and request temperature of each reaction container in the factory B when pouring raw materials in a plurality of transport vehicles to a reaction container, and equalizing the amounts of raw materials in each factory B, and quickly calculating the proper transport destination of the transport vehicle for minimizing the component adjusting amounts of each reaction container as much as possible. <P>SOLUTION: Processing for predicting the arrival time of a factory B of each transport vehicle, an optimization calculation processing for averaging raw materials, and for minimizing component adjusting amounts and processing for performing simulation by a detail simulator where a circulation phenomenon is modeled in detail are repeated so that it is possible to gradually decide the transport destination of the transport vehicle. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a transport vehicle operation plan creation method for optimal transport of raw materials by transport vehicles, and there are a plurality of factories A that manufacture raw materials and a plurality of factories B that use the raw materials. This is a technique suitable for use in determining a transport destination factory B to which each transport vehicle is directed in a process in which a plurality of transport vehicles are loaded and transported to each factory B.

  In manufacturing processes of various industries such as oil production, gas production, chemical production, soft drink production, etc., as shown in FIG. 3, a plurality of factories 7 (hereinafter referred to as factory A) that produce raw materials, In many cases, there are a plurality of factories 8 (hereinafter referred to as factories B) to be used, and a plurality of transport vehicles 4 are loaded with the raw materials produced in each factory A and transported to each factory B. In order to transport the raw material from the factory A to the factory B, a tank lorry running on the road and a freight car running on the track are often used. When the transport vehicle 4 arrives at the factory B, the raw material is poured into the reaction vessel 5 in the raw material mixing step. Thereafter, the raw materials in the reaction vessel are subjected to component adjustment in order to match the target components and shipped as products. Each factory A may produce different raw materials, and each factory B may produce different products.

  Since the product cannot be manufactured if the raw material does not arrive at the factory B, it is necessary to appropriately supply the raw material from the plurality of factories A to the plurality of factories B so as not to cause a shortage of the raw material. At this time, if there are a plurality of factories B and the distances between the factories are different, if a factory B that is a transport destination of the transport vehicle is not properly specified, there is a surplus of raw materials in one factory B, Causes a problem of shortage of raw materials, and misses the opportunity to manufacture products.

  In addition, the ingredients of the raw material produced at the factory A are not constant and may vary considerably. In this case, as disclosed in Patent Document 1, if the raw materials are mixed randomly, the component adjustment amount of the reaction vessel increases, so the raw material component of the transport vehicle and the target component of the reaction vessel It must be mixed appropriately.

  Accordingly, it is important to appropriately determine the transport destination of each transport vehicle so as not to cause a shortage of raw materials in the factory B and to reduce the component adjustment amount of the reaction vessel as much as possible. In addition, due to the capacity restrictions of the reaction vessel component adjuster, there may be restrictions on the components and temperature related to the mixed raw material before adjusting the reaction vessel components. It was a very difficult problem.

  In relation to this problem, Patent Document 1 treats it as a mixed integer programming problem, and defines a linear equation for the restrictions on the amount poured into each reaction container of each transport vehicle, the restrictions on the component adjustment amount of each reaction container, and the like. And solve the optimization problem with the objective function of the sum of the component adjustment amount of the raw material in the reaction vessel, the sum of the component adjustment amount of the raw material in the transport vehicle, and the sum of the operation cost of the transport vehicle, and each reaction vessel of each transport vehicle We propose a method to find the optimal amount of raw material to be poured into the tank and the optimal component adjustment amount in each transport vehicle.

JP 2003-15728 A

  However, with this method, it is necessary to represent the distribution phenomenon of the entire transport process from the factory A to the factory B by linear inequality, and there is a problem that the number of variables and constraint expressions to be solved becomes large.

Moreover, in the case of this problem, it is necessary to determine the transport destination of the transport vehicle, and this variable must be an integer. For example, a variable representing the transport destination of the transporter k and s _kj, the s _k1 1 in carrying the first factory B, and defines the s _k2 1 and in carrying the second plant B, s _kj is An integer solution of 0 or 1 must be obtained, and s _kj must not be a real solution with 0.8. It is known that the calculation time of an optimization problem for which such an integer solution must be obtained is proportional to the power of the number of integer variables. In the case of this problem, when the entire transport process is formulated, a large number of integer variables such as s _kj appear (for example, the order of transport vehicles entering the intermediate process becomes an integer variable), and a practical time I can't get a solution.

  Accordingly, an object of the present invention is to provide a method for calculating a transport destination of a transport vehicle by calculating an appropriate transport destination of the transport vehicle as quickly and as quickly as possible.

As means for solving the problems, the transportation vehicle operation plan creation method of the present invention is arranged in a plurality of factories A that manufacture raw materials and a plurality of factories B through a single or a plurality of intermediate processes. A method for preparing an operation plan for the plurality of transport vehicles in a process of transporting the raw materials to each reaction container by a plurality of transport vehicles, and the results of the factory A departure time and the raw material loading amount of each transport vehicle at the plan start time Value and plan value, and the step of inputting the intermediate process passing time and the actual value of factory B arrival time of each transport vehicle, and the loaded raw materials for all transport vehicles for which the transport destination is not fixed Predicting the arrival time of all the transportable factories B, and the transport time of all the transport vehicles whose transport destinations have been determined, the arrival time of the factory B as the transport destination, Planned value of required amount of raw material and required time for reaction vessel The first constraint on the total amount of raw materials that each reaction container pours from each transport vehicle, the second constraint on the total amount of raw materials that each transport vehicle pours into each reaction vessel, and the destination A third constraint on the arrival time of each transport vehicle and the required time of the reaction container poured from the transport vehicle, a fourth constraint that there is only one transport destination for each transport vehicle, and each transport destination A step of determining an objective function for leveling the material loading amount of the transport vehicle heading toward the vehicle, and satisfying the first to fourth constraints, performing an optimization calculation on the objective function, and obtaining a transport destination of each transport vehicle Modeling the transport process from the factory A to the factory B, the step of determining the transport destinations of some transport vehicles determined in advance at the transport destination determined in the optimization calculation Set from the plan start time in the logistics simulator Performing a simulation until a later time, and predicting an intermediate process passing time and a factory B arrival time of each transport vehicle after the set time, the time after the set time as a new plan start time, It is characterized in that the transport destinations of a plurality of transport vehicles are determined by repeating the steps until the transport destinations of all transport vehicles are determined.
In addition, when adjusting the raw material components in the reaction vessel, the plurality of factories A for producing the raw material, and each reaction vessel arranged in the plurality of factories B through a single or a plurality of intermediate processes, A method for preparing an operation plan of the plurality of transport vehicles in a process of adjusting raw material components in a reaction container after transporting the raw materials by a plurality of transport vehicles, wherein the starting time of each transport vehicle at the factory A, the raw materials For the step of inputting the actual value and plan value of the load capacity and raw material components, and the actual value of the intermediate process passing time and factory B arrival time of each transport vehicle, and for all transport vehicles for which the transport destination is not fixed The arrival times and arrival components of all factories B capable of transporting the loaded raw materials, and the arrival times and arrival components of the destination plant B for all transport vehicles whose transportation destinations are determined. Predicting the process, and Input the arrival time and arrival components of B, the required amount of raw materials for each reaction vessel, the required time, and the planned value of the target component after component adjustment, and the total amount of raw materials that each reaction vessel is poured from each transport vehicle The first restriction of the second, the second restriction on the total amount of raw materials that each transport vehicle pours into each reaction vessel, the arrival time of each transport vehicle at the destination and the requirement of the reaction container poured from the transport vehicle The third constraint on time, the fourth constraint that there is only one transport destination for each transport vehicle, and at the same time leveling the material load of the transport vehicle toward each transport destination, and at the same time, the components of each reaction vessel Determining an objective function for minimizing the adjustment amount; satisfying the first to fourth constraints; performing optimization calculation for the objective function to obtain a transport destination of each transport vehicle; and the optimization A certain amount of transportation In the logistics simulator that models the transportation phenomenon from the factory A to the factory B, the simulation from the planning start time to the set time is performed in the step of determining the vehicle transport destination, and after the set time And predicting the factory B arrival time and the arrival component of each transport vehicle, and setting the time after the set time as a new plan start time, the steps are transport destinations of all transport vehicles. It is also possible to determine the transport destinations of a plurality of transport vehicles by repeating the process until it is determined.
In addition to the above constraints, a fifth constraint on the raw material components and required components of each reaction vessel and a sixth constraint on the raw material temperatures and required temperatures of each reaction vessel are added to determine the transport destination of the transport vehicle. May be.

  According to the present invention, by using a simulator that simulates a physical distribution phenomenon from factory A to factory B, the number of variables and constraint equations to be solved can be greatly reduced, and the computer load required for calculation can be reduced. In consideration of the amount of raw materials required at each transport destination and the restrictions on components and temperature, the transport destination of the transport vehicle that optimizes the level of raw material amount and the component adjustment amount toward each transport destination in a short time. Therefore, it is possible to prevent shortage of raw materials and reduce component adjustment costs. In addition, since transport vehicles are directed to each transport destination in a well-balanced manner, unnecessary transport vehicles can be reduced, and the total number of transport vehicles can be reduced. Furthermore, since the time for recalculation is short even when there is a difference between the calculation and the actual result, it is possible to always give an appropriate transport vehicle operation instruction.

  Preferred embodiments of the present invention will be described below with reference to the accompanying drawings. FIG. 1 is a diagram showing an embodiment in which all processes according to the present invention are realized by a single computer. FIG. 2 is a flowchart showing a calculation process for the operation plan creation method.

  The input device 1 is a keyboard, a mouse, or a device connected by a network, and the required amount, required component, required temperature, required time of each reaction container before component adjustment, and target component after component adjustment, and , Process transit time of each transport vehicle (factory A departure time, intermediate process arrival / entry / departure time, factory B arrival time), raw material amount, raw material component, raw material temperature actual value (planned value for empty transport vehicles) Is input to the computer main body 2 (step S201). Here, “required” means a restriction that must be adhered to and established for each reaction vessel, “actual value” means past measured value, and “planned value” means future predicted value. ing.

  The computer main body 2 includes a central processing unit, a main storage memory, a storage device such as a hard disk, and the like, and operates according to instructions of a program stored in the storage device. First, the computer main body 2 uses the data read from the input device 1 and various constant data (such as the determined number of transport vehicles and the simulation time range in the repeated calculation) stored in the storage device or program. Until the transportation destination is determined, the processing of steps S202 to S206 (corresponding to 11 to 14 in FIG. 1) is repeatedly performed, and the transportation destination of the transport vehicle thus obtained is output to the output device 3.

  The output device 3 is a display, a printer, a device connected via a network, or the like.

  The principle of the transportation plan creation method of the present invention will be described. The item to be determined is the transport destination of the transport vehicle, but it is necessary to consider many restrictions such as avoiding interference between transport vehicles due to the processing capacity in the intermediate process, and restrictions on entering and leaving the vehicle in the raw material mixing process of Factory B There is. In principle, it is possible to obtain a solution by mixed integer programming using a constraint equation that includes all these constraints, but it is impossible to obtain a solution in a practical time because of the processing power of the computer. It is.

  Therefore, in the process of determining the transport destination of the transport vehicle (FIG. 2), the distribution phenomenon from the factory A to the factory B, for example, the interference between the transport vehicles in the intermediate process, etc. is calculated by the distribution simulator in step S206. It is a feature of the invention. In order to perform a simulation using the logistics simulator, it is necessary to determine the transport destination of the transport vehicle. Therefore, before the simulation, each transport vehicle moves in step S202 (corresponding to 11 in FIG. 1). Predict the arrival times of all possible factories B as accurately as possible with relational expressions that do not require repeated calculations, and on the basis of the predicted arrival times, equations and inequalities for determining the transport destination of the transport vehicle in step S203 Create a constraint equation and define an objective function that quantitatively represents the quality of the transportation plan (corresponding to 15 in FIG. 1). In step S204, a solution that satisfies the constraint equation and minimizes the objective function is a mixed integer. Solved by the planning method, the transport destination of each transport vehicle is obtained (corresponding to 12 in FIG. 1).

  However, when there is interference between transport vehicles from factory A to factory B, the factory B arrival time predicted in step S202 is not accurate. In particular, for transport vehicles whose factory A departure time is far away from the planned start time, the factory B arrival time accumulates prediction errors, and the deviation becomes large.

  Therefore, instead of determining the transport destinations of all transport vehicles at the determined transport destination of transport vehicles, in step S205, the transport destinations of some transport vehicles are set in order of the factory A departure time. Confirmed (corresponding to 13 in FIG. 1), and in step S206, the detailed logistics simulator performs a logistics simulation from the plan start time to the set time later, and the transit time of the transport vehicle after the set time (intermediate process arrival) (Entrance / departure time, arrival time at factory B) Predict the amount of raw material, raw material component, and raw material temperature (corresponding to 14 in FIG. 1).

  Then, the time after the set time is newly regarded as the plan start time, and the processing of steps S202 to S206 is repeated to gradually determine the transport destinations of all transport vehicles. Here, the partial transport vehicle is a transport vehicle whose transport destination needs to be determined at the next physical distribution simulation. For example, when the transport destination of the transport vehicle leaving the factory A cannot be changed. The transport vehicle is scheduled to leave the factory A after a set time from the planned start time.

  In this way, by gradually determining the transport destination of the transport vehicle, it is possible to reduce the deviation in the prediction error of the factory B arrival time, and to obtain a highly accurate solution in a short time.

(Example)
Hereinafter, the case where the physical distribution process from the factory A to the factory B is FIG. 4 will be described as an example. In the present embodiment, when the transport vehicle goes to the first factory B, the first intermediate process is used, and when the transport vehicle goes to the second factory B, the second intermediate process is used. Even when the number of steps is different or when other conditions are added, it can be derived in the same manner as in this embodiment. Table 1 shows symbols of variables and constants used in the relational expressions.

  First, in step S201, the required raw material amount / required component / required time / required temperature related to the raw material before component adjustment required by the reaction vessel of each factory B from the input device 1, and the target component after component adjustment, and The actual value and the planned value of the process passing time, raw material amount, raw material component, and raw material temperature of each transport vehicle are input and stored in the storage device of the computer main body 2.

  Next, in step S202, all factory B arrival times that can be transported are predicted for each transport vehicle from the process passing step of each transport vehicle. At this time, only the arrival time of the factory B is predicted for a transport vehicle for which the transport destination is determined, and all the transport times of the factory B that can be transported are determined for a transport vehicle for which the transport destination is not determined. Predict. For example, an expression such as (Expression 1) is used for predicting the arrival time.

  (Equation 1) is a simple example that does not consider the interference between transport vehicles, but may be changed to a more complicated equation that considers the interference between transport vehicles. In addition, when the current position of the transport vehicle can be obtained from time to time, the arrival time can be predicted with higher accuracy using the current position of the transport vehicle.

Next, in step S203, the following equality / inequality constraints relating to the determination of the transport destination of the transport vehicle are created.
(1) The first constraint on the total amount of raw materials poured from each transport vehicle k in one reaction vessel i is formulated as shown in (Formula 2) below.

(2) The second constraint on the total amount of raw materials that one transport vehicle k pours into each reaction vessel i is formulated as shown in (Equation 3) below.

(3) The third constraint on the arrival time of each transport vehicle k and the required time of the reaction container poured from the transport vehicle is formulated as shown in (Formula 4) below.

(4) The fourth constraint that there is only one transport destination for each transport vehicle is formulated as in the following (Expression 5) and (Expression 6).

(5) The 5th restriction | limiting about the raw material component of each reaction container and a request | requirement component is formulated like the following (Formula 7) and (Formula 8).

(6) The sixth constraint on the raw material temperature and the required temperature of each reaction vessel is formulated as shown in (Equation 9) below.

(7) The objective function for leveling the raw material amount of the transport vehicle heading to each transport destination is formulated as shown in (Equation 10) below.

(8) The objective function that minimizes the sum of the component adjustment amounts of each reaction vessel is formulated as in the following (Expression 11) and (Expression 12).

(9) the objective function for performing the optimization calculation, it is assumed that the weighted adjustment factor W to the J ₂ and J ₁ (Formula 10) (Formula 12), the following equation (13).

Since the constraint equations and objective functions described above are all linear equations and inequalities, the equality / inequality constraint equations shown in (Equation 2) to (Equation 12) are satisfied in step S204, and (Equation 13 The optimization calculation that minimizes the objective function indicated by () is performed using a mixed integer programming or the like, and the transport destination s _kj of each transport vehicle can be obtained.

  Next, in step S205, the transport destinations of some transport vehicles are determined in order of the factory A departure time in the transport vehicles whose transport destinations have not been determined, and determined in the subsequent calculations. The transport destination of the transport vehicle shall not be changed. For example, the transport destination of the transport vehicle that leaves the factory A is determined between the planned start time and the set time.

  Next, in step S206, the state of the transport vehicle after the set time is predicted by a detailed simulator that models the logistics phenomenon in the transport process from the factory A to the factory B. In this example, the detailed simulator can be modeled by a Petri net as shown in FIG.

In FIG. 5, symbols (F (p ₁ , p ^ ₁ ) (p ^ notation means that ^ is attached on p), etc.) described in the output arc of the transition) Is the time until the token output to the outgoing place after the transition is ignited can be ignited next, and means the travel time of the transport vehicle and the processing time in the intermediate process. When no symbol is written in the output arc, it means that ignition is possible at time zero.

The symbol written in the input arc of the transition means the firing condition of the transition. For example, if [s _k1 = 1], the token in the place 19 (meaning a transport vehicle) This means that the token of the first intermediate process can be ignited, and if it is [arrival order], it means that the token can be ignited in the order in which the tokens arrived at the intermediate process.

  In order to simplify the explanation, a simple Petri net as shown in FIG. 5 has been described as an example. However, in a more complicated transportation process, the firing condition of the transition may be described by an if-then rule or the like.

  A token is placed in the detailed simulator using the Petri net model as shown in FIG. 5 from the process passing time of the transport vehicle input by the input device 1, and simulation up to the set time is performed, and transport at that time is performed. Predict the vehicle process passage time.

If there is a transport vehicle whose destination has not yet been determined after the simulation in step S206, the plan start time is set as the time after the simulation (plan start time + set time), and steps S202 to S206 are repeated. Thus, the transport destination s _kj of all transport vehicles is gradually determined. As described above, if the calculation is repeatedly performed and the transport destination of the transport vehicle is gradually determined, the accuracy of the transport vehicle factory B arrival time a _kj calculated in step S202 greatly affects the optimality. Few.

  Although the constraint equations and objective functions according to the present invention have been described in detail as examples, the present invention is not limited to the examples.

Also, if the number of transport vehicles is very large, the number of integer variables also increases, and if the optimization calculation in step S204 takes a long time, the transport vehicles leave the factory A quite in the future from the planned start time during the repeated calculation. However, since it is not necessary to accurately determine the transport destination, the transport destination s _kj may be handled as a real variable.

It is a block diagram explaining an example of schematic structure at the time of implementing all the processes concerning this invention with one computer. It is a flowchart which shows the calculation process for the raw material optimal conveyance destination calculation method. It is a figure explaining an example of the physical distribution process from the factory A which is a raw material manufacturing factory to the factory B which is a conveyance destination. It is a figure explaining the physical distribution process from the factory A used in an Example to the factory B. FIG. It is a figure which shows the Petri net model of the physical distribution process of FIG.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 ... Input device 2 ... Computer main body 3 ... Output device 4 ... Transportation vehicle 5 ... Reaction container before component adjustment 6 ... Reaction container after component adjustment 7 ... Factory A
8 ... Factory B
9 ... Raw material mixing step 10 ... Transport path 11 ... Process for predicting arrival times of all factories B to which each transport vehicle can move 12 ... Optimization calculation for calculating the transport destination of each transport vehicle 13 ... Some transport vehicles 14 ... Detailed simulation for obtaining the factory B arrival time and arrival temperature / arrival component in detail 15 ... Objective function 16 ... Reaction vessel during component adjustment 17 ... Component adjustment step 18 ... Intermediate step 19 -21 ... Place meaning first to third factory A 22-27 ... Transition ignited when starting from factory A to intermediate process 28, 29 ... Place meaning arrival at first and second intermediate process 30, 31 ... Transition that ignites when entering the first and second intermediate steps 32, 33 ... Place 34, 35 meaning that the vehicle is entering the first and second intermediate steps ... Place 36, 37, meaning that the first and second intermediate processes are vacant. Transitions 38, 39 that ignite when starting from the intermediate process to factory B. 38. Meaning Place 40… Token meaning transport vehicle

Claims (4)

The plurality of transports in a process of transporting the raw materials by a plurality of transport vehicles to a plurality of factories A that manufacture the raw materials and reaction containers arranged in the plurality of factories B through a single or a plurality of intermediate steps A vehicle operation plan creation method,
A step of inputting factory A departure time and actual value and plan value of raw material loading amount of each transport vehicle, and actual value of intermediate process passing time and factory B arrival time of each transport vehicle at the plan start time;
For all transport vehicles for which the transport destination has not been determined, the arrival time of all factories B capable of transporting the loaded raw materials and for all transport vehicles for which the transport destination has been determined Predicting the arrival time of factory B of
The first restriction on the total amount of raw materials poured into each reaction container from each transport vehicle, with the arrival time of the factory B, the required raw material amount of each reaction container and the planned value of the required time as inputs, and each transport A second constraint on the total amount of raw materials that the vehicle pours into each reaction container; a third constraint on the arrival time of each transport vehicle at the destination and the required time of the reaction container poured from the transport vehicle; Determining a fourth constraint that each transport vehicle has only one transport destination and an objective function for leveling the material load of the transport vehicle toward each transport destination;
Satisfying the first to fourth constraints, performing an optimization calculation on the objective function, and determining a transport destination of each transport vehicle;
A step of determining a predetermined transport destination of a transport vehicle at the transport destination determined by the optimization calculation;
In the logistics simulator that models the logistics phenomenon of the transportation process from the factory A to the factory B, a simulation from the planning start time to the set time is performed, and the intermediate process passing time of each transport vehicle after the set time Predicting the factory B arrival time,
A plurality of transports characterized in that the transport destinations of a plurality of transport vehicles are determined by repeating the above steps until the transport destinations of all transport vehicles are determined, using the time after the set time as a new plan start time. How to create a driving plan for a car. After the raw materials are transported by a plurality of transport vehicles to a plurality of factories A that manufacture raw materials and reaction vessels arranged in a plurality of factories B through a single or a plurality of intermediate processes, the raw material components in the reaction vessels An operation plan creation method for the plurality of transport vehicles in the process of adjusting
Step of inputting factory A departure time of each transport vehicle, raw material loading amount, actual value and plan value of raw material components, and intermediate process passing time and actual value of factory B arrival time of each transport vehicle at the planned start time When,
For all transport vehicles for which the transport destination has not been determined, for all transport vehicles for which the arrival time and arrival components of all factories B capable of transporting the loaded material and for which the transport destination has been determined Predicting the arrival time and arrival components of the factory B as the transport destination;
With the arrival time and arrival components of the factory B as well as the required raw material amount of each reaction vessel, the required time, and the planned value of the target component after component adjustment, the amount of raw material that each reaction vessel is poured from each transport vehicle The first constraint on the sum, the second constraint on the total amount of raw materials that each transport vehicle pours into each reaction container, the arrival time of each transport vehicle at the destination and the reaction container poured from the transport vehicle The third constraint on the requested time, the fourth constraint that each transport vehicle has only one transport destination, and the level of the material loading amount of the transport vehicle toward each transport destination, and at the same time, each reaction container Determining an objective function for minimizing the component adjustment amount of
Satisfying the first to fourth constraints, performing an optimization calculation on the objective function, and determining a transport destination of each transport vehicle;
A step of determining a predetermined transport destination of a transport vehicle at the transport destination determined by the optimization calculation;
In the logistics simulator that models the logistics phenomenon of the transportation process from the factory A to the factory B, a simulation from the planning start time to the set time is performed, and the intermediate process passing time of each transport vehicle after the set time Predicting factory B arrival time and arrival components,
A plurality of transports characterized in that the transport destinations of a plurality of transport vehicles are determined by repeating the above steps until the transport destinations of all transport vehicles are determined, using the time after the set time as a new plan start time. How to create a driving plan for a car.   The optimization calculation is performed so that the fifth constraint on the raw material component and the required component of each reaction vessel is satisfied in addition to the first to fourth constraints. The operation plan creation method of a plurality of transport vehicles described in 1.   In addition to the above constraints, the raw material temperature of each reaction vessel and the requirements, in addition to the actual value and the planned value of the raw material temperature, in addition to the factory A departure time, raw material loading capacity, and raw material components at the planned start time The operation plan creation method for a plurality of transport vehicles according to any one of claims 1 to 3, wherein the optimization calculation is performed so as to satisfy a sixth restriction on temperature.

Images