Computation program, computation method, and information processing device

Abstract

To provide a computation program, a computation method, and an information processing device, which can efficiently generate a transport vehicle relay delivery.SOLUTION: A computation program causes a computer to execute processing of: acquiring a combination of a first regular delivery and a second regular delivery from a set including a plurality of regular deliveries each of which has a route from a first node to a last node and for which it is determined at which node each package is loaded and transported to which node; and generating a transport vehicle relay delivery by identifying a node where a package is loaded last in the first regular delivery, adding a route of the second regular delivery after the identified node, deleting a first node of the second regular delivery when matching the first node of the second regular delivery with the identified node, and adding a first node of the first regular delivery as a last node when the last node of the second regular delivery does not match the first node of the first regular delivery.SELECTED DRAWING: Figure 8

Description

[Technical field]

[0001] The present invention relates to a computing program, a computing method, and an information processing device. [Background technology]

[0002] In the distribution industry, transport vehicles are used to transport cargo. Since there are a wide variety of cargo types and a large number of bases, the optimization of transportation plans is being carried out (see, for example, Patent Documents 1 to 4). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2020-56683 A [Patent Document 2] JP 2019-117444 A [Patent Document 3] U.S. Patent Publication No. 2021 / 0046929 [Patent Document 4] U.S. Patent Publication No. 2020 / 0027060 Summary of the Invention [Problem to be solved by the invention]

[0004] In such a transportation plan, if loading and unloading of luggage occurs at bases along the way, the transportation time required to complete the transportation of the luggage may be extended. In response to this, a vehicle transfer service in which one driver transfers between multiple vehicles has been considered. However, no technology has been disclosed for efficiently generating a vehicle transfer service.

[0005] In one aspect, the present invention aims to provide a calculation program, a calculation method, and an information processing device that can efficiently generate transport vehicle connections. [Means for solving the problem]

[0006] In one embodiment, the calculation program causes a computer to execute the following process: obtain a combination of a first regular flight and a second regular flight from a set including multiple regular flights, each of which has a route from a first node to a last node and which determines at which node each baggage will be loaded and transported to; identify the node at which the first regular flight will load the baggage last; add the route of the second regular flight after the identified node; if the identified node matches the first node of the second regular flight, delete the first node of the second regular flight; and if the last node of the second regular flight does not match the first node of the first regular flight, add the first node of the first regular flight as the last node to create a transport vehicle connection flight. Effect of the Invention

[0007] Vehicle connections can be generated efficiently. [Brief description of the drawings]

[0008] [Figure 1] (a) is a diagram illustrating an example of a transportation plan, and (b) is an example of optimizing the transportation plan in (a). [Diagram 2] FIG. 1 is a diagram illustrating a transport vehicle transfer. [Diagram 3] FIG. 13 is a diagram illustrating an example of a time schedule. [Figure 4] FIG. 1A is a functional block diagram illustrating an overall configuration of an information processing apparatus according to a first embodiment, and FIG. [Diagram 5] This is a regular flight table that stores each regular flight stored in the regular flight storage section. [Figure 6] FIG. 13 illustrates a flowchart. [Figure 7] 13 is a flowchart showing details of the transport vehicle connection creation process in step S2. [Figure 8] 13A and 13B are diagrams illustrating an example in which a transport vehicle connection γ is generated. [Figure 9] FIG. 13 is a diagram illustrating an example of a case where a transport vehicle connection γ is generated. [Figure 10] FIG. 13 is a diagram illustrating an example of a case where a transport vehicle connection γ is generated. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] In the distribution industry, cargo is transported using transport vehicles. For example, cargo is transported from one base (node) to another. Since there are many types of cargo and many bases, there is a need to optimize the transportation plan.

[0010] Fig. 1(a) is a diagram illustrating an example of a transportation plan. As illustrated in Fig. 1(a), regular flight a is a flight that loads baggage 1 at base A and unloads baggage 1 at base B. Regular flight b is a flight that loads baggage 2 at base C and unloads baggage 2 at base E. Regular flight c is a flight that loads baggage 3 and baggage 4 at base D, unloads baggage 3 at base B, and then unloads baggage 4 at base E.

[0011] Figure 1(b) is an example of an optimization of the transportation plan in Figure 1(a). In optimization, the stopover points of regular flights and the transfer points of cargo are changed to reduce the number of flights, the travel distance, and the cargo transportation time (lead time). For example, in the optimization result of Figure 1(b), regular flight c loads cargo 3 and cargo 4 at base D, unloads cargo 3 and loads cargo 2 at base C, and unloads cargo 2 and cargo 4 at base E. Also, regular flight a loads cargo 1 at base A, loads cargo 3 at base C, and unloads cargo 1 and cargo 3 at base B. In this way, it becomes possible to reduce regular flight b.

[0012] In such a transportation plan, it is common for one driver to operate one transport vehicle. However, if loading and unloading of luggage occurs at bases along the way, the transportation time required to complete the transportation of the luggage may be long. In contrast, if one driver transfers between multiple transport vehicles, the time required to load and unload the luggage can be shortened. In this specification, this is referred to as a transport vehicle transfer service in which one driver transfers between multiple transport vehicles.

[0013] The transport vehicle transfer service has the following advantages. For example, at the base where the first transport vehicle is changed to the second transport vehicle, the time required to unload the luggage from the first transport vehicle is reduced. Also, the luggage can be loaded onto the second transport vehicle before the first transport vehicle arrives at the base. Therefore, the time required to load and unload the luggage can be reduced, and therefore the transportation time can be shortened. As a result, the time that the driver is detained can be reduced, and the number of drivers can be reduced. Also, by separating the transportation and loading / unloading tasks, the driver's working environment can be improved. Also, since the luggage can be loaded onto the second transport vehicle in advance, the space required to store luggage during the waiting time until the arrival of the first transport vehicle can be reduced.

[0014] FIG. 2 is a diagram illustrating a transport vehicle transfer service. For example, in regular service a, one driver loads baggage 1 onto a first transport vehicle at base A and transports it to base B. Next, the driver transfers to a second transport vehicle loaded with baggage 2 and baggage 3 at base B, unloads baggage 2 at base C, and unloads baggage 3 at base C. Loading and unloading of baggage is not performed by the driver, but by loading and unloading staff at each base.

[0015] The upper part of FIG. 3 is a diagram illustrating a time schedule of the transport vehicle transfer flight in FIG. 2. The upper part of FIG. 3 shows a time schedule until the baggage 2 is unloaded at base C as an example. As illustrated in the upper part of FIG. 3, first, it takes time to load the baggage 1 onto the first transport vehicle at base A. The work of loading the baggage 1 is performed by a loading and unloading staff, but the driver may also perform this work. Next, it takes time to drive the first transport vehicle from base A to base B. At base B, the work of unloading the baggage 1 occurs, but the driver does not perform this work. The baggage 2 has already been loaded onto the second transport vehicle. Next, the driver transfers from the first transport vehicle to the second transport vehicle, departs from base B, and transports the baggage 2 to base C. At base C, the work of unloading the baggage 2 occurs. The work of unloading the baggage 2 is performed by a loading and unloading staff, but the driver may also perform this work.

[0016] The lower part of FIG. 3 is a time schedule when the luggage 1 and luggage 2 are transported by one transport vehicle, not by a transport vehicle transfer service. The lower part of FIG. 3 also shows a time schedule until the luggage 2 is unloaded at base C. As illustrated in the lower part of FIG. 3, first, it takes time to load the luggage 1 onto the first transport vehicle at base A. The work of loading the luggage 1 is performed by the loading and unloading staff, but it may also be performed by the driver. Next, it takes time to drive the first transport vehicle from base A to base B. At base B, the work of unloading the luggage 1 occurs. The work of unloading the luggage 1 may be performed by the loading and unloading staff or the driver. Next, the loading and unloading staff or the driver load the luggage 2 onto the first transport vehicle at base B. Next, the driver transports the luggage 2 to base C. At base C, the work of unloading the luggage 2 occurs. The work of unloading the luggage 2 may be performed by the loading and unloading staff or the driver.

[0017] In the schedule in the upper part of Figure 3, the work time is shorter than in the schedule in the lower part of Figure 3 by the time required for the work of unloading baggage 1 at base B and the work of loading baggage 2. Therefore, the transportation time is shortened. In addition, the work of unloading baggage 1 at base B and the work of loading baggage 2 are performed by unloading staff, so the burden on the driver is reduced. In this way, by using a transport vehicle transfer service, the transportation time can be shortened and the burden on the driver can be reduced.

[0018] Here, the constraints of a vehicle transfer flight are explained. First, the driver transfers vehicles at a specified base. Next, the transferred vehicle can be loaded with luggage before the previous vehicle arrives. The transferred vehicle can depart at the later of either the time when the previous vehicle arrives or the time when loading of luggage into the transferred vehicle is completed. The transferred vehicle does not continue to transport luggage from the previous vehicle. There are types of luggage that cannot be transported by a vehicle transfer flight. The departure base and the final base are made to coincide (the driver returns to the departure base). It is desirable to efficiently generate the above vehicle transfer flights.

[0019] In the following embodiments, an information processing device, a calculation method, and a calculation program capable of efficiently generating transport vehicle connections will be described. EXAMPLES

[0020] Fig. 4(a) is a functional block diagram showing an overall configuration of an information processing device 100 according to the first embodiment. The information processing device 100 is a server for optimization processing, etc. As illustrated in Fig. 4(a), the information processing device 100 functions as a regular flight storage unit 10, a calculation unit 20, a transport vehicle connection flight storage unit 30, etc.

[0021] Fig. 4(b) is a hardware configuration diagram of the information processing device 100. As illustrated in Fig. 4(b), the information processing device 100 includes a CPU 101, a RAM 102, a storage device 103, an input device 104, a display device 105, and the like.

[0022] The CPU (Central Processing Unit) 101 is a central processing unit. The CPU 101 includes one or more cores. The RAM (Random Access Memory) 102 is a volatile memory that temporarily stores a program executed by the CPU 101, data processed by the CPU 101, and the like. The storage device 103 is a non-volatile storage device. For example, a ROM (Read Only Memory), a solid state drive (SSD) such as a flash memory, or a hard disk driven by a hard disk drive can be used as the storage device 103. The storage device 103 stores a calculation program. The input device 104 is a device for a user to input necessary information, such as a keyboard or a mouse. The display device 105 is a display device that displays the calculation results of the calculation unit 20 on a screen. Each part of the information processing device 100 is realized by the CPU 101 executing the calculation program. Note that each part of the information processing device 100 may be hardware such as a dedicated circuit.

[0023] The regular flight storage unit 10 stores a plurality of regular flights. FIG. 5 is a regular flight table that stores each regular flight stored in the regular flight storage unit 10. Each regular flight has a route from the first base to the last base, and it is determined which base the cargo is loaded at and transported to. For example, as illustrated in FIG. 5, an operation start time and an operation deadline time are determined. The operation start time is the time when the operation can start, and does not necessarily have to be operated at that time. The operation deadline time is the time when the operation must be ended. In addition, stopover bases are determined for each regular flight. For example, regular flight a departs from base A, stops at base B and base C in that order, and returns to base A. Regular flight b departs from base B and arrives at base A.

[0024] Furthermore, the cargo to be transported is determined for each scheduled service. For each cargo, the route, weight, transportation time required to travel the entire route, arrival time, etc. are determined. For example, scheduled service a is determined to transport cargo 1 and cargo 2. Cargo 1 is transported from base A to base B. Cargo 2 is transported from base B to base C. Scheduled service b is determined to transport cargo 3. Cargo 3 is transported from base B to base A.

[0025] In addition, the type of vehicle used for transportation is determined for each scheduled service. Once the type of vehicle is specified, the maximum loading capacity and other factors are determined.

[0026] The calculation process will be described below with reference to the flowchart of FIG. 6. First, the calculation unit 20 acquires information on each regular flight from the regular flight storage unit 10, and creates a set P of pairs of any two regular flights (step S1). The pairs of regular flights include the first half of the regular flight and the second half of the regular flight. For example, if the regular flight storage unit 10 includes regular flights a, b, and c, the following pairs of regular flights a and b, b and a, b and c, c and b, a and c, and c and a are acquired as the set P as pairs of regular flights in the first half and the second half. In this way, the pair of regular flights a and b and the pair of regular flights b and a are treated as different pairs. However, pairs including regular flights that cannot meet the deadline for the end of service even if there is no luggage are excluded from the set P. In addition, pairs that include scheduled services that are prohibited from being used as transfer vehicles are also excluded from the set P. For example, pairs that include scheduled services that exceed the daily working hours of a single driver and require multiple drivers are excluded from the set P because a single driver cannot transfer vehicles.

[0027] Next, the calculation unit 20 performs a transport vehicle connection creation process (step S2).

[0028] FIG. 7 is a flowchart showing the details of the process of creating a transport vehicle connecting flight in step S2. First, the calculation unit 20 acquires one pair from the pairs included in the set P, and the first half of the regular flight is designated as regular flight α, and the second half of the regular flight is designated as regular flight β. The pair of the first half of the regular flight α and the second half of the regular flight β is represented as pair (α, β). The calculation unit 20 also creates a new transport vehicle connecting flight γ from the pair (α, β) (step S11). The attributes of the transport vehicle connecting flight γ (operation start time, operation deadline time, transport vehicle type, etc.) are inherited from the attributes of the regular flight α. The maximum loading capacity of the transport vehicle connecting flight is inherited from the larger of the maximum loading capacity of the regular flight α and the maximum loading capacity of the regular flight β.

[0029] Next, the calculation unit 20 finds a stopover base point α_k where the baggage is loaded last among the stopover base points (α_1, α_2, ..., α_n) defined in the regular flight α. The calculation unit 20 also adds (α_1, ..., α_k) from the stopover base α_1 to the stopover base α_k to the transport vehicle transfer flight γ (step S12). Note that (α_1, α_2, ..., α_n) represent the base points to be stopped over in order from the base on the left to the base on the right. Therefore, the base α_1 is followed by a stopover at the base α_2, and finally a stopover at the base α_n. In the case of (α_1, ..., α_k), the base α_1 is the departure base, and α_k is the base point to be stopped over last. Note that if there is baggage to be loaded before the base a_k and unloaded after the base a_k, the following steps S13 to S21 are not executed.

[0030] Next, the calculation unit 20 adds β_1 to the end of the transport vehicle transfer service γ when α_k is different from β_1 for the stopover base points (β_1, ..., β_n) defined in the regular service β (step S13). As a result, the regular service β travels to the base point α_k, which is the last base point to load luggage, after the base point α_k, which is the last base point to load luggage, on the regular service α. If α_k is the same as β_1, step S13 is not executed.

[0031] Next, the calculation unit 20 adds (α_k+1, ..., α_n) and (β_2, ..., β_n) to the end of the transport vehicle connection γ (step S14).

[0032] Next, if the final base stop in the transport vehicle transfer service γ is different from the base α_1, the calculation unit 20 adds the base α_1 to the end of the transport vehicle transfer service γ (step S15). This causes the driver to depart from the base α_1 and return to the base α_1. If the final base stop in the transport vehicle transfer service γ is the same as the base α_1, step S15 is not executed.

[0033] Next, the calculation unit 20 acquires a parcel set Q of each parcel to be transported by the regular flight α and each parcel to be transported by the regular flight β (step S16). However, among the parcel set Q, parcels that cannot be transported by a connecting transport vehicle are deleted from the parcel set Q to become a parcel set R. For example, a criterion is set for determining whether a parcel can be transported by a connecting transport vehicle or not.

[0034] Next, the calculation unit 20 investigates whether various constraints (such as the operation deadline of the transport vehicle transfer service γ, the arrival deadline of the luggage, and the load capacity) can be satisfied when the luggage set Q is transported by the transport vehicle transfer service γ (step S17). For example, since the travel time between each base is fixed, the arrival time at each base is calculated once the order of the stopover bases is determined. It is possible to determine whether the arrival time at the destination base for each luggage is before the arrival deadline. In addition, since the loading base and the unloading base are fixed for each luggage, the combination of luggage loaded at the same time is determined once the route is determined. Therefore, it is possible to determine whether the maximum total weight of the combination of luggage does not exceed the maximum load capacity. Note that if the transport vehicle transfer service γ cannot satisfy the operation deadline, the following steps S18 to S21 are not executed.

[0035] Next, the calculation unit 20 removes the packages that do not meet the arrival deadline from the package set Q, and adds them to the package set R (step S18).

[0036] Next, the calculation unit 20 searches for a regular service capable of transporting each piece of luggage in the luggage set R from among the regular services α and β (step S19). For example, the Dijkstra algorithm or the like can be used as a search method. For example, among the regular services remaining in the set P, a regular service transporting luggage with the same loading and unloading bases is searched for. If a corresponding regular service is found, each piece of luggage in the luggage set R is added to the searched regular service. If there is no regular service capable of transporting each piece of luggage in the luggage set R, the subsequent steps S20 to S21 are not executed.

[0037] Next, the transport vehicle transfer flight storage unit 30 outputs information on the transport vehicle transfer flight γ (step S20). The output information includes the stopover points (γ_1, ..., γ_j) of the transport vehicle transfer flight γ. The output information also includes the point γ_i-1 where the driver transfers transport vehicles. The output information also includes transport information for the baggage set Q to be transported by the transport vehicle transfer flight γ. The output information also includes transport information for the baggage set R to be transported by a flight other than the transport vehicle transfer flight γ. The information stored in the transport vehicle transfer flight storage unit 30 may be displayed on the display device 105.

[0038] Next, the calculation unit 20 deletes the pair corresponding to the pair (β, α) of the regular flights from the set P (step S21). This is because a vehicle transfer flight could be generated with the combination of the regular flights (α, β). By executing the above process, the transfer flight creation process is completed.

[0039] 6 again, the calculation unit 20 deletes pairs equivalent to the pair (α, β) of regular flights from the set P (step S3). If the pair (α, β) can be a transfer vehicle flight, pairs including a regular flight equivalent to the regular flight α or a regular flight equivalent to the regular flight β are deleted from the set P.

[0040] Next, the calculation unit 20 judges whether or not there are no pairs left in the set P (step S4). For example, if the number of regular flights remaining in the set P is less than two, the result of the judgment in step S4 is "Yes."

[0041] If the result of step S4 is "Yes", the execution of the flow chart ends. If the result of step S4 is "No", the process is executed again from step S1. As a result, steps S1 to S4 are executed again for any of the pairs remaining in set P, and it is determined whether or not the pair can be a transfer vehicle.

[0042] Figures 8(a), 8(b) and 9 are diagrams illustrating an example of generating a transport vehicle transfer flight γ with the regular flight a described in Figure 5 as the first half regular flight α and the regular flight b as the second half regular flight β. As illustrated in Figure 8(a), the stopover points (α_1, α_2, ..., α_n) of the first half regular flight α are (point A, point B, point C). The stopover points (β_1, ..., β_n) of the second half regular flight β are (point B, point A).

[0043] Among the stopover points of the first half of the regular flight α, the last stopover point other than the first stopover point where the cargo is loaded is the point B, so α_k is the point B. Therefore, (A, B) is added to the transport vehicle transfer flight γ.

[0044] Since the base station B that is α_k is the same as the base station B that is β_1, β_1 is not added to the end of the transport vehicle transfer flight γ.

[0045] A base A corresponding to (β_2, ..., β_n) is added to the end of the transport vehicle transfer flight γ. In this case, since the base A which is α_1 and the base A which is α_n are the same, α_1 is not added after the base α_n. From the above, the stopover bases of the transport vehicle transfer flight γ are (base A, base B, base C, base A).

[0046] FIG. 10 is a diagram for explaining a case where the first half regular flight α is the regular flight a described in FIG. 5, and the second half regular flight β is a regular flight that loads luggage at base D and unloads the luggage at base E. As illustrated in FIG. 10, the stopover bases (α_1, α_2, ..., α_n) of the first half regular flight α are (base A, base B, base C). The stopover bases (β_1, ..., β_n) of the second half regular flight β are (base D, base E).

[0047] Among the stopover points of the first half of the regular flight α, the last stopover point other than the first stopover point where the cargo is loaded is the point B, so α_k is the point B. Therefore, (A, B) is added to the transport vehicle transfer flight γ.

[0048] Since location B, which is α_k, is different from location D, which is β_1, location D, which is β_1, is added to the end of transport vehicle transfer flight γ.

[0049] Base C, which is the remaining (α_k+1, ..., α_n) of regular flight α, is added to the end of transport vehicle transfer flight γ. Then, base E, which corresponds to (β_2, ..., β_n), is added. In this case, since base A, which is α_1, and base C, which is α_n, are different, base A, which is α_1, is added after base α_n. From the above, the stopover bases of transport vehicle transfer flight γ are (base A, base B, base D, base C, base E, base A).

[0050] According to this embodiment, a combination of regular flights, designated as regular flight α for the first half and regular flights designated as regular flight β for the second half, is obtained from a set containing multiple regular flights. The base station where the cargo is finally loaded on regular flight α is identified, and the route of regular flight β is added after the identified base station. If the identified base station matches the first base station of regular flight β, the first base station of regular flight β is deleted. If the last base station of regular flight β does not match the first base station of regular flight α, the first base station of regular flight α is added as the last base station, and a transport vehicle transfer flight is created. Through the above processing, transport vehicle transfer flights are efficiently generated.

[0051] In each of the above examples, the regular flight α is an example of a first regular flight, the regular flight β is an example of a second regular flight, and the base or stopover base is an example of a node.

[0052] Although the embodiments of the present invention have been described in detail above, the present invention is not limited to such specific embodiments, and various modifications and variations are possible within the scope of the gist of the present invention described in the claims.

[0053] (Appendix 1) A combination of a first scheduled flight and a second scheduled flight is obtained from a set including multiple scheduled flights having a route from a first node to a last node, and for each package, a node at which the package is loaded and a node to which the package is transported is determined; A computational program that causes a computer to execute a process of: identifying a node where the last cargo is loaded on the first regular flight; adding the route of the second regular flight after the identified node; if the identified node matches the first node of the second regular flight, deleting the first node of the second regular flight; and if the last node of the second regular flight does not match the first node of the first regular flight, adding the first node of the first regular flight as the last node, thereby creating a vehicle connection flight. (Appendix 2) The calculation program described in Appendix 1 is characterized in that it causes the computer to execute a process to determine whether or not any of the regular flights included in the set meets the conditions for a transport vehicle connecting flight, and to not include any regular flights that do not meet the conditions for a transport vehicle connecting flight in either the first regular flight or the second regular flight. (Appendix 3) The computation program described in Appendix 1 is characterized in that it causes the computer to execute a process of determining whether or not the baggage to be transported on the first regular flight and the second regular flight satisfies the conditions for a transport vehicle transfer flight, and for baggage that does not satisfy the conditions for a transport vehicle transfer flight, searching for a regular flight other than the first regular flight and the second regular flight that can transport the baggage. (Appendix 4) The computational program described in Appendix 1 is characterized in that it causes the computer to execute a process of deleting the first regular flight and the second regular flight from the set, obtaining two regular flights from the remaining regular flights, and creating a new transport vehicle connection flight, repeating this process until the number of remaining regular flights becomes less than two. (Appendix 5) A combination of a first scheduled flight and a second scheduled flight is obtained from a set including multiple scheduled flights having a route from a first node to a last node, and for each package, a node at which the package is loaded and a node to which the package is transported is determined; A computational method characterized in that a computer executes the following process: identifying a node where the last cargo is loaded on the first regular flight; adding the route of the second regular flight after the identified node; if the identified node matches the first node of the second regular flight, deleting the first node of the second regular flight; and if the last node of the second regular flight does not match the first node of the first regular flight, adding the first node of the first regular flight as the last node to create a vehicle connection flight. (Appendix 6) The calculation method described in Appendix 5, characterized in that the computer performs a process to determine whether or not any of the regular flights included in the set meets the conditions for a transport vehicle connecting flight, and does not include any regular flights that do not meet the conditions for a transport vehicle connecting flight in either the first regular flight or the second regular flight. (Appendix 7) The calculation method described in Appendix 5, characterized in that the computer executes a process to determine whether or not the baggage to be transported on the first regular flight and the second regular flight satisfies the conditions for a transport vehicle transfer flight, and for baggage that does not satisfy the conditions for a transport vehicle transfer flight, search for a regular flight other than the first regular flight and the second regular flight that can transport the baggage. (Appendix 8) The computational method described in Appendix 5, characterized in that the computer executes the process of deleting the first regular flight and the second regular flight from the set, obtaining two regular flights from the remaining regular flights, and creating a new transport vehicle connection flight, until the number of remaining regular flights becomes less than two. (Appendix 9) An information processing device characterized by comprising a calculation unit that creates a transport vehicle connection flight by obtaining a combination of a first regular flight and a second regular flight from a set including multiple regular flights each having a route from a first node to a last node, each of which has a specified node at which the luggage will be loaded and to which node it will be transported, identifying the node at which the luggage will be loaded last by the first regular flight, adding the route of the second regular flight after the identified node, deleting the first node of the second regular flight if the identified node matches the first node of the second regular flight, and adding the first node of the first regular flight as the last node if the last node of the second regular flight does not match the first node of the first regular flight. (Appendix 10) The information processing device described in Appendix 9, characterized in that the calculation unit determines whether or not any of the regular flights included in the set meets the conditions for a transport vehicle connecting flight, and does not include any regular flights that do not meet the conditions for a transport vehicle connecting flight in either the first regular flight or the second regular flight. (Appendix 11) The information processing device described in Appendix 9, characterized in that the calculation unit determines whether or not the baggage to be transported on the first regular flight and the second regular flight satisfies the conditions for a transport vehicle connecting flight, and for baggage that does not satisfy the conditions for a transport vehicle connecting flight, searches for a regular flight other than the first regular flight and the second regular flight that can transport the baggage. (Appendix 12) The information processing device described in Appendix 9, characterized in that the calculation unit repeats the process of deleting the first regular flight and the second regular flight from the set, obtaining two regular flights from the remaining regular flights, and creating a new transport vehicle connecting flight until the number of remaining regular flights becomes less than two. [Explanation of symbols]

[0054] 10 Regular flight storage area 20 Arithmetic section 30 Transport vehicle transfer storage area 100 Information processing device 101 CPU 102 RAM 103 Storage device 104 Input Devices 105 Display device

Claims

1. A combination of a first scheduled flight and a second scheduled flight is obtained from a set including a plurality of scheduled flights having a route from a first node to a last node, and for each package, a node at which the package is loaded and a node to which the package is transported are determined; A computational program that causes a computer to execute a process of creating a vehicle connection flight by identifying a node where the last cargo is loaded on the first regular flight, adding the route of the second regular flight after the identified node, deleting the first node of the second regular flight if the identified node matches the first node of the second regular flight, and adding the first node of the first regular flight as the last node if the last node of the second regular flight does not match the first node of the first regular flight.

2. The calculation program described in claim 1, characterized in that the computer is caused to execute a process to determine whether or not the regular flights included in the set meet the conditions for a transport vehicle connecting flight, and to not include regular flights that do not meet the conditions for a transport vehicle connecting flight in either the first regular flight or the second regular flight.

3. The computation program according to claim 1, characterized in that the computer is caused to execute a process of determining whether or not the baggage to be transported on the first regular flight and the second regular flight satisfies the conditions for a transport vehicle transfer flight, and for baggage that does not satisfy the conditions for a transport vehicle transfer flight, searching for a regular flight other than the first regular flight and the second regular flight that can transport the baggage.

4. The computational program according to claim 1, characterized in that the computer is caused to execute a process of deleting the first and second regular flights from the set, obtaining two regular flights from the remaining regular flights, and creating a new transport vehicle connection flight, repeating this process until the number of remaining regular flights becomes less than two.

5. A combination of a first scheduled flight and a second scheduled flight is obtained from a set including a plurality of scheduled flights having a route from a first node to a last node, and for each package, a node at which the package is loaded and a node to which the package is transported are determined; A computational method characterized in that a computer executes a process of: identifying a node where the last cargo is loaded on the first regular flight; adding the route of the second regular flight after the identified node; if the identified node matches the first node of the second regular flight, deleting the first node of the second regular flight; and if the last node of the second regular flight does not match the first node of the first regular flight, adding the first node of the first regular flight as the last node, thereby creating a vehicle connection flight.

6. An information processing device characterized by comprising a calculation unit that creates a transport vehicle connection flight by obtaining a combination of a first regular flight and a second regular flight from a set including multiple regular flights each having a route from a first node to a last node, each of which has a specified node at which the luggage will be loaded and to which node it will be transported, identifying the node at which the luggage will be loaded last by the first regular flight, adding the route of the second regular flight after the identified node, deleting the first node of the second regular flight if the identified node matches the first node of the second regular flight, and adding the first node of the first regular flight as the last node if the last node of the second regular flight does not match the first node of the first regular flight.

Images