JP2002059900A - Aircraft design method and simulation program product therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an aircraft design method capable of designing an aircraft optimum to transportation requirements based on predetermined transportation requirements and to provide a simulation program product therefor. SOLUTION: An enplaning arrangement pattern and a required time for minimizing both the total number of aircrafts and the time required for the transportation are found for plural respective aircraft specifications based on the predetermined transportation requirements by using stimulatory calculation, and the optimum one of the aircraft specifications is determined based on the plural found simulation results.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an aircraft design method and, more particularly, to an aircraft design method and a simulation program for determining an optimal aircraft specification in response to a predetermined cargo transportation requirement. About the product.

[0002]

2. Description of the Related Art When a large-scale disaster such as an earthquake or a volcanic eruption occurs, a large amount of materials, such as personnel for rescue and recovery of lives and various work vehicles and food, are quickly and quickly transported to the affected area. Needs arise.

[0003] In response to such needs, as part of a crisis management and disaster prevention plan, it is necessary to formulate a transportation plan for supplies in such a case from normal times, and to procure aircraft for the transportation. It is important to keep.

Conventionally, in such a case, an aircraft used for transportation is selected from existing models (specifications), and the transportation plan is made based on the selected aircraft.

[0005]

However, in the above method, since the aircraft used for transportation is not an aircraft designed only for the purpose, the number of aircraft required and the transportation required are required. In terms of time, etc., it was not always possible to formulate an optimal and optimal transportation plan.

[0006] In particular, in the case of transportation at the time of the above-mentioned disaster or the like, there are time restrictions and geographical restrictions, and in consideration of the urgency, an aircraft having specifications most suitable for the transportation needs is prepared. It is hoped that the best transportation plan based on its use will be established.

It is an object of the present invention to provide an aircraft design method and a simulation program product for designing an aircraft most suitable for a transportation request based on a predetermined transportation request. .

[0008]

In order to achieve the above object, one aspect of the present invention is to use a simulation calculation for each of a plurality of aircraft specifications based on predetermined transportation requirements. When the number of machines required for transportation is minimized and the time required for transportation is minimized, the mounting arrangement pattern in the aircraft, the required time, etc. are determined, and the optimum one is determined based on the obtained simulation results. Is to determine one aircraft specification. Therefore, according to the present invention, an aircraft suitable for the transportation needs can be designed based on the transportation needs that have been determined in advance, and the transportation plan of the goods at the time of a large-scale disaster or the like can be made more accurately. It becomes possible.

[0009] To achieve the above object, another aspect of the present invention is based on a predetermined luggage transportation requirement.
An aircraft design method for designing an aircraft, wherein for each of a plurality of aircraft having different specifications, a simulation of a process of transporting the package from a first location to a second location different from the first location is performed. Using a simulation process, when the total number of aircraft required for the transportation request is the minimum and the time required to achieve the transportation request is the shortest, at least the total number of aircraft and the required time Outputting a simulation result including: and selecting one aircraft from the plurality of aircraft based on the output simulation result.

In a preferred aspect of the present invention, the simulation process simulates a placement of the luggage in the aircraft and outputs a plurality of placement patterns that minimize the total number of aircraft. Simulating a process of loading the package from the first location to the aircraft for each of the plurality of output placement patterns, and determining a loading time required for the loading process; and Simulating a process of unloading the package from the aircraft to the second location for each of the plurality of mounting arrangement patterns, and determining an unloading time required for the unloading process; and And based on the unloading time, select the mounting arrangement pattern that minimizes the required time It characterized by having a step of outputting the simulation results in the case of the mounting arrangement pattern.

Further, in the above invention, another aspect is as follows.
Outputting the plurality of mounting arrangement patterns, a first step of ranking the luggage according to a predetermined rule, a second step of arranging the luggage in the aircraft according to the ranking, For the mounting arrangement pattern obtained as a result of the arrangement, making a change until at least the weight and the position of the center of gravity fall within the allowable range, the third step of outputting the mounting arrangement pattern at the time of entering the allowable range, The predetermined rules are sequentially changed, and the steps from the first step to the third step are repeated,
A plurality of the mounting arrangement patterns are output.

In order to achieve the above object, another aspect of the present invention is to move the package from the first location to the first location based on predetermined cargo transportation requirements and aircraft specifications. Is a simulation program that simulates a process of transporting to a different second place, simulating a loading arrangement of the luggage in the aircraft, and a plurality of the aircraft having a minimum number of aircraft required for the transport request. Outputting a mounting arrangement pattern of the
For each of the plurality of output placement patterns output, simulating a process of loading the package from the first location to the aircraft, and determining a loading time required for the loading process; and Simulating a process of unloading the package from the aircraft to the second location for each of the plurality of mounting arrangement patterns, determining an unloading time required for the unloading process; and determining the determined loading time and unloading. Based on the time, select the mounting arrangement pattern that requires the shortest time to achieve the transportation request, and output a simulation result including at least the total number of machines and the required time in the case of the mounting arrangement pattern. The steps are executed by a computer.

Further, in the above-mentioned invention, in a preferred aspect, the step of outputting the plurality of mounting arrangement patterns includes a first step of ranking the packages according to a predetermined rule, and a step of sorting the packages according to the ranking. The second step of arranging in the aircraft, and making changes to the mounting arrangement pattern obtained as a result of the arrangement until at least the weight and the center of gravity fall within the allowable range, Having a third step of outputting the mounting arrangement pattern, sequentially changing the predetermined rule, repeating the first to third steps, and outputting a plurality of the mounting arrangement patterns. It is characterized by.

[0014] Further objects and features of the present invention will become apparent from the embodiments of the present invention described below.

[0015]

Embodiments of the present invention will be described below with reference to the drawings. However, such embodiments do not limit the technical scope of the present invention.
In the drawings, the same or similar components are denoted by the same reference numerals or reference symbols.

FIG. 1 is a diagram showing an overall processing flow of an aircraft design method according to one embodiment of the present invention.
As shown in the figure, the present method seeks to determine the most suitable aircraft specification for a transportation request based on data on a predetermined transportation request for cargo (cargo). Here, “optimum” is determined based on indices such as the total number of aircraft required for the requested transportation, the required transportation time, and the on-board loading status.

As shown in FIG. 1, in the present method, first, specification data of a plurality of candidate aircraft are prepared together with the above-mentioned transportation request data as a basis of design. Specifically, the data of the transportation request is data of dimensions and weight of each cargo to be transported, and the specification data of the aircraft is data such as dimensions of a cargo compartment inside the aircraft. Since these data are used for simulation calculation described later,
The data is preferably stored as a database in a storage device connected to the computer system that executes the simulation calculation. It is not necessary to determine all of the specification data of the plurality of aircraft from the beginning, and the specification data may be added or changed from the result of a simulation calculation described later.

Next, one of the plurality of candidate aircraft is selected (step S1 in FIG. 1), and a simulation calculation is executed for that case (step S2 in FIG. 1). Although the processing content of the simulation calculation will be described later, in this simulation, the data of the transportation request and the selected one aircraft specification data are input, the total number of required aircraft is minimized, and the time required for transportation is reduced. The shortest cargo loading arrangement in the cabin is selected, and the total number of aircraft, required time, loading arrangement, center of gravity position, etc. are output. That is, in the case of an aircraft having the selected specification, an optimal transport pattern is determined. In addition, the required time means the time from the state where the cargo to be transported is placed at a predetermined collection place to the time when the cargo is placed at a predetermined collection place at the destination of transportation.

The simulation calculation is performed by a computer system, such as a personal computer, which executes a process based on a program describing the processing contents.

Next, the simulation calculation for the one aircraft specification is sequentially and repeatedly executed for the plurality of prepared cases (steps S3 and S4 in FIG. 1).
The optimal transport pattern for each case, i.e., aircraft of each specification, is determined. Here, the number of cases for which the simulation calculation is performed may be determined in advance as described above, or may be changed or added midway from the result of each simulation. This determination is left to the simulation calculation operator or the like.

The simulation calculation has been completed for all cases (Yes in step S3 in FIG. 1), and a plurality of simulation results, ie, aircraft specifications and optimal transport patterns (total number of aircraft, required time, mounting arrangement, etc.) are obtained. At the same stage, the most appropriate aircraft for the transportation request is selected from among them based on human judgment (step S in FIG. 1).
5). The selection is comprehensively determined from a plurality of factors such as the purpose of the transportation request, the status of the destination, and the required cost.

The above has described the overall processing contents of the aircraft design method according to the present embodiment. Hereinafter, the contents of the simulation calculation used therein will be described in detail. FIG. 2 is a diagram showing an overall flow of a simulation calculation used in the aircraft design method.

As described above, the simulation calculation is as follows.
From the transport request data and one aircraft specification data, select the transport pattern that is optimal in that case, that is, the minimum total number of aircraft and the minimum required time, and the total number of aircraft at that time,
Outputs the required time, mounting arrangement, etc. In this embodiment, a discrete event simulation technique using queuing theory is used for the simulation,
A simulation software called Arena sold by Ryoin is used to create a program for executing the simulation calculation.

"Input" shown on the left side of FIG. 2 shows the details of the input transportation request data and one aircraft specification data. The input data is roughly classified into three types: data related to loading of cargo in the aircraft, data related to loading / unloading of cargo to / from the aircraft, and data related to the operating time of the aircraft.

In the center of FIG. 2, an outline of the processing in the simulation is shown. As shown in the figure, the simulation process includes four modules (shown in the figure).
). First, the cargo loading module simulates loading of cargo that needs to be transported into an aircraft. Although the details of the processing will be described later, in this module, simulations are performed in multiple mounting orders while checking the success or failure of various conditions for mounting, and the total number of machines required from among them is minimized. N cases are selected such that

Next, the cargo loading calculation module transports the cargo to be transported, which is placed at a predetermined pickup location, to an aircraft (transport aircraft) used for transport, and determines whether or not the cargo on board is determined by the cargo loading module. This is the part that simulates the process up to loading into the mounting arrangement. For this simulation, data relating to loading / unloading of the input data is used. For example, the number of work vehicles to be carried in and the moving speed thereof are used. The loading simulation is performed for each of the n cases selected by the cargo loading module, and the loading time t _m1 for each case is output. Delivery time is the time required to complete the above process for all cargo.

The cargo unloading calculation module simulates a process of unloading a cargo from a transport aircraft that has arrived at a destination of transport and transporting the cargo to a predetermined collection location. This is a module that simulates a movement generally opposite to that of the above-mentioned cargo carrying-in calculation module, and is paired with the cargo carrying-in calculation module. Therefore, the necessary data and the method of simulation are almost the same as those of the cargo loading calculation module, and output the unloading time t _m2 for each of the n cases.

Next, the output carry-in time t _m1 and carry-out time t _m2 are summed for each case, and a case in which the total time t _m is minimum is selected. The required time calculation module is the last module, the operating time t _f in addition to being input to the total time t _m of the selected case, to calculate the required time t of the total required for the transport. Here, the operating time t
_f is, as described as input data in FIG. 2,
It means the time from the end of the loading of the cargo to the transport aircraft to the beginning of the transport of the cargo from the transport aircraft at the destination. That is, it is the time from the end of the process in the cargo carrying-in calculation module to the start of the processing in the cargo carrying-out calculation module. Therefore, by adding the carry-in time t _m1 , the operation time t _f, and the carry-out time t _m2 , the required time t from the departure accumulation site to the destination accumulation site can be obtained. The operating time t _f is
Each aircraft subject to this simulation calculation (specifications)
Since the value definite for each, even the minimum required time t in the case where the total time t _m is minimized.

As a result of the simulation as described above, an output as shown on the right side of FIG. 2 is performed for the one selected case where the required time t is minimized. Specifically, the calculated required time t, the mounting arrangement obtained by the cargo mounting module, the total number of machines, and the like.

Next, each of the modules constituting the simulation calculation will be further described. FIG. 3A is a diagram showing an outline of input / output data and processing in the cargo loading module. FIGS. 3B and 3C are diagrams for explaining input data.

The data required by this module is, as shown in FIG. 2A, “aircraft cargo room data” which is one selected aircraft specification data to be subjected to the simulation calculation, and data of the transportation request. This is the “load cargo data” that is the data. The “airframe cargo compartment data” is, as shown in FIG. 3 (b), various data relating to the cargo compartment (the hatched portion in the figure). The “load cargo data” is, as shown in FIG. 3 (c), data of each item of the cargo to be transported. More specifically, as shown in the figure, the cargo includes goods to be palletized, vehicles such as trucks, and personnel (not shown).

The outline of the simulation processing performed using these input data is as described above, but is specifically composed of three processing steps as shown in FIG. The “freight sorting process” is a part for determining the loading order of cargo, and a plurality of sorting methods are prepared. Specifically, there are a method of sorting by weight of cargo, a method of sorting by size, a method based on the priority of transportation, and the like. By changing this sorting method, a plurality of mounting patterns can be generated for one aircraft specification, and are used for generating the n cases of mounting arrangement.

The "cargo loading process" is a process of sequentially arranging packages in the cabin from the first unit in accordance with the order of the cargo determined in the above process. The arrangement is performed according to a predetermined rule, and a method of arranging the luggage in one line and a method of arranging the luggage in two lines are provided.

The "condition check processing" checks whether or not the arrangement result in the machine satisfies various conditions and restrictions, and confirms that the arrangement is effective. Specifically, it is checked whether the weight is excessive or whether the position of the center of gravity is within the allowable range.

In this module, a plurality of mounting arrangement patterns determined to be effective are generated by the above-described processing, and as described above, an n-case mounting arrangement that minimizes the total number of machines is selected from among them. .

Accordingly, as shown in FIG. 3A, the output from this module is the result of loading each cargo on the above n cases. The cargo loading result is, specifically, a loading layout diagram or a loading list for each transport aircraft, examples of which are shown in FIGS. 4 and 5. FIG. 4 is an example of a loading list, in which the names of cargo to be loaded and various data are described for each transport aircraft.

FIG. 5 is an example of a mounting arrangement diagram.
In this case, four cargoes (20, 38x2 in the figure,
39) are arranged in two rows. Also, the part a in the figure shows the calculated center of gravity position in this mounting arrangement, and it can be seen that it is within the allowable range (the part b in the figure).

Next, FIG. 6 is a diagram showing an example of a processing flow in the present cargo mounting module. Hereinafter, FIG.
, A specific example of the processing contents of the above-described module will be described. First, the aircraft described with reference to FIG.
The data of the loaded cargo is input. Here, the operator of the simulation calculation selects one of the aforementioned cargo sorting methods (step S1 in FIG. 6).

Based on the selected method, the cargo is sorted (step S2 in FIG. 6), and a variable p indicating the order of the transports is initialized (step S3 in FIG. 6). Next, the value of this variable p is increased by one (step S in FIG. 6).
4) The in-flight placement processing for the p-th car (first car at the first stage) is executed (step S5 in FIG. 6).

Next, a check of the weight (step S6 in FIG. 6) and a check of the position of the center of gravity (step S7 in FIG. 6) are performed on this arrangement result. Processing (Step S in FIG. 6)
8) is performed. In this sequential program change processing, the method of automatically changing the order of the cargo arranged in the Unit No. p and the other cargo based on a specific rule, the order of the cargo directly by the input operation of the operator based on the judgment of the operator, and the like. A method of changing the arrangement is taken.

After the sequential program change processing, the arrangement processing for the p-th car is performed again, and the processing from step S5 to step S8 is repeated until the conditions of the weight and the center of gravity are cleared.

When both of the above conditions are satisfied (FIG. 6)
In step S7 (Yes in step S7), it is checked whether the loading processing has been performed for all the input cargoes. If there is any remaining cargo (No in step S9 in FIG. 6), the processing from step S4 is performed. It is repeated. That is, the mounting process for the next transport machine is performed.

When the above processing is repeated and the loading processing for all the cargos is completed (Yes in step S9 in FIG. 6)
Then, if a processing result for the case (cargo loading result in the figure) is obtained and simulation of another case is necessary to obtain the result of the n cases (Yes in step S10 of FIG. 6), another Select the cargo sorting method (Fig. 6
Step S11), the simulation for the next case is started. Specifically, the processing from step S2 is repeatedly executed. It should be noted that the determination as to whether the above-described simulation of another case is necessary is made by the operator.

The above processing is repeated, and if the processing is executed for a sufficient number of cases (N in step S10 in FIG. 6)
o), out of a plurality of cases where the processing has been executed, n cases are selected from the cases where the total number of machines is the minimum (step S12 in FIG. 6), and the output of this module is obtained. The selection of the n cases is performed by an operator or the like after examining a plurality of cargo loading results obtained as a result of the simulation.

FIG. 7 is a diagram showing an outline of input / output data and processing in the cargo loading calculation module. As shown in the figure, the data input to this module is the loading layout and loading list for each transport aircraft in each case output from the cargo loading module, and other data required for the simulation of the loading process. It is. Specifically, the data includes the arrangement data of the collection place where the cargo is located and the transport aircraft, the moving speed at which the cargo is transported to the transport aircraft, the number of work vehicles used for transporting and loading the cargo, and the like.

This module executes the above-described simulation of the carry-in process for each of the selected n cases based on these input data, and carries out the cargo carry-in route for each case and the carry-in time t _m1. Etc. are output.

FIG. 8 is a diagram showing an example of input arrangement data of the pickup place and the transport aircraft. The starting point (accumulation site) in the figure is the place where all the cargo to be transported is placed. In this module, each cargo is transported from this location to the stop position of the transport machine and loaded into a predetermined position in the aircraft. Are sequentially simulated. For simulation,
Various predetermined rules are applied, for example, that the transportation method is determined by the type of cargo,
For example, it is impossible in the area where the transfer route is determined and in the oblique direction.

The route shown in (1) of the figure is, for example, a transport route in the case where the cargo is a self-propelled vehicle, and simulates the process of moving by self-traveling to a predetermined transport machine. Similarly, the route shown in (2) is a staff route, and the movement is simulated by walking or bus. Further, the route shown in (3) is a pallet cargo transport route. After the pallet cargo is transported from the accumulation site, the pallet cargo is temporarily placed at a transfer site indicated by c by a forklift at a point a in the figure, is loaded on a cargo loader at a point b, and is transported to a transport machine. In this module, such a process is sequentially simulated.

FIG. 9 is a diagram showing an outline of input / output data and processing in the cargo unloading calculation module. As shown in the figure, the data input to this module is also the loading layout and loading list for each transport aircraft in each case output from the cargo loading module, and other data required for the simulation of the unloading process. It is.

In this module, similarly to the cargo loading calculation module, the simulation calculation of the above-described unloading process is executed for each of the selected n cases based on the input data. , The carry-out time t _m2 of the cargo, and the like. The input data of the pickup place and the aircraft are the same as those in the case of the cargo loading calculation module shown in FIG. 8, and the simulation for each cargo is performed in the same manner as in the case of the above-described cargo loading calculation module and the moving direction. The content is almost the same except that the opposite is true.

Although the aircraft design method according to the present embodiment using the simulation calculation by the computer system has been described above, the simulation program for performing the simulation calculation provides the operator with a plurality of interface screens. ing. FIG.
FIGS. 0 to 12 are diagrams showing examples of interface screens provided to the operator.

FIG. 10 is an interface screen for inputting the specifications of the aircraft for performing the simulation calculation, specifically, the dimensions of the cargo hold. The part a in the figure is an interface for selecting an object to be calculated from three aircraft (A, B, C in the figure) whose dimensions have been previously determined, and the part b is an interface capable of setting an arbitrary size. It is.

FIG. 11 is an interface screen showing a simulation result in a predetermined scene. The a, b, and c portions of the figure show the number of takeoffs of the transport aircraft and the area used by the cargo compartment (%), respectively. , Freight weight (ton) is displayed. The screen also shows a transport route at the time of loading / unloading.

FIG. 12 is an interface screen for displaying the arrangement status of cargo in the cargo compartment of each transport aircraft. The operator can check the result of the loading simulation performed by the cargo loading module at any time. Figure a
The section shows the dimensions of the set cargo compartment. In addition, part b represents the cargo in different colors according to its type, and part c represents the position of the center of gravity.

As described above, in the aircraft design method according to the present embodiment, the total number of aircraft of each of a plurality of types (specifications) is required to achieve the transportation requirement using the simulation program. A transportation pattern and a transportation process that minimize the time and the required time are simulated, and an aircraft type (specification) optimal for the transportation requirement is selected from the simulation result. Therefore, according to the present method, it is possible to design an aircraft that is optimal for the transportation request based on the transportation request given in advance. Therefore, it is possible to more accurately formulate a material transportation plan at the time of the above-mentioned disaster or the like. Also,
This method is also effective in selecting the most suitable aircraft for transportation requirements from existing aircraft.

The scope of protection of the present invention is not limited to the above embodiments, but extends to the inventions described in the claims and their equivalents.

[0057]

As described above, according to the present invention, an aircraft suitable for the transportation needs can be designed based on the transportation needs determined beforehand, and the transportation plan of the goods at the time of a large-scale disaster can be further improved. It is possible to make an accurate plan.

[Brief description of the drawings]

FIG. 1 is a diagram showing an overall processing flow of an aircraft design method according to one embodiment of the present invention.

FIG. 2 is a diagram showing an overall flow of a simulation calculation used in the aircraft design method.

FIG. 3 is a diagram showing an outline of input / output data and processing in a cargo loading module.

FIG. 4 is a diagram showing an example of a loading list for each transport aircraft output from a cargo loading module.

FIG. 5 is a diagram showing an example of a placement layout for each transport aircraft output from a cargo loading module.

FIG. 6 is a diagram showing an example of a processing flow in the cargo loading module.

FIG. 7 is a diagram showing an outline of input / output data and processing in a cargo loading calculation module.

FIG. 8 is a diagram showing an example of arrangement data of a pickup place and a transport machine which are input to the cargo loading calculation module.

FIG. 9 is a diagram showing an outline of input / output data and processing in the cargo unloading calculation module.

FIG. 10 is a diagram showing an example of an interface screen for inputting a cargo compartment size of an aircraft for performing a simulation calculation.

FIG. 11 is a diagram illustrating an example of an interface screen illustrating a simulation result in a predetermined scene.

FIG. 12 is a diagram showing an example of an interface screen for displaying a cargo arrangement status in a cargo compartment of each transport aircraft.

[Explanation of symbols]

t _m1 loading time t _m2 unloading time t _mm total loading / unloading time for case _m t required time

Claims (5)

[Claims] An aircraft design method for designing an aircraft based on a predetermined cargo transportation request, comprising: loading the cargo from a first location to a first aircraft for each of a plurality of aircraft having different specifications. Using a simulation process that simulates a process of transporting to a second location different from the location, the total number of the aircraft required for the transport request is minimal, and a requirement for achieving the transport requirement Outputting a simulation result including at least the total number of aircraft and the required time when the time is the shortest; and selecting one aircraft from the plurality of aircraft based on the output simulation result. An aircraft design method comprising steps. 2. The method according to claim 1, wherein the simulation process simulates the placement of the luggage in the aircraft, and outputs a plurality of placement patterns that minimize the total number of aircraft. Simulating a process of loading the package from the first location to the aircraft for each of the plurality of loading arrangement patterns, and determining a loading time required for the loading process; and For each of the arrangement patterns, a step of simulating a process of unloading the package from the aircraft to the second location, and determining an unloading time required for the unloading process, based on the determined loading time and unloading time. And selecting the mounting arrangement pattern in which the required time is the shortest, and selecting the mounting arrangement pattern. Aircraft design method characterized in that it comprises a step of outputting the simulation results of the case. 3. The method according to claim 2, wherein the step of outputting the plurality of mounting arrangement patterns includes: a first step of ranking the luggage according to a predetermined rule; and placing the luggage in the aircraft according to the ranking. A second step of performing, for the mounting arrangement pattern obtained as a result of the arrangement,
A third step of making changes at least until the weight and the position of the center of gravity fall within the allowable range, and outputting the mounting arrangement pattern at the time of entering the allowable range, and sequentially changing the predetermined rule, An aircraft design method, comprising repeating one step to the third step and outputting a plurality of the mounting arrangement patterns. 4. A simulation for simulating a process of transporting said package from a first location to a second location different from said first location based on predetermined transportation requirements of the package and aircraft specifications. Simulating the loading arrangement of the luggage in the aircraft, and outputting a plurality of loading arrangement patterns that minimize the total number of the aircraft required for the transportation request; and Simulating a process of loading the package from the first location to the aircraft for each of the loading layout patterns, and determining a loading time required for the loading process; and the output plurality of loading layout patterns. Simulating the process of carrying the package from the aircraft to the second location for each of the Determining the unloading time required for the unloading process; and, based on the determined loading time and unloading time, selecting the mounting layout pattern that minimizes the time required to achieve the transport request, and A simulation program product that causes a computer to execute a step of outputting a simulation result including at least the total number of machines and the required time in the case of a pattern. 5. The method according to claim 4, wherein the step of outputting the plurality of loading arrangement patterns includes: a first step of ranking the packages according to a predetermined rule; and a step of placing the packages in the aircraft according to the ranking. A second step of performing, for the mounting arrangement pattern obtained as a result of the arrangement,
A third step of making changes at least until the weight and the position of the center of gravity fall within the allowable range, and outputting the mounting arrangement pattern at the time of entering the allowable range, and sequentially changing the predetermined rule, A simulation program product that repeats one step to the third step and outputs a plurality of the mounting arrangement patterns.