JP2021081991A - Information processing device, information processing method, and program - Google Patents

Abstract

To provide a technique that can be used to generate more appropriate transportation and delivery plans.SOLUTION: Provided is an information processing device including: a utility value calculation unit configured to calculate a utility value corresponding to each of one or more cooperation structures that are constituted by dividing a plurality of pieces of transportation and delivery plan information, which is a set of respective elements, into one or a plurality of subsets; a cooperation structure selection unit configured to select, as a selected cooperation structure, a cooperation structure whose utility value satisfies a predetermined condition from the one or more cooperation structures; a profit amount calculation unit configured to calculate a profit amount corresponding to the selected cooperation structure; and a distribution amount calculation unit configured to calculate a distribution amount to be distributed to each of a plurality of persons concerned corresponding to the selected cooperation structure from the profit amount.SELECTED DRAWING: Figure 1

Description

The present invention relates to an information processing device, an information processing method and a program.

In recent years, labor shortages have progressed in the logistics industry, and resources such as trucks (hereinafter, also referred to as “trucks”) that operate and the number of drivers that operate have become insufficient for logistics consumers. Therefore, in order to transport and deliver a large amount of cargo using less resources, it is required to improve the loading efficiency of the cargo on the truck.

As a measure for improving the loading efficiency, a technique of mixedly loading cargoes of a plurality of logistics consumers on a truck is known. For example, one logistics company receives a transport / delivery request from each of a plurality of logistics consumers, and based on the transport / delivery request, the cargo requested by each of the plurality of logistics consumers is mixed and delivered. A method for generating the (joint) transportation / delivery plan information (hereinafter, also simply referred to as “transportation / delivery plan”) is disclosed (see, for example, Patent Document 1).

Japanese Unexamined Patent Publication No. 2018-180893

However, it is hoped that technology that can be used to generate more appropriate transport and delivery plans will be provided.

In order to solve the above problem, according to a certain viewpoint of the present invention, a plurality of transport / delivery plan information which is a set of each element is divided into one or a plurality of subsets and each is composed of one or a plurality of ways. A utility value calculation unit that calculates the utility value corresponding to each of the alliance structures, and an alliance structure selection unit that selects an alliance structure in which the utility value satisfies a predetermined condition from the one or more alliance structures as a selection alliance structure. A profit amount calculation unit that calculates the profit amount corresponding to the selective tie-up structure, and a distribution amount calculation unit that calculates the distribution amount to be distributed to each of a plurality of parties corresponding to the selective tie-up structure from the profit amount. An information processing device is provided.

The plurality of transportation / delivery plan information may be information indicating a transportation / delivery plan created by different logistics companies.

The utility value calculation unit may calculate the utility value corresponding to the alliance structure based on the characteristic function value of each of the one or a plurality of subsets constituting the alliance structure for each alliance structure.

The information processing device may include a characteristic function calculation unit that calculates a characteristic function value for each subset constituting at least one or a plurality of alliance structures.

The characteristic function calculation unit may calculate the characteristic function value for each subset constituting each of the one or more alliance structures based on the one or more alliance structures.

The characteristic function calculation unit calculates a characteristic function value for each subset constituting the plurality of transportation / delivery plan information, and the utility value calculation unit calculates a characteristic for each subset constituting the plurality of transportation / delivery plan information. From the function values, the characteristic function value for each subset constituting each of the one or a plurality of alliance structures may be selected.

Each of the plurality of transport / delivery plan information includes the amount of cargo to be loaded on the transport vehicle, the load capacity of the transport vehicle, and the transport / delivery cost, and the characteristic function calculation unit is one element belonging to the subset. When the loading capacity is equal to or greater than the sum of the cargo volumes of all the elements belonging to the subset, the result of subtracting the transport and delivery cost of the first element from the sum of the transport and delivery costs of all the elements is used as the characteristic function value. You may calculate.

The utility value calculation unit may calculate the sum of the characteristic function values of each of the one or a plurality of subsets constituting the alliance structure as the utility value corresponding to the alliance structure for each alliance structure.

The predetermined condition may include a condition that the utility value is the maximum in the one or a plurality of affiliated structures or a condition that the utility value is larger than a threshold value.

The information processing device generates new transportation / delivery plan information by integrating the plurality of elements when a subset including a plurality of elements exists in the subset constituting the selection tie-up structure. A plan regeneration unit may be provided.

The profit amount calculation unit may calculate the profit amount obtained when the transportation and delivery are performed according to the new transportation and delivery plan information instead of the plurality of elements.

Further, according to another aspect of the present invention, a plurality of transportation / delivery plan information, which is a set of each element, is divided into one or a plurality of subsets, and each of the one or a plurality of alliance structures is configured. Calculate the corresponding utility value, select the alliance structure whose utility value satisfies a predetermined condition from the one or more alliance structures as the selection alliance structure, and calculate the profit amount corresponding to the selection alliance structure. An information processing method is provided, which includes calculating the distribution amount to be distributed to each of the plurality of parties corresponding to the selective alliance structure from the profit amount.

Further, according to another aspect of the present invention, one or a plurality of alliances in which a computer is divided into one or a plurality of subsets of a plurality of transportation / delivery plan information which is a set of each element. A utility value calculation unit that calculates a utility value corresponding to each structure, an affiliated structure selection unit that selects an affiliated structure in which the utility value satisfies a predetermined condition from the one or a plurality of affiliated structures as a selected affiliated structure, and the selection. Information including a profit amount calculation unit that calculates the profit amount corresponding to the tie-up structure, and a distribution amount calculation unit that calculates the distribution amount to be distributed to each of a plurality of parties corresponding to the selected tie-up structure from the profit amount. A program for functioning as a processing device is provided.

As described above, the present invention provides a technique that can be used to generate a more appropriate transport and delivery plan.

It is a figure which shows the functional structure example of the information processing apparatus which concerns on 1st Embodiment of this invention. It is a figure which shows the configuration example of the transportation delivery plan set. It is a figure which shows the example of the characteristic function value corresponding to the alliance. It is a figure which shows the example of the alliance structure generated from the transportation delivery plan set. It is a figure which shows the example of the utility value corresponding to the alliance structure. It is a figure which shows the example of the selective tie-up structure. It is a figure which shows the example of the alliance which includes a plurality of transportation and delivery plans among the alliance which constitutes the selective alliance structure. It is a figure which shows the example of the movement cost. It is a figure which shows the example of the estimated time of arrival to each patrol point. It is a figure which shows the example of the newly generated transportation and delivery plan information. It is a figure which shows the example of the surplus profit amount. It is a figure which shows the example of the profit distribution amount. It is a figure which shows the example of a new transportation delivery plan set. It is a flowchart which shows the operation example of the information processing apparatus which concerns on 1st Embodiment of this invention. It is a flowchart which shows the operation example of the information processing apparatus which concerns on this embodiment. It is a block diagram which shows the functional structure example of the information processing apparatus which concerns on 2nd Embodiment of this invention. It is a flowchart which shows the operation example of the information processing apparatus which concerns on this embodiment. It is a flowchart which shows the operation example of the information processing apparatus which concerns on this embodiment. It is a figure which shows the hardware configuration of the information processing apparatus which concerns on embodiment of this invention.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the present specification and the drawings, components having substantially the same functional configuration are designated by the same reference numerals, so that duplicate description will be omitted.

Further, in the present specification and the drawings, a plurality of components having substantially the same functional configuration may be distinguished by adding different numbers after the same reference numerals. However, if it is not necessary to distinguish each of a plurality of components having substantially the same functional configuration, only the same reference numerals are given. Further, similar components of different embodiments may be distinguished by adding different alphabets after the same reference numerals. However, if it is not necessary to distinguish each of the similar components of different embodiments, only the same reference numerals are given.

<0. Overview>
First, an outline of an embodiment of the present invention will be described.

In recent years, labor shortages have progressed in the logistics industry, and resources such as trucks to operate and the number of drivers to operate have become insufficient for logistics consumers. Therefore, in order to transport and deliver a large amount of cargo using less resources, it is required to improve the loading efficiency of the cargo on the truck.

As a measure for improving the loading efficiency, a technique of mixing cargoes of a plurality of logistics consumers on a truck is known. For example, one logistics company receives a transport / delivery request from each of a plurality of logistics consumers, and based on the transport / delivery request, the cargo requested by each of the plurality of logistics consumers is mixed and delivered. A method for generating a (joint) transportation and delivery plan is disclosed. However, it is hoped that technology that can be used to generate more appropriate transport and delivery plans will be provided.

For example, it is difficult for one logistics company to generate a highly efficient (for example, high loading rate) transport / delivery plan based only on the transport / delivery requests received from each of a plurality of logistics consumers. There is. Especially for small and medium-sized logistics companies, which account for the majority of the logistics industry, it is difficult to generate a highly efficient transportation and delivery plan based only on the transportation and delivery requests received by each of multiple logistics consumers. There is a fact. The following two points can be cited as the main reasons for this situation.

1) Restrictions on transportation and delivery conditions Whether or not cargo can be mixedly loaded on a truck depends on the date and time when the cargo is delivered (collection and delivery date and time), the place where the cargo is delivered, and how the cargo is loaded in the truck. , There may be restrictions such as the temperature range of the cargo to be maintained during transportation and delivery, and the presence or absence of operations incidental to transportation and delivery (for example, pulling up goods from the place of stop). Under such restrictions, it is difficult for a logistics company to secure high efficiency (for example, a high loading rate) based only on the transportation and delivery requests received by the logistics company.

2) Low flexibility in adjusting transportation and delivery conditions At the stage of formulating a transportation and delivery plan, a logistics company requests a logistics consumer to change the transportation and delivery conditions that are the basis of the transportation and delivery plan, and then goes to the truck. It is also conceivable to increase the efficiency (for example, the loading rate) by adjusting the amount of cargo that can be mixedly loaded. However, since person-to-person negotiations via telephone or the like are inefficient, the logistics company usually does not change the transportation / delivery conditions or decline the transportation / delivery. Therefore, such cargo volume adjustments are rare except during some busy seasons.

Therefore, in the embodiment of the present invention, it is permitted to change the transportation / delivery conditions across the plurality of logistics companies based on the transportation / delivery plans generated by each of the plurality of logistics companies. This can generate a more appropriate transport and delivery plan than the transport and delivery plans generated by each of the plurality of logistics companies. More specifically, according to an embodiment of the present invention, a transportation / delivery plan having high efficiency (for example, high loading rate), low cost required, and low consumption resources, and a transportation / delivery plan having high social public interest. Can be generated.

In the embodiment of the present invention, transportation and delivery is used as a wording meaning to carry cargo, and may mean transportation or delivery. Transportation can mean carrying freight by truck with relatively long distance travel, and delivery can mean carrying freight by truck with relatively short distance travel. Further, in the embodiment of the present invention, it is mainly assumed that a truck carries freight, but even if a transportation means other than the truck (for example, a railroad vehicle, a ship, an aircraft, a drone, etc.) is used instead of the truck. Good.

<1. First Embodiment>
Subsequently, the first embodiment of the present invention will be described.

(1-1. Configuration example)
First, a configuration example of the information processing device according to the first embodiment of the present invention will be described. FIG. 1 is a diagram showing a functional configuration example of the information processing apparatus according to the first embodiment of the present invention. As shown in FIG. 1, the information processing device 300 according to the first embodiment of the present invention includes the affiliated structure generation device 100, the selective affiliated structure storage unit 301, the transportation / delivery plan generation device 200, and the transportation / delivery plan storage unit 302. , The surplus profit amount calculation unit 401 (profit amount calculation unit), and the profit distribution amount calculation unit 402 (distribution amount calculation unit) are provided.

The affiliated structure generation device 100 includes an input unit 101, a characteristic function calculation unit 102, a characteristic function storage unit 103, an affiliated structure storage unit 106, and a structure extraction unit 110. The structure extraction unit 110 includes an alliance structure prototype unit 104, a utility value calculation unit 105, and an alliance structure selection unit 107. The transportation / delivery plan generation device 200 includes a tie-up information input unit 201, a movement cost acquisition unit 202, an operation plan generation unit 203, and a transportation / delivery plan regeneration unit 204.

The information processing device 300 according to the first embodiment of the present invention is composed of a computer. Here, the information processing device 300 includes a control unit (not shown) and a storage unit (not shown).

The control unit (not shown) includes a CPU (Central Processing Unit) and the like, and the function is realized by the program stored in the storage unit (not shown) being expanded and executed by the CPU in a RAM (Random Access Memory). obtain. At this time, a computer-readable recording medium on which the program is recorded may also be provided. Alternatively, the control unit (not shown) may be configured by dedicated hardware or may be configured by a combination of a plurality of hardware.

For example, by a control unit (not shown), an input unit 101, a characteristic function calculation unit 102, an affiliated structure prototype unit 104, a utility value calculation unit 105, an affiliated structure selection unit 107, an affiliated information input unit 201, a movement cost acquisition unit 202, and an operation plan. The generation unit 203, the transportation / delivery plan regeneration unit 204, the surplus profit amount calculation unit 401, and the profit distribution amount calculation unit 402 can be realized.

A storage unit (not shown) is a storage device capable of storing programs and data for operating a control unit (not shown). Further, the storage unit (not shown) can temporarily store various data required in the process of operation of the control unit (not shown). For example, the storage device may be a non-volatile storage device. For example, a characteristic function storage unit 103, an affiliated structure storage unit 106, a selective affiliated structure storage unit 301, and a transportation / delivery plan storage unit 302 can be realized by a storage unit (not shown).

(Transportation and delivery plan set R1)
The transportation / delivery plan set R1 is composed of a plurality of transportation / delivery plans. That is, the transportation / delivery plan set R1 is a set having each of the plurality of transportation / delivery plans as an element. A plurality of transport and delivery plans are information indicating plans for transport and delivery generated by different plan generation companies. As described above, in the embodiment of the present invention, it is allowed to change the transportation / delivery plan across the plurality of planning companies based on the transportation / delivery plan generated by each of the plurality of planning companies. This can generate a more appropriate transport and delivery plan than the transport and delivery plans generated by each of the multiple plan generators.

(Input unit 101)
The transportation / delivery plan set R1 is input to the input unit 101. For example, when each of the plurality of transportation / delivery plans constituting the transportation / delivery plan set R1 is received from the computer of the corresponding planning company via the network by the information processing device 300, the information processing device 300 is input to the input unit 101. The plurality of transportation and delivery plans received by may be entered. Alternatively, when a plurality of transportation / delivery plans are recorded in any recording medium as the transportation / delivery plan set R1 in advance, the input unit 101 may read the transportation / delivery plan set R1 from the recording medium.

FIG. 2 is a diagram showing a configuration example of the transportation / delivery plan set R1. As shown in FIG. 2, in the embodiment of the present invention, the transportation / delivery plan set R1 is composed of three transportation / delivery plans (in the example shown in FIG. 2, the transportation / delivery plans of plans Nos. 1 to 3). Mainly assume the case. However, the number of transport / delivery plans constituting the transport / delivery plan set R1 is not particularly limited as long as it is plural. In other words, the transportation / delivery plan set R1 is a set having each of the three transportation / delivery plans as an element. Therefore, in the following, the transport / delivery plan set R1 may be expressed as N = {1, 2, 3} (elements 1 to 3 indicate the transport / delivery plans of plans Nos. 1 to 3).

As shown in FIG. 2, each transportation / delivery plan constituting the transportation / delivery plan set R1 has a “plan No.”. , "Planning company", "Departure" information, "Arrival" information, "Stop-by" information, "Gross vehicle weight", "Cargo carrier", "Arranged truck capacity" , "Transportation cost" and "order amount" are associated with each other.

The "plan No." is information for uniquely identifying the transportation / delivery plan. A “planning company” is a company that has generated a transportation / delivery plan, and can correspond to an example of a logistics company (a company that provides services related to logistics). Information about "departure" includes the date and time of departure and the place of departure. That is, the truck loaded with cargo is required to depart from the departure place on the departure date and time. Information about "arrival" includes the date and time of arrival and the place of arrival. That is, it is required that the truck for which the cargo has been transported and delivered arrives at the arrival place by the arrival date and time.

Information about "stops" includes the date and time of the stop from departure to arrival and the place of stop. That is, it is required that the cargo be transported and delivered to the stop-by place by the stop-by date and time. As shown in FIG. 2, in the embodiment of the present invention, it is mainly assumed that there are three stops (stops 1 to 3 in the example shown in FIG. 2). However, the number of stops is not particularly limited as long as it is one or more.

"Gross vehicle weight" indicates the amount of cargo to be loaded on the truck (that is, the total weight of the cargo to be transported to the stop-by place). A "transporter" is a company that transports and delivers cargo according to a transport and delivery plan, and can correspond to the example of a logistics company. “Arranged truck capacity” indicates the load capacity of the arranged truck (that is, the maximum total weight of cargo that can be loaded on the arranged truck). Since the arranged truck is a truck for which arrangements for transportation and delivery have already been completed, it is possible to carry out transportation and delivery according to the transportation and delivery plan.

"Transportation and delivery cost" is the cost required for transportation and delivery of cargo. The method of expressing the transportation and delivery cost is not particularly limited. For example, the transportation and delivery cost may include the amount of money required for transportation and delivery of the cargo itself, or may include a value obtained by replacing the amount of money required for transportation and delivery of the cargo by a predetermined algorithm. Alternatively, the transportation and delivery costs may include non-monetary costs for the transportation and delivery of the cargo (for example, the number of personnel on the truck for the transportation and delivery work). Alternatively, the transportation / delivery cost may be an environmental load (for example, carbon dioxide emissions) associated with the transportation / delivery of cargo.

The "order amount" is the amount of money paid in exchange for the transportation and delivery of freight from the logistics consumer who placed the order for transportation and delivery.

(Characteristic function calculation unit 102)
The explanation will be continued by returning to FIG. A plurality of types of subsets (hereinafter, also referred to as “tie-up S”) can be extracted from the transportation / delivery plan set R1. Each of the plurality of alliances S is composed of one or more elements (ie, one or more transportation and delivery plans). The characteristic function calculation unit 102 calculates the characteristic function value for each alliance S constituting the transportation / delivery plan set R1 based on the transportation / delivery plan set R1 input to the input unit 101. For example, the characteristic function value can be an amount (amount of reduction in transportation / delivery cost) indicating how much the transportation / delivery cost can be reduced.

For example, it is assumed that the load capacity of the arranged truck of one transportation / delivery plan belonging to a certain tie-up S is equal to or larger than the total cargo volume of all the transportation / delivery plans belonging to the tie-up S. In such a case, it is considered possible to load all the cargoes of the transportation / delivery plan belonging to the alliance S together on the truck (that is, the truck to be used) for which the transportation / delivery plan of 1 is arranged. .. At this time, among the transportation and delivery plans belonging to the alliance S, the transportation and delivery by the arranged trucks other than the transportation and delivery plan of the one (that is, the trucks that do not need to be used) need not be performed.

Therefore, the characteristic function calculation unit 102 subtracts the transportation / delivery cost of the transportation / delivery plan of 1 from the sum of the transportation / delivery costs of all the transportation / delivery plans belonging to the alliance S, and obtains the result of subtracting the transportation / delivery cost of the alliance S from the characteristic function value corresponding to the alliance S. It can be calculated as.

On the other hand, it is assumed that the load capacity of the arranged trucks of any of the transportation and delivery plans belonging to a certain tie-up S is less than the total cargo volume of all the transportation and delivery plans belonging to the tie-up S. In such a case, the characteristic function calculation unit 102 may set a predetermined value (for example, a negative value) as the characteristic function value corresponding to the alliance S. In the following, it is mainly assumed that "-1" is used as an example of a predetermined value. However, the predetermined value is not limited to "-1".

Further, for example, it is assumed that the loading capacity of the arranged trucks of each of the two or more transportation and delivery plans belonging to a certain alliance S is equal to or more than the total cargo volume of all the transportation and delivery plans belonging to the alliance S. In such a case, among the arranged trucks of the two or more transportation and delivery plans, the arranged truck (that is, the truck to be used) having the lowest transportation and delivery cost is loaded with the cargo of all the transportation and delivery plans belonging to the alliance S. Loading in bulk reduces transportation and delivery costs even more.

Therefore, the characteristic function calculation unit 102 corresponds to the alliance S as a result of subtracting the minimum value of the transportation and delivery costs of the two or more transportation and delivery plans from the total of the transportation and delivery costs of all the transportation and delivery plans belonging to the alliance S. It may be calculated as a characteristic function value to be used.

Based on the above, the maximum value of the arranged truck capacity of the transport / delivery plan belonging to the alliance S is bound (S), the total cargo weight of the transport / delivery plan {i} is w ({i}), and the transport / delivery plan {i}. Let c ({i}) be the transportation and delivery cost of, and c (S) be the transportation and delivery cost corresponding to the truck to be used (excluding the trucks that do not need to be used), and v be the characteristic function value corresponding to the affiliated S. Assuming (S), as an example, the characteristic function calculation unit 102 can calculate v (S) as shown by the following equation (1).

FIG. 3 is a diagram showing an example of the characteristic function value v (S) corresponding to the alliance S. As shown in FIG. 3, from the transportation / delivery plan set R1, the alliance No. Alliance S corresponding to each of 1 to 7 is extracted. Then, when the characteristic function calculation unit 102 calculates according to the equation (1) based on these alliance S, the characteristic function value v (S) corresponding to each of these alliance S is obtained as shown in FIG. Be done.

(Characteristic function storage unit 103)
The characteristic function storage unit 103 stores the characteristic function value v (S) obtained by the characteristic function calculation unit 102.

(Affiliated Structure Prototype Department 104)
The tie-up structure prototype unit 104 divides the transportation / delivery plan set R1 into one or a plurality of tie-ups S without omission and duplication based on the transportation / delivery plan set R1 input to the input unit 101, so that one or a plurality of ways can be obtained. A tie-up structure (hereinafter, also referred to as “tie-up structure CS”) is generated. By using the tie-up structure CS, not only the reduction amount of the transportation and delivery cost corresponding only to the specific tie-up S constituting the transportation and delivery plan set R1, but also the reduction amount of the transportation and delivery cost as a whole of the transportation and delivery plan set R1. Will be taken into account.

In the embodiment of the present invention, it is mainly assumed that all the alliance structure CSs that can be generated from the transportation / delivery plan set R1 are generated by the alliance structure prototype unit 104. However, the tie-up structure prototype unit 104 may generate only a part of the tie-up structure CS that can be generated from the transportation / delivery plan set R1. The tie-up structure CS may be prepared in advance.

FIG. 4 is a diagram showing an example of an alliance structure generated from the transportation / delivery plan set R1. As shown in FIG. 4, from the transportation / delivery plan set R1, the alliance structure No. Affiliated structure CS corresponding to each of 1 to 5 is generated. That is, in the embodiment of the present invention, it is mainly assumed that five types of alliance structure CS that can be generated from the transportation / delivery plan set R1 are generated. However, the number of alliance structure CS generated from the transportation / delivery plan set R1 may be one, or may be a plurality of other than five.

(Utility value calculation unit 105)
The utility value calculation unit 105 calculates the utility value u (CS) corresponding to each of one or a plurality of alliance structure CSs. More specifically, the characteristic function calculation unit 102 calculates the characteristic function value for each of the alliance S constituting at least one or a plurality of alliance structure CS, and the characteristic function storage unit 103 stores the characteristic function value. Therefore, the utility value calculation unit 105 acquires the characteristic function value v (S) from the characteristic function storage unit 103, and constitutes the characteristic function value v (S) of each of the one or a plurality of alliance Ss constituting the alliance structure CS for each alliance structure CS. Based on S), the utility value u (CS) corresponding to the alliance structure CS is calculated.

In the first embodiment of the present invention, it is assumed that the characteristic function calculation unit 102 calculates the characteristic function value v (S) for each alliance S constituting the transportation / delivery plan set R1 (FIG. 3). Therefore, the utility value calculation unit 105 forms an alliance structure CS (corresponding to each of the alliance structures Nos. 1 to 5) from the characteristic function value v (S) for each alliance S constituting the transportation / delivery plan set R1. The characteristic function value v (S) for each S is selected. Then, the utility value calculation unit 105 calculates the utility value u (CS) corresponding to the affiliated structure CS based on the selected characteristic function value v (S).

As an example, the utility value calculation unit 105 sets the sum of the characteristic function values v (S) of each of the one or a plurality of alliance Ss constituting the alliance structure CS for each alliance structure CS as the utility value u (CS) corresponding to the alliance structure CS. ). As a result, the larger the total value of the characteristic function values v (S), the larger the alliance structure CS can be obtained. That is, the utility value u (CS) can be calculated as shown by the following equation (2) using the characteristic function values v (S) of each of the one or a plurality of alliance S constituting the alliance structure CS. ..

However, the calculation method of the utility value u (CS) corresponding to the tie-up structure CS is not limited. For example, the utility value calculation unit 105 may calculate the multiplication result of the characteristic function values v (S) as the utility value u (CS).

(Affiliated structure storage unit 106)
The tie-up structure storage unit 106 stores the tie-up structure CS generated by the tie-up structure prototype unit 104 and the utility value u (CS) corresponding to the tie-up structure CS obtained by the utility value calculation unit 105 in association with each other.

FIG. 5 is a diagram showing an example of a utility value u (CS) corresponding to the alliance structure CS (corresponding to each of the alliance structures Nos. 1 to 5). As shown in FIG. 5, the tie-up structure storage unit 106 is obtained by the tie-up structure CS generated by the tie-up structure prototype unit 104 (corresponding to each of the tie-up structures Nos. 1 to 5) and the utility value calculation unit 105. The utility value u (CS) corresponding to the tie-up structure CS is stored in association with each other.

(Affiliated structure selection unit 107)
The tie-up structure selection unit 107 selects the tie-up structure CS whose utility value u (CS) satisfies a predetermined condition from the tie-up structure CS (corresponding to each of the tie-up structures Nos. 1 to 5) as the selection tie-up structure. Here, the predetermined conditions are not limited to specific conditions. In the embodiment of the present invention, it is mainly assumed that the predetermined condition includes the condition that the utility value u (CS) is the largest among the alliance structure CS (corresponding to each of the alliance structures Nos. 1 to 5). To do. However, the predetermined condition may include the condition that the utility value u (CS) is larger than the threshold value.

(Selective Alliance Structure Storage Unit 301)
The selection tie-up structure storage unit 301 stores the selection tie-up structure R2 (hereinafter, also referred to as “selection tie-up structure CS *”) selected by the tie-up structure selection unit 107.

FIG. 6 is a diagram showing an example of the selective tie-up structure CS *. As shown in FIG. 6, the selection tie-up structure storage unit 301 stores the selection tie-up structure CS * selected by the tie-up structure selection unit 107. Note that FIG. 6 also shows the utility value u (CS *) corresponding to the selected tie-up structure CS * selected by the tie-up structure selection unit 107.

(Affiliation information input unit 201)
The tie-up information input unit 201 acquires the selection tie-up structure CS * stored in the selection tie-up structure storage unit 301. In the selective tie-up structure CS *, there may be a tie-up S that includes only one transport / delivery plan (one element), or there may be a tie-up S that includes a plurality of transport / delivery plans (plural elements). From the tie-up information input unit 201, the tie-up S including a plurality of transportation and delivery plans is output to each of the movement cost acquisition unit 202 and the operation plan generation unit 203. On the other hand, the selection tie-up structure CS * is output from the tie-up information input unit 201 to the transportation / delivery plan regeneration unit 204.

FIG. 7 is a diagram showing an example of the alliance S including a plurality of transportation and delivery plans among the alliance S constituting the selective alliance structure CS *. Referring to FIG. 7, among the alliances constituting the selective alliance structure CS * (FIG. 6), the alliance S {3} includes only one transportation and delivery plan, but the alliance S {1, 2} Includes multiple transport and delivery plans. Therefore, the tie-up information input unit 201 outputs the tie-up S {1, 2} including a plurality of transportation / delivery plans to each of the movement cost acquisition unit 202 and the operation plan generation unit 203.

(Movement cost acquisition unit 202)
The movement cost acquisition unit 202 is a map in which among the alliance S included in the selective alliance structure CS *, the alliance S {1,2} including a plurality of transportation and delivery plans, and the location (address) and coordinates are associated with each other. Based on the information, the travel cost between the same transportation and delivery plans and between different transportation and delivery plans (stop-by place, departure place and arrival place) is acquired. The movement cost may be the distance between the patrol points or the time required when moving between the patrol points at a predetermined speed. Further, the map information may be acquired from a navigation system or the like.

FIG. 8 is a diagram showing an example of the movement cost. Examples of the patrol points corresponding to the transportation / delivery plan {1} include departure / arrival locations P and stop-by locations P1 to P3 (Fig. 2). On the other hand, as the patrol points corresponding to the transportation / delivery plan {2}, the departure / arrival place P and the stop-by place P1'to P3
'Is mentioned (Fig. 2). As an example, between the same transportation / delivery plans {1}, the same transportation / delivery plans {2}, and between different transportation / delivery plans {1} and {2} patrol points (stop-in place, departure place and arrival place). The travel cost of is acquired as shown in FIG.

Of the components in the matrix shown in FIG. 8, the component in the first column indicates the start point, and the component in the first row indicates the end point. Also, the other components in the matrix shown in FIG. 8 indicate the cost of moving between the corresponding start point (first column) and end point (first row). For example, the movement cost when moving from the patrol point P to the patrol point P1 is “2”, which is a component of the second row and the third column in the matrix shown in FIG.

(Operation plan generation unit 203)
The operation plan generation unit 203 has a date and time (scheduled collection and delivery date and time) corresponding to each patrol point (stop-in place, departure place and arrival place) of the transportation and delivery plan {1} and the transportation and delivery plan {2}, and a movement cost acquisition unit 202. Calculate the patrol order in which each patrol point can be reached at the corresponding date and time, based on the travel costs obtained by. For example, the operation plan generation unit 203 can calculate the traveling order by solving the traveling salesman problem with a time limit or the time frame delivery planning problem. At this time, the operation plan generation unit 203 can calculate the estimated time of arrival at each patrol point as well as the patrol order.

FIG. 9 is a diagram showing an example of estimated time of arrival at each patrol point. In FIG. 9, as an example of the calculation result of the patrol order in which the operation plan generation unit 203 can arrive at each patrol point at the corresponding date and time, the patrol points P, P1', P1, P2', P3', An example of obtaining the order of P2, P3, P is shown. Further, in FIG. 9, the operation plan generation unit 203 uses “7:00”, “8:00”, “9:00”, “10:00”, and “as an example of the calculation result of the estimated time of arrival at each patrol point”. An example of obtaining "11:00", "12:00", "13:00", and "14:00" is shown.

(Transportation and delivery plan regeneration unit 204)
The transportation / delivery plan regeneration unit 204 is included in the selection tie-up structure CS * output from the tie-up information input unit 201 (including a plurality of transportation / delivery plans {1} and a transportation / delivery plan {2}. ) A new transport / delivery plan is generated by integrating the transport / delivery plan {1} and the transport / delivery plan {2} included in the alliance S. More specifically, the transport / delivery plan regeneration unit 204 uses the patrol order generated by the operation plan generator 203 and the estimated time of arrival at each patrol point to be used for each patrol point (stop-by place) in the new transport / delivery plan. , Departure place and arrival place) and date and time.

FIG. 10 is a diagram showing an example of newly generated transportation / delivery plan information. As shown in FIG. 10, the transportation / delivery plan regeneration unit 204 may set each patrol point (stop-in place, departure place and arrival place) and date and time in the new transportation / delivery plan R3. Since the new transport / delivery plan R3 is the result of integrating the transport / delivery plan {1} and the transport / delivery plan {2}, the stop-by locations are the transport / delivery plan {1} and the transport / delivery plan {2}, respectively. There are more places to stop by (Fig. 2).

In the example shown in FIG. 10, since it is assumed that the truck of the transportation / delivery plan {1} is used, the carrier of the new transportation / delivery plan R3, the arranged truck capacity, the transportation cost, and the order are received. The corresponding data (FIG. 2) of the transportation / delivery plan {1} is set for the amount. On the other hand, the total freight capacity of the new freight delivery plan R3 is set to the total freight capacity of each of the freight delivery plan {1} and the freight delivery plan {2}. Further, referring to FIG. 10, the plan No. of the new transportation / delivery plan R3. Is newly set to "4".

(Transportation and delivery plan storage unit 302)
The transportation / delivery plan storage unit 302 stores a new transportation / delivery plan R3 generated by the transportation / delivery plan regeneration unit 204. In addition, the alliance S included in the selective alliance structure CS * also includes the alliance S including one transportation / delivery plan {3}. Such a transport and delivery plan {3} is not integrated with other transport and delivery plans. Therefore, the transportation / delivery plan storage unit 302 stores the transportation / delivery plan {3} as it is.

(Surplus profit calculation unit 401)
The surplus profit amount calculation unit 401 acquires the selection tie-up structure CS * from the selection tie-up structure storage unit 301, and calculates the profit amount (surplus profit amount) corresponding to the selection tie-up structure CS *. More specifically, the surplus profit calculation unit 401 is based on the selective tie-up structure CS * and the new transport / delivery plan R3, and is the transport / delivery plan {1 which is the transport / delivery plan before integration included in the selective tie-up structure CS *. } And the transportation and delivery plan {2}, and calculate the surplus profit amount obtained when the transportation and delivery are performed according to the transportation and delivery plan {4} (new transportation and delivery plan R3) which is the transportation and delivery plan after integration. ..

For example, let S be an alliance that includes a plurality of transportation and delivery plans included in the selective alliance structure CS *, and set any plan No. of the plurality of transportation and delivery plans. Is i, and price (i) is planned No. The order amount corresponding to i, and cont (S) is the transport / delivery plan that will be taken over as a new transport / delivery plan among the multiple transport / delivery plans (the transport / delivery plan in which trucks are used in the new transport / delivery plan). Plan No. Then, as an example, the surplus profit amount calculation unit 401 can calculate the surplus profit amount prof (S) as shown by the following equation (3).

FIG. 11 is a diagram showing an example of the amount of surplus profit. In the example shown in FIG. 11, it is assumed that the selective tie-up structure CS * includes a tie-up including a plurality of transportation and delivery plans {1, 2}. In addition, it is assumed that the transportation and delivery plan {1} of this alliance will be taken over as a new transportation and delivery plan. In such a case, as shown in FIG. 11, the order amount of the transportation / delivery plan {2}, “1,000”, can be calculated as the surplus profit amount.

In the embodiment of the present invention, it is mainly assumed that the surplus profit amount is an amount obtained by subtracting the order amount of the transportation / delivery plan after the integration from the total order amount of the transportation / delivery plan before the integration. However, the method for calculating the amount of surplus profit is not limited to such an example. For example, if the integration of transportation and delivery plans yields some reward (such as the amount of money or points that can be returned to cash), the surplus profit amount may be such reward.

(Profit distribution amount calculation unit 402)
The profit distribution amount calculation unit 402 distributes the profit distribution amount (allocation amount) to each of a plurality of return target persons (related parties) corresponding to the selective tie-up structure CS * from the surplus profit amount calculated by the surplus profit amount calculation unit 401. ) Is calculated. As a result, the amount of profit obtained by integrating the transportation and delivery plans can be grasped for each returnee.

More specifically, the profit sharing amount calculation unit 402 includes the transportation and delivery before integration included in the selective tie-up structure CS * based on the surplus profit amount calculated by the surplus profit amount calculation unit 401 and the selective tie-up structure CS *. The profit sharing amount of the surplus profit amount to be distributed to each of the planned transportation and delivery plan {1} and the transportation and delivery plan {2} is calculated.

In the embodiment of the present invention, it is mainly assumed that the person to be returned is a planning company. For example, when the transportation / delivery plan {1} and the transportation / delivery plan {2} are integrated, the return target person may include the planning company B1 and the planning company B2 (FIG. 2). However, the return target is not limited to the case where the planning company is included. For example, the returnee may include a carrier.

The method of calculating the amount of profit distribution is not limited to a specific method. For example, as a method for calculating the amount of profit distribution, a method for obtaining various solutions by an analysis method in cooperative game theory may be used. For example, examples of the solution obtained by the analysis method in the cooperative game theory include core, jin, and Shapley value, but the solution obtained by the analysis method in the cooperative game theory is not limited to such an example. In the following, it is assumed that an analysis method for obtaining the Shapley value is used as a calculation method for the amount of profit distribution.

That is, the tie-up including a plurality of transportation and delivery plans included in the selective tie-up structure CS * is defined as S, and any plan No. of the plurality of transportation and delivery plans. When prof (S) shown in the formula (3) is used as the surplus profit amount, the profit distribution amount calculation unit 402 uses the plan No. as shown by the following formula (4). The profit distribution amount φi (S) to be distributed to the returnees corresponding to i can be calculated.

FIG. 12 is a diagram showing an example of the profit distribution amount. In the example shown in FIG. 12, as in the case shown in FIG. 11, the selective alliance structure CS * includes an alliance including a plurality of transportation and delivery plans {1, 2}, and the surplus profit amount is “. It is assumed that the calculation is "1,000". In such a case, when the profit distribution amount calculation unit 402 uses an analysis method for obtaining the Shapley value as the profit distribution amount calculation method, as shown in FIG. 12, the return target person (planning company B1) is provided. "500" can be calculated as the profit distribution amount, and "500" can be calculated as the profit distribution amount to the return target person (planning company B2).

The profit distribution amount calculation unit 402 includes the transportation / delivery plan {4} (new transportation / delivery plan R3), which is the transportation / delivery plan after integration, the profit distribution amount added to the transportation / delivery plan {4}, and others. Outputs a new transport and delivery plan set R4 that includes a transport and delivery plan {3} that is not integrated with the transport and delivery plan of. FIG. 13 is a diagram showing an example of a new transportation / delivery plan set R4. Referring to FIG. 13, a profit distribution amount is added to the transportation / delivery plan {4} (corresponding to the plan No. 4) in the new transportation / delivery plan set R4.

The functional configuration example of the information processing apparatus 300 according to the first embodiment of the present invention has been described above.

(1-2. Operation example)
Subsequently, an operation example of the information processing apparatus 300 according to the first embodiment of the present invention will be described. 14 and 15 are flowcharts showing an operation example of the information processing apparatus 300 according to the first embodiment of the present invention. The operation examples shown in FIGS. 14 and 15 are merely examples of the operation of the information processing apparatus 300 according to the first embodiment of the present invention. Therefore, the operation of the information processing apparatus 300 according to the first embodiment of the present invention is not limited to the operation examples shown in FIGS. 14 and 15.

First, as shown in FIG. 14, in the affiliated structure generation device 100, the transportation / delivery plan set R1 is input to the input unit 101. The characteristic function calculation unit 102 calculates the characteristic function value v (S) for each alliance S constituting the transportation / delivery plan set R1 based on the transportation / delivery plan set R1 input to the input unit 101 (S101). Then, the characteristic function calculation unit 102 stores the characteristic function value v (S) for each affiliated S in the characteristic function storage unit 103 (S102).

Subsequently, the tie-up structure prototype unit 104 divides the transportation / delivery plan set R1 into one or a plurality of tie-up S without omission and duplication based on the transportation / delivery plan set R1 input to the input unit 101, thereby forming the tie-up structure. Generate CS (S103).

Subsequently, the utility value calculation unit 105 selects the characteristic function value v (S) for each alliance S constituting the alliance structure CS from the characteristic function value v (S) for each alliance S constituting the transportation / delivery plan set R1. To do. Then, the utility value calculation unit 105 calculates the utility value u (CS) corresponding to the affiliated structure CS based on the selected characteristic function value v (S) (S104). As an example, the utility value calculation unit 105 calculates the sum of the characteristic function values v (S) of each of the one or a plurality of alliance S constituting the alliance structure CS as the utility value u (CS) corresponding to the alliance structure CS.

Subsequently, the utility value calculation unit 105 associates the tie-up structure CS generated by the tie-up structure prototype unit 104 with the utility value u (CS) corresponding to the tie-up structure CS obtained by the utility value calculation unit 105. It is stored in the affiliated structure storage unit 106 (S105). Then, the tie-up structure selection unit 107 determines whether or not the tie-up structure CS generated by the tie-up structure prototype unit 104 satisfies a predetermined condition (S106). Examples of predetermined conditions are as described above.

When the tie-up structure selection unit 107 determines that the tie-up structure CS generated by the tie-up structure prototype unit 104 does not satisfy a predetermined condition (“NO” in S106), the operation shifts to S103 (for the next tie-up structure). Action is performed). On the other hand, when the tie-up structure selection unit 107 determines that the tie-up structure CS generated by the tie-up structure prototype unit 104 satisfies a predetermined condition (“YES” in S106), the tie-up structure CS is designated as the selection tie-up structure CS *. Select (S107).

Subsequently, as shown in FIG. 15, the selection tie-up structure storage unit 301 stores the selection tie-up structure CS * selected by the tie-up structure selection unit 107 (S301). In the transportation / delivery plan generation device 200, the tie-up information input unit 201 acquires the selection tie-up structure CS * stored in the selection tie-up structure storage unit 301. The movement cost acquisition unit 202 is based on the alliance S including a plurality of transportation and delivery plans among the alliance S included in the selective alliance structure CS *, and the map information in which the location (address) and the coordinates are associated with each other. , Acquire the travel cost between the same transportation / delivery plans and different transportation / delivery plans (stop-in place, departure place and arrival place) (S202).

Subsequently, the operation plan generation unit 203 was acquired by the travel cost acquisition unit 202 and the date and time (scheduled collection and delivery date and time) corresponding to the patrol points (stop-in place, departure place and arrival place) of each of the plurality of transportation and delivery plans. Based on the travel cost, the patrol order that can reach each patrol point at the corresponding date and time is calculated (S202). Further, the operation plan generation unit 203 calculates the estimated time of arrival at each patrol point as well as the patrol order (S203).

Subsequently, the transportation / delivery plan regeneration unit 204 includes the plurality of transportation / delivery plans included in the tie-up S (including a plurality of transportation / delivery plans) included in the selection tie-up structure CS * output from the tie-up information input unit 201. To generate a new transportation and delivery plan by integrating (S204). More specifically, the transport / delivery plan regeneration unit 204 uses the patrol order generated by the operation plan generator 203 and the estimated time of arrival at each patrol point to be used for each patrol point (stop-by place) in the new transport / delivery plan. , Departure place and arrival place) and date and time.

Subsequently, the transportation / delivery plan storage unit 302 stores a new transportation / delivery plan R3 generated by the transportation / delivery plan regeneration unit 204 (S302). The transportation / delivery plan regeneration unit 204 determines whether or not a new transportation / delivery plan has been generated from all the alliance S (including a plurality of transportation / delivery plans) included in the selective tie-up structure CS * (S303). ..

When the transportation / delivery plan regeneration unit 204 determines that the new transportation / delivery plan has not been generated (“NO” in S303), the operation shifts to S201 (the operation for the next alliance S is executed). Will be). On the other hand, when the transport / delivery plan regeneration unit 204 determines that the new transport / delivery plan has been generated (“YES” in S303), the operation shifts to S401. At this time, the transportation / delivery plan storage unit 302 stores the transportation / delivery plan included in the alliance S (including one transportation / delivery plan) included in the selective tie-up structure CS *.

Subsequently, the surplus profit amount calculation unit 401 acquires the selection tie-up structure CS * from the selection tie-up structure storage unit 301, and calculates the profit amount (surplus profit amount) corresponding to the selection tie-up structure CS * (S401). Then, the profit distribution amount calculation unit 402 distributes the profit distribution amount (relevant person) corresponding to the selective tie-up structure CS * from the surplus profit amount calculated by the surplus profit amount calculation unit 401 to each of the plurality of return target persons (related persons). (Distribution amount) is calculated (S402).

Next, the profit distribution amount calculation unit 402 describes the integrated transportation / delivery plan (new transportation / delivery plan), the profit distribution amount added to the integrated transportation / delivery plan, and other transportation / delivery plans. Output a new transport and delivery plan set that includes the unintegrated transport and delivery plans (S304).

The operation example of the information processing apparatus 300 according to the first embodiment of the present invention has been described above.

(1-3. Effect)
As described above, according to the first embodiment of the present invention, there is provided a technique that can be used to generate a more appropriate transportation / delivery plan. More specifically, according to the first embodiment of the present invention, the transportation and delivery conditions are changed across the plurality of logistics companies based on the transportation and delivery plans generated by each of the plurality of logistics companies. Is allowed. This can generate a more appropriate transport and delivery plan than the transport and delivery plans generated by each of the plurality of logistics companies.

For example, according to the first embodiment of the present invention, a highly efficient (for example, high loading rate) transportation and delivery plan can be generated. Further, according to the first embodiment of the present invention, since it is possible to reduce the transportation and delivery cost (for example, to reduce the number of trucks used), the required cost is low and the consumption resource is low. A delivery plan can be generated. Further, according to the first embodiment of the present invention, since the number of trucks used can be reduced, the amount of environmental load (for example, the amount of carbon dioxide emitted from the truck) due to the transportation and delivery of cargo is suppressed. It is possible to generate a transportation and delivery plan with high social and public interest.

The first embodiment of the present invention has been described above.

<2. Second embodiment>
Subsequently, a second embodiment of the present invention will be described.

(2-1. Configuration example)
Subsequently, an example of the functional configuration of the information processing apparatus 500 according to the second embodiment of the present invention will be described with reference to FIG. FIG. 16 is a block diagram showing a functional configuration example of the information processing apparatus 500 according to the second embodiment of the present invention. As shown in FIG. 16, the information processing device 500 according to the second embodiment of the present invention includes the alliance structure generation device 400 instead of the alliance structure generation device 100, and the first embodiment of the present invention. It is different from the information processing apparatus 300 according to the above. Therefore, in the second embodiment of the present invention, the affiliated structure generation device 400 will be mainly described, and the detailed description of the transportation / delivery plan generation device 200 will be omitted.

Further, in the following, among the functions possessed by the affiliated structure generating device 400 according to the second embodiment of the present invention, the functions different from the functions possessed by the affiliated structure generating apparatus 100 according to the first embodiment of the present invention are mainly described. It will be described, and detailed description of common points will be omitted.

In the first embodiment of the present invention, it is assumed that the characteristic function calculation unit 102 calculates the characteristic function value v (S) for each affiliated S constituting the transportation / delivery plan set R1 input to the input unit 101. .. Then, the utility value calculation unit 105 selects the characteristic function value v (S) for each tie-up S constituting the tie-up structure CS from the characteristic function value v (S) for each tie-up S constituting the transportation / delivery plan set R1. , It is assumed that the utility value u (CS) corresponding to the tie-up structure CS is calculated based on the selected characteristic function value v (S).

In the second embodiment of the present invention, one or more kinds of alliance structure CS generated by the alliance structure prototype unit 104 are output to the characteristic function calculation unit 102. Then, the characteristic function calculation unit 102 is based on the one or a plurality of alliance structure CSs generated by the alliance structure prototype unit 104, and the characteristic function value v for each alliance S constituting each of the one or a plurality of alliance structure CSs. (S) is calculated. According to such a configuration, the characteristic function value v (S) needs to be calculated only for the alliance S constituting each of one or a plurality of alliance structure CS generated by the alliance structure prototype unit 104. It is possible to reduce the amount.

The functional configuration example of the information processing apparatus 500 according to the second embodiment of the present invention has been described above.

(2-2. Operation example)
Subsequently, an operation example of the information processing apparatus 500 according to the second embodiment of the present invention will be described. 17 and 18 are flowcharts showing an operation example of the information processing apparatus 500 according to the second embodiment of the present invention. The operation examples shown in FIGS. 17 and 18 are merely examples of the operation of the information processing apparatus 500 according to the second embodiment of the present invention. Therefore, the operation of the information processing apparatus 500 according to the second embodiment of the present invention is not limited to the operation examples shown in FIGS. 17 and 18.

First, as shown in FIG. 17, in the affiliated structure generation device 100, the transportation / delivery plan set R1 is input to the input unit 101. The tie-up structure prototype unit 104 generates the tie-up structure CS by dividing the transport / delivery plan set R1 into one or a plurality of tie-up S without omission and duplication based on the transport / delivery plan set R1 input to the input unit 101. (S103). The characteristic function calculation unit 102 calculates the characteristic function value v (S) for each tie-up S constituting the tie-up structure CS based on the tie-up structure CS generated by the tie-up structure prototype unit 104 (S101).

Then, the characteristic function calculation unit 102 stores the characteristic function value v (S) for each affiliated S in the characteristic function storage unit 103 (S102). Subsequently, the operations after S104 are executed, and the operations after S104 are executed in the same manner as the operations after S104 executed by the information processing apparatus 300 according to the first embodiment of the present invention.

The operation example of the information processing apparatus 500 according to the second embodiment of the present invention has been described above.

(2-3. Effect)
As described above, according to the second embodiment of the present invention, the same effects as those of the first embodiment of the present invention can be enjoyed. Further, according to the second embodiment of the present invention, the characteristic function value v (S) is set only for the tie-up S constituting each of the one or a plurality of tie-up structure CS generated by the tie-up structure prototype unit 104. Since it only needs to be calculated, the effect that the amount of calculation can be reduced can be enjoyed.

The second embodiment of the present invention has been described above.

<3. Hardware configuration example>
Subsequently, a hardware configuration example of the information processing device 300 according to the first embodiment of the present invention and the information processing device 500 according to the second embodiment of the present invention will be described. Hereinafter, as examples of these hardware configurations, a hardware configuration example of the information processing apparatus 900 will be described. The hardware configuration example of the information processing device 900 described below is only an example. Therefore, the hardware configuration of the information processing device 300 according to the first embodiment of the present invention and the information processing device 500 according to the second embodiment of the present invention is based on the hardware configuration of the information processing device 900 described below. Unnecessary configurations may be deleted or new configurations may be added.

FIG. 19 is a diagram showing a hardware configuration of the information processing device 900. The information processing device 900 includes a CPU (Central Processing Unit) 901, a ROM (Read Only Memory) 902, a RAM (Random Access Memory) 903, a host bus 904, a bridge 905, an external bus 906, and an interface 907. , An input device 908, an output device 909, a storage device 910, and a communication device 911.

The CPU 901 functions as an arithmetic processing device and a control device, and controls the overall operation in the information processing device 900 according to various programs. Further, the CPU 901 may be a microprocessor. The ROM 902 stores programs, calculation parameters, and the like used by the CPU 901. The RAM 903 temporarily stores a program used in the execution of the CPU 901, parameters that are appropriately changed in the execution, and the like. These are connected to each other by a host bus 904 composed of a CPU bus or the like.

The host bus 904 is connected to an external bus 906 such as a PCI (Peripheral Component Interconnect / Interface) bus via a bridge 905. It is not always necessary to separately configure the host bus 904, the bridge 905, and the external bus 906, and these functions may be implemented in one bus.

The input device 908 includes input means for the user to input information such as a mouse, keyboard, touch panel, buttons, microphone, switch, and lever, and an input control circuit that generates an input signal based on the input by the user and outputs the input signal to the CPU 901. And so on. By operating the input device 908, the user who operates the information processing device 900 can input various data to the information processing device 900 and instruct the processing operation.

The output device 909 includes, for example, a CRT (Cathode Ray Tube) display device, a liquid crystal display (LCD) device, an OLED (Organic Light Emitting Node) device, a display device such as a lamp, and an audio output device such as a speaker.

The storage device 910 is a device for storing data. The storage device 910 may include a storage medium, a recording device for recording data on the storage medium, a reading device for reading data from the storage medium, a deleting device for deleting the data recorded on the storage medium, and the like. The storage device 910 is composed of, for example, an HDD (Hard Disk Drive). The storage device 910 drives a hard disk and stores programs and various data executed by the CPU 901.

The communication device 911 is, for example, a communication interface composed of a communication device or the like for connecting to a network. Further, the communication device 911 may support either wireless communication or wired communication.

The hardware configuration example of the information processing apparatus 900 according to the embodiment of the present invention has been described above.

<4. Summary>
Although the preferred embodiments of the present invention have been described in detail with reference to the accompanying drawings, the present invention is not limited to such examples. It is clear that a person having ordinary knowledge in the field of technology to which the present invention belongs can come up with various modifications or modifications within the scope of the technical idea described in the claims. , These are also naturally understood to belong to the technical scope of the present invention.

For example, in the above, the integrated transportation / delivery plan (new transportation / delivery plan), the profit distribution amount added to the integrated transportation / delivery plan, and the transportation / delivery plan that is not integrated with other transportation / delivery plans. Explained the case where a new transportation / delivery plan set including is output. For example, a new transport and delivery planning set may be used for proposals to planning companies and the like. At this time, the transportation and delivery may not be performed according to the new transportation and delivery plan set, and the transportation and delivery may be performed after the new transportation and delivery plan set is adjusted. Further, in the above description, the description has been focused on the transportation / delivery plan in which the transportation means is a delivery vehicle (truck), but in the embodiment of the present invention, the transportation / delivery plan set may be configured from a plurality of transportation / delivery plans having different transportation means. Good.

100 Affiliated structure generator 101 Input unit 102 Characteristic function calculation unit 103 Characteristic function storage unit 104 Affiliated structure prototype unit 105 Utility value calculation unit 106 Affiliated structure storage unit 107 Affiliated structure selection unit 110 Structure extraction unit 200 Transport / delivery plan generator 201 Affiliation Information input unit 202 Travel cost acquisition unit 203 Operation plan generation unit 204 Transportation / delivery plan regeneration unit 300 Information processing device 301 Selective tie-up structure storage unit 302 Transportation / delivery plan storage unit 400 Alliance structure generation device 401 Surplus profit calculation unit 402 Profit distribution Quantitative calculation unit 500 Information processing device

In order to solve the above problem, according to a certain viewpoint of the present invention, a plurality of transport / delivery plan information which is a set having each as an element is divided into one or a plurality of subsets and each is composed of one or a plurality of ways. The utility value calculation unit that calculates the utility value corresponding to each of the alliance structures based on the characteristic function value of each of the one or a plurality of subsets constituting the alliance structure for each alliance structure, and the one or more A tie-up structure selection unit that selects a tie-up structure whose utility value satisfies a predetermined condition from the tie-up structure as a selection tie-up structure, a profit amount calculation unit that calculates a profit amount corresponding to the selection tie-up structure, and the above-mentioned profit amount. When there is a distribution amount calculation unit that calculates the distribution amount to be distributed to each of a plurality of parties corresponding to the selection tie-up structure, and a subset that includes a plurality of elements in the subset that constitutes the selection tie-up structure. Provided is an information processing apparatus including a transport / delivery plan regeneration unit that generates new transport / delivery plan information that integrates the plurality of elements.

Each of the plurality of transport / delivery plan information includes the amount of cargo to be loaded on the transport vehicle, the load capacity of the transport vehicle, and the transport / delivery cost, and the characteristic function calculation unit has two or more elements belonging to the subset. When each of the loading capacities is equal to or greater than the sum of the cargo volumes of all the elements belonging to the subset, the result of subtracting the minimum value of the transportation and delivery costs of the two or more elements from the sum of the transportation and delivery costs of all the elements. May be calculated as the characteristic function value.

Further, according to another aspect of the present invention, one or a plurality of alliances in which a computer is composed of a plurality of transportation / delivery plan information, which is a set of each element, are divided into one or a plurality of subsets, respectively. The utility value corresponding to each structure is calculated based on the characteristic function value of each of the one or a plurality of subsets constituting the alliance structure for each alliance structure, and the computer performs the one or more alliance. From the structure, the alliance structure whose utility value satisfies a predetermined condition is selected as the selection alliance structure, the computer calculates the profit amount corresponding to the selection alliance structure, and the computer uses the profit amount. The amount of distribution to be distributed to each of the plurality of parties corresponding to the selective tie-up structure is calculated, and the computer has a subset in which a plurality of elements are included in the subsets constituting the selective tie-up structure. In this case, an information processing method including the generation of new transportation / delivery plan information in which the plurality of elements are integrated is provided.

Further, according to another aspect of the present invention, one or a plurality of alliances in which a computer is divided into one or a plurality of subsets of a plurality of transportation / delivery plan information which is a set of each element. The utility value calculation unit that calculates the utility value corresponding to each structure based on the characteristic function value of each of the one or a plurality of subsets constituting the alliance structure for each alliance structure, and the one or more alliance structures. Affiliation structure selection unit that selects an alliance structure whose utility value satisfies a predetermined condition as a selection alliance structure, a profit amount calculation unit that calculates a profit amount corresponding to the selection alliance structure, and the selection alliance from the profit amount. When there is a distribution amount calculation unit that calculates the distribution amount to be distributed to each of the plurality of parties corresponding to the structure, and a subset including a plurality of elements in the subsets constituting the selective tie-up structure. A program for functioning as an information processing device including a transportation / delivery plan regeneration unit that generates new transportation / delivery plan information that integrates the plurality of elements is provided.

Claims (13)

A utility value calculation unit that calculates a utility value corresponding to each of one or a plurality of alliance structures in which a plurality of transportation and delivery plan information, which is a set of each element, is divided into one or a plurality of subsets, respectively. ,
A tie-up structure selection unit that selects a tie-up structure whose utility value satisfies a predetermined condition from the one or a plurality of tie-up structures as a selection tie-up structure.
A profit amount calculation unit that calculates the profit amount corresponding to the selective alliance structure,
An allocation amount calculation unit that calculates an allocation amount to be distributed to each of a plurality of parties corresponding to the selective alliance structure from the profit amount,
Information processing device. The plurality of transportation / delivery plan information is information indicating a transportation / delivery plan created by different logistics companies.
The information processing device according to claim 1. The utility value calculation unit calculates the utility value corresponding to the alliance structure based on the characteristic function value of each of the one or a plurality of subsets constituting the alliance structure for each alliance structure.
The information processing device according to claim 1 or 2. The information processing device includes a characteristic function calculation unit that calculates a characteristic function value for each subset constituting at least one or a plurality of alliance structures.
The information processing device according to claim 3. The characteristic function calculation unit calculates the characteristic function value for each subset constituting each of the one or more alliance structures based on the one or more alliance structures.
The information processing device according to claim 4. The characteristic function calculation unit calculates the characteristic function value for each subset constituting the plurality of transportation / delivery plan information, and then calculates the characteristic function value.
The utility value calculation unit selects a characteristic function value for each subset constituting each of the one or a plurality of alliance structures from the characteristic function values for each subset constituting the plurality of transportation / delivery plan information.
The information processing device according to claim 4. Each of the plurality of transport / delivery plan information includes the amount of cargo to be loaded on the transport vehicle, the load capacity of the transport vehicle, and the transport / delivery cost.
When the loading capacity of one element belonging to the subset is equal to or greater than the sum of the cargo volumes of all the elements belonging to the subset, the characteristic function calculation unit determines that 1 from the sum of the transportation and delivery costs of all the elements. The result of subtracting the transportation and delivery costs of the elements of is calculated as the characteristic function value.
The information processing device according to any one of claims 4 to 6. The utility value calculation unit calculates the sum of the characteristic function values of each of the one or a plurality of subsets constituting the alliance structure as the utility value corresponding to the alliance structure for each alliance structure.
The information processing device according to any one of claims 4 to 7. The predetermined condition includes a condition that the utility value is the maximum in the one or a plurality of alliance structures or a condition that the utility value is larger than a threshold value.
The information processing device according to any one of claims 1 to 8. The information processing device generates new transportation / delivery plan information by integrating the plurality of elements when a subset including a plurality of elements exists in the subset constituting the selection tie-up structure. Equipped with a plan regeneration unit
The information processing device according to any one of claims 1 to 9. The profit amount calculation unit calculates the profit amount obtained when transportation and delivery are performed according to the new transportation and delivery plan information instead of the plurality of elements.
The information processing device according to claim 10. To calculate the utility value corresponding to each of one or more alliance structures in which multiple transportation and delivery plan information, which is a set of each element, is divided into one or a plurality of subsets, respectively.
Selecting an alliance structure in which the utility value satisfies a predetermined condition from the one or more alliance structures is selected as the selection alliance structure.
To calculate the amount of profit corresponding to the selective alliance structure,
From the profit amount, the distribution amount to be distributed to each of the plurality of parties corresponding to the selective alliance structure can be calculated.
Information processing methods, including. Computer,
A utility value calculation unit that calculates a utility value corresponding to each of one or a plurality of alliance structures in which a plurality of transportation and delivery plan information, which is a set of each element, is divided into one or a plurality of subsets, respectively. ,
A tie-up structure selection unit that selects a tie-up structure whose utility value satisfies a predetermined condition from the one or a plurality of tie-up structures as a selection tie-up structure.
A profit amount calculation unit that calculates the profit amount corresponding to the selective alliance structure,
An allocation amount calculation unit that calculates an allocation amount to be distributed to each of a plurality of parties corresponding to the selective alliance structure from the profit amount,
A program for functioning as an information processing device.

Images