JP7485083B2 - Delivery support device, delivery support method, and delivery support program - Google Patents

Description

The embodiments relate to a delivery assistance device, a delivery assistance method, and a delivery assistance program.

Delivery vehicles are one of the main means of delivering goods to their destinations.

The problem of determining appropriate delivery routes for delivery vehicles to efficiently deliver goods to multiple destinations is a problem of great interest. For example, when there are constraints on the time or travel distance required for goods to arrive at each destination, the delivery route is determined so as to minimize the delay time or travel distance for each destination.

Japanese Patent Publication No. 2004-83233 Japanese Patent Publication No. 2006-18443 Japanese Patent Publication No. 2013-136421

However, if there is leeway in the constraint conditions set for each delivery destination, multiple delivery routes that satisfy the constraint conditions may be output. In this case, it is not possible to determine the optimal delivery route based on the constraint conditions. This makes it difficult to efficiently create a material delivery plan.

The present invention has been made in light of the above-mentioned circumstances, and its purpose is to provide a means for efficiently formulating material distribution plans.

A delivery support device according to one embodiment includes a generation unit that generates a first route and a second route that are different from each other for a delivery vehicle to reach a first target position and a second target position; a first calculation unit that calculates a first evaluation value of the first target position and a second evaluation value of the second target position for the first route, and a third evaluation value of the first target position and a fourth evaluation value of the second target position for the second route; a second calculation unit that calculates the worst value of the first evaluation value and the second evaluation value as a fifth evaluation value of the first route, and the worst value of the third evaluation value and the fourth evaluation value as a sixth evaluation value of the second route; and a determination unit that determines a route that corresponds to the best value of the fifth evaluation value and the sixth evaluation value. The first calculation unit is configured to calculate the first evaluation value and the third evaluation value based on a first priority of the first target position, and calculate the second evaluation value and the fourth evaluation value based on a second priority of the second target position.

According to an embodiment, a means for efficiently planning material delivery plans can be provided.

FIG. 1 is a schematic diagram illustrating an example of the configuration of a delivery system according to an embodiment. FIG. 2 is a block diagram illustrating an example of a hardware configuration of the delivery support device according to the embodiment. FIG. 3 is a block diagram illustrating an example of a functional configuration of the delivery support device according to the embodiment. FIG. 4 is a conceptual diagram illustrating an example of the configuration of delivery van information according to the embodiment. FIG. 5 is a conceptual diagram showing an example of the configuration of delivery destination information according to the embodiment. FIG. 6 is a flowchart showing an example of a delivery support operation in the delivery support device according to the embodiment. FIG. 7 is a schematic diagram showing a first delivery route generated by the delivery support operation in the delivery support device according to the embodiment. FIG. 8 is a schematic diagram showing an evaluation value based on a first delivery route generated by the delivery support operation in the delivery support device according to the embodiment. FIG. 9 is a schematic diagram showing a second delivery route generated by the delivery support operation in the delivery support device according to the embodiment. FIG. 10 is a schematic diagram showing an evaluation value based on a second delivery route generated by the delivery support operation in the delivery support device according to the embodiment.

Below, the embodiments are described with reference to the drawings. In the following description, components having the same function and configuration are given a common reference symbol. Furthermore, when distinguishing between multiple components having a common reference symbol, they are distinguished by an additional reference symbol (for example, a hyphen and a number such as "-1") following the common reference symbol.

1. Embodiment 1.1 Configuration The configuration of a delivery system according to an embodiment will be described.

1.1.1 Overall Configuration First, a configuration of a delivery system according to an embodiment will be described. Fig. 1 is a block diagram showing an example of the configuration of a delivery system according to an embodiment.

As shown in FIG. 1, delivery system 1 is a system for supplying goods within a certain area using multiple delivery vehicles 4-1 and 4-2. The goods include, for example, electricity, water, and food. Delivery system 1 is a system for selecting a delivery route for delivering goods to a point where the supply of these essential goods has been cut off in the event of a disaster, before the goods run out. Delivery system 1 includes a delivery support center 2, multiple delivery bases 3-1 and 3-2, and multiple delivery destinations 5-1, 5-2, 5-3, 5-4, and 5-5.

In the following, when there is no particular distinction between the multiple distribution bases 3-1 and 3-2, they may be referred to as "distribution base 3." When there is no particular distinction between the multiple delivery vehicles 4-1 and 4-2, they may be referred to as "delivery vehicles 4." When there is no particular distinction between the multiple delivery destinations 5-1 to 5-5, they may be referred to as "delivery destinations 5."

The delivery support center 2 generates a delivery plan for comprehensively controlling the delivery of goods in the delivery system 1. The delivery support center 2 is configured to be wirelessly connected to the delivery base 3. As a result, the delivery support center 2 wirelessly transmits the generated delivery plan to the delivery base 3.

The delivery support center 2 also includes a delivery support device 10. The delivery support device 10 is a computer that supports the generation of delivery plans in the delivery support center 2. Details regarding the delivery support device 10 will be described later.

At least one delivery vehicle 4 is deployed at the distribution base 3. In the example of Figure 1, delivery vehicles 4-1 and 4-2 are deployed at the distribution bases 3-1 and 3-2, respectively. In addition, the distribution base 3 stores goods to be delivered to the delivery destination 5. The distribution base 3 instructs the delivery vehicle 4 to depart based on the delivery plan received from the distribution support center 2.

The delivery vehicle 4 delivers goods from the distribution base 3 where it is located to the delivery destination 5 according to the delivery route instructed by the distribution support center 2.

The delivery destination 5 is the destination to which the supplies are delivered by the delivery vehicle 4. The delivery destination 5 is, for example, an evacuation shelter, a hospital, or a government office. The supplies are stored (stockpiled) at the delivery destination 5 before being delivered by the delivery vehicle 4. At the delivery destination 5, the stored supplies are consumed over time. The delivery destination 5 is located within the area covered by the delivery system 1.

1.1.2 Delivery Support Device Next, the configuration of the delivery support device according to the embodiment will be described.
(Hardware configuration)
2 is a block diagram showing an example of a hardware configuration of the delivery support device 10 according to the embodiment. As shown in FIG. 2, the delivery support device 10 includes a control circuit 11, a memory 12, a communication module 13, a user interface 14, and a drive 15.

The control circuit 11 is a circuit that provides overall control of each component of the delivery support device 10. The control circuit 11 includes a CPU (Central Processing Unit), RAM (Random Access Memory), and ROM (Read Only Memory), etc.

Memory 12 is an auxiliary storage device of delivery assistance device 10. Memory 12 includes, for example, a hard disk drive (HDD), a solid state drive (SSD), a memory card, etc. Memory 12 stores various information used in delivery assistance operations and a delivery assistance program. The delivery assistance management program can be stored in memory 12 by being transmitted from outside delivery assistance device 10 via a network (not shown).

The delivery support operation is a series of operations executed to support the generation of a delivery plan for materials within the delivery system 1. The delivery support operation includes, for example, an operation for generating a delivery route that can prioritize the delivery of materials to high-priority delivery destinations 5 while minimizing the time it takes for materials to run out at the delivery destinations 5. The delivery support program is a program for causing the delivery support device 10 to execute the delivery support operation. Details regarding the delivery support operation will be described later.

The communication module 13 is a circuit used to transmit and receive data over a network. The communication module 13 is constructed, for example, in accordance with Ethernet (registered trademark).

The user interface 14 is a circuit for communicating information between a user and the control circuit 11. The user interface 14 includes input devices and output devices. The input devices include, for example, a touch panel and operation buttons. The output devices include, for example, an LCD (Liquid Crystal Display) and an EL (Electroluminescence) display, as well as a printer. The user interface 14 converts input from the user (user input) into an electrical signal and then transmits it to the control circuit 11. The user interface 14 outputs the execution result of the delivery assistance program received from the control circuit 11 to the user.

The drive 15 is a device for reading a program stored in the storage medium 16. The drive 15 includes, for example, a CD (Compact Disk) drive and a DVD (Digital Versatile Disk) drive.

The storage medium 16 is a medium that accumulates information such as a program by electrical, magnetic, optical, mechanical, or chemical action. The storage medium 16 may store a delivery assistance program.
(Functional configuration)
FIG. 3 is a block diagram illustrating an example of a functional configuration of the delivery support device according to the embodiment.

The CPU of the control circuit 11 expands the delivery assistance program stored in the memory 12 or storage medium 16 into the RAM. The CPU of the control circuit 11 then controls each of the components 12 to 15 by interpreting and executing the delivery assistance program expanded into the RAM. As a result, as shown in Figure 3, the delivery assistance device 10 functions as a computer equipped with an input unit 21, a memory unit 22, a delivery route generation unit 23, a local evaluation value calculation unit 24, a global evaluation value calculation unit 25, a determination unit 26, and an output unit 27.

Based on input from a user, the input unit 21 stores various information in the memory unit 22. The various information stored in the memory unit 22 includes, for example, delivery vehicle information 22a and delivery destination information 22b.

Figures 4 and 5 are conceptual diagrams showing examples of the configuration of delivery vehicle information and delivery destination information, respectively, in an embodiment.

As shown in FIG. 4, the delivery vehicle information 22a is information about a delivery vehicle 4 waiting at the delivery base 3. Specifically, the delivery vehicle information 22a includes the delivery vehicle ID and information about the departure location.

The delivery vehicle ID uniquely identifies the delivery vehicle 4.

The departure position is the location information of the delivery base 3 where the delivery vehicle 4 is waiting. The departure position is expressed, for example, in two-dimensional coordinates (X, Y). The departure position may also be expressed in latitude and longitude.

In the example of Figure 4, the delivery support device 10 can determine from the delivery vehicle information 22a that delivery vehicle 4-1 is waiting at the departure position (X1, Y1) and that delivery vehicle 4-2 is waiting at the departure position (X2, Y2).

In this embodiment, the remaining fuel in the delivery vehicle 4 will not run out during the delivery of goods, regardless of the delivery route.

As shown in FIG. 5, the delivery destination information 22b is information about the delivery destination 5 where supplies are waiting to be delivered. Specifically, the delivery destination information 22b includes information on the delivery destination ID, the target position, remaining supplies, reduction rate, and priority.

The delivery destination ID uniquely identifies the delivery destination 5.

The target location is the location information of the delivery destination 5. The target location is expressed, for example, in two-dimensional coordinates (x, y). The target location may be expressed in latitude and longitude, similar to the starting location.

Remaining supplies are the amount of supplies remaining at destination 5. Remaining supplies decrease over time (i.e., every moment while supplies are being delivered).

The rate of decrease is the rate at which supplies remaining at destination 5 decrease. The rate of decrease, as well as the amount of supplies remaining, may vary depending on the size of destination 5 and the number of people at destination 5.

Priority is an index set for each delivery destination 5 that represents the strength of the desire to avoid depletion of supplies. In other words, the higher the priority of a delivery destination 5, the greater the cost incurred due to depletion of supplies. Priority is a positive real number. Priority is set, for example, in correlation with the size of the delivery destination 5 and the number of people at the delivery destination 5.

5, the delivery support device 10 can know from the delivery destination information 22b that the delivery destinations 5-1 to 5-5 are located at the target positions (x1, y1) to (x9, y9), respectively, and that the remaining materials are L ₁ to L _5. The delivery support device 10 can also know that the delivery destinations 5-1 and 5-2 have the lowest priority of "1," the delivery destinations 5-3 and 5-4 have the priority of "2," and the delivery destination 5-5 has the highest priority of "3."

Returning to Figure 3, we will explain the functional configuration of the delivery support device 10.

The delivery route generation unit 23 selects a delivery vehicle 4 based on the delivery vehicle information 22a. The delivery route generation unit 23 generates at least two or more delivery routes for the selected delivery vehicle 4 based on the delivery destination information 22b. The delivery route generation unit 23 may generate, for example, all expected delivery routes (i.e., factorial numbers of the number of delivery destinations 5). In other words, the delivery route generation unit 23 generates delivery routes in a number between 2 and m, where m is the number of delivery destinations 5. The delivery route generation unit 23 transmits the generated delivery routes to the local evaluation value calculation unit 24.

The local evaluation value calculation unit 24 calculates a local evaluation value EV _L for each of all delivery destinations 5 within the delivery route for each delivery route generated by the delivery route generation unit 23. The local evaluation value calculation unit 24 transmits the calculated local evaluation value to the global evaluation value calculation unit 25.

Specifically, the local evaluation value calculation unit 24 calculates a local evaluation value EV _L (j) for a delivery destination 5-j on a certain delivery route based on the following formula (1) (j is an integer equal to or greater than 1).

Here, the variable rank(j) is the priority of destination 5-j. The first term in equation (1) is the cost that is recorded if delivery truck 4 does not arrive at destination 5 before supplies run out. The second term in equation (1) is the cost that is recorded based on the priority if delivery truck 4 arrives at destination 5 before supplies run out.

The variable overtime is the time during which supplies are depleted at destination 5-j during the period from when delivery vehicle 4 departs to when supplies are delivered to destination 5-j. The variable overtime is expressed as in the following equation (2).

Here, the variable arrivingtime is the period from when the delivery truck 4 departs until the goods are delivered to the delivery destination 5-j. The variable deadtime is the period from when the delivery truck 4 departs until the goods at the delivery destination 5-j run out.

The variable utility is expressed as follows using the variables arrivingtime and deadtime:

The global evaluation value calculation unit 25 calculates a global evaluation value EV _G for a certain delivery route based on the local evaluation values EV _L for all delivery destinations 5 on the certain delivery route. Specifically, the global evaluation value calculation unit 25 calculates the worst value (in this embodiment, the maximum value) of the local evaluation values EV _L for all delivery destinations 5 as the global evaluation value EV _G. The global evaluation value calculation unit 25 transmits the calculated global evaluation value EV _G to the determination unit 26.

The determination unit 26 receives the global evaluation value EV _G for each of all delivery routes from the global evaluation value calculation unit 25. The determination unit 26 determines the best value of the global evaluation value EV _G (the minimum value in this embodiment) and the delivery route that maximizes the global evaluation value EV _G. The determination unit 26 transmits the best value of the global evaluation value EV _G and the pair of delivery routes that maximizes the global evaluation value EV _G to the output unit 27.

The output unit 27 outputs the best value of the global evaluation value EV _G and the set of delivery routes that optimizes the global evaluation value EV _G to the user.

By configuring it as described above, the user can obtain from the delivery support device 10 a delivery route that takes into account the priority of each delivery destination 5 when delivering goods to all delivery destinations 5 using one delivery vehicle 4, as information to support the delivery plan. The user can then generate a delivery plan based on this information.

1.2 Operation Next, the operation of the delivery support device according to the embodiment will be described.

1.2.1 Delivery Support Operation FIG. 6 is a flowchart showing an example of the delivery support operation in the delivery support device according to the embodiment.

In the example of Figure 6, it is assumed that delivery vehicle information 22a and delivery destination information 22b have been stored in advance in memory 12 by user input. In addition, in the delivery support operation described below, a case in which delivery vehicle 4-1 is selected will be described as an example.

6, when a delivery vehicle 4-1 is selected based on the delivery vehicle information 22a (start), the delivery route generation unit 23 generates multiple delivery routes based on the delivery destination information 22b (S1). For example, the delivery route generation unit 23 generates delivery routes that are factorial in number of delivery destinations 5. In addition, the delivery route generation unit 23 calculates positions d _j = (X1-xj, Y1-yj) from the starting position to all delivery destinations 5.

The local evaluation value calculation unit 24 selects a delivery route to be evaluated from the multiple delivery routes generated (S2).

Next, the local evaluation value calculation unit 24 initializes the variable k to “1” (S3: k = 1).

Next, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L for the k-th delivery destination 5 on the selected delivery route based on equations (1) to (3) (S4).

The local evaluation value calculation unit 24 determines whether or not the local evaluation values EV _L have been calculated for all delivery destinations 5 (S5).

If there is a delivery destination 5 for which the local evaluation value EV _L has not been calculated (S5; no), the local evaluation value calculation unit 24 increments the variable k (S6).

After the variable k is incremented, the process proceeds to S4, whereby the processes of S4 to S6 are repeated until the local evaluation values _{EV_L} for all delivery destinations 5 are calculated.

When the local evaluation values EV _L have been calculated for all delivery destinations 5 (S5; yes), the global evaluation value calculation unit 25 calculates a global evaluation value EV _G for the delivery route to be evaluated (S7). Specifically, the global evaluation value calculation unit 25 calculates the worst local evaluation value EV _L among the local evaluation values EV _L for all delivery destinations 5 as the global evaluation value EV _G.

The global evaluation value calculation unit 25 determines whether all delivery routes have been selected (S8).

If there is a delivery route for which the global evaluation value EV _G has not been calculated (S8; no), the process proceeds to S2. Thus, the processes of S2 to S8 are repeated until the global evaluation value EV _G for all delivery routes is calculated.

When the global evaluation value EV _G has been calculated for all delivery routes (S8; yes), the determining unit 26 determines the best global evaluation value EV _G and the corresponding delivery route (S9).

The output unit 27 outputs the judgment result by the judgment unit 26 to the user (S10).

This completes the delivery support operation (end).

1.2.2 Calculation Example of Local Evaluation Value and Global Evaluation Value Among the above-mentioned delivery support operations, a calculation example of the local evaluation value EV _L and the global evaluation value EV _G will be described.

In the following explanation, positions d ₁ to d ₅ are as follows: d ₁ = (6, -1), d ₂ = (5, 3), d ₃ = (5, 4), d ₄ = (2, 4), d ₅ = (7, 2). Also, remaining materials L ₁ to L ₅ at destinations 5-1 to 5-5 before the departure of delivery truck 4 are as follows: L ₁ = 15, L ₂ = 32, L ₃ = 13, L ₄ = 59, L ₅ = 20.

Also, it is assumed that the amount of leftover materials _L1 to _L5 is "1" at the corresponding delivery destination 5 every time the delivery vehicle 4 travels a distance of "1". That is, for the sake of convenience, it is assumed that the reduction rates _V1 to _V5 are all "1". Therefore, in the following explanation, the variable deadtime is equivalent to the leftover materials at the delivery destination 5 before the delivery vehicle 4 departs. Also, the variable arrivingtime is equivalent to the travel distance until the delivery vehicle 4 reaches the delivery destination 5. That is, the variable (deadtime-arrivingtime) is equivalent to the leftover materials at the time when the delivery vehicle 4 reaches the delivery destination 5.
(First delivery route)
Fig. 7 is a schematic diagram showing a first delivery route generated by a delivery support operation in the delivery support device according to the embodiment. Fig. 8 is a schematic diagram showing an evaluation value based on the first delivery route generated by the delivery support operation in the delivery support device according to the embodiment.

7, the first delivery route is a route along which the delivery vehicle 4 delivers goods from the delivery base 3-1, which is the starting point, to the delivery destinations 5-1, 5-2, 5-3, 5-4, and 5-5 in that order. In the following, an example of calculating the local evaluation value EV _L and the global evaluation value EV _G when the first delivery route is selected as the evaluation target will be described.

As shown in FIG. 8, first, the delivery vehicle 4-1 departs from the delivery base 3-1 and delivers goods to the first delivery destination 5-1. The distance between the delivery base 3-1 and the delivery destination 5-1 is 6.09. Therefore, at the delivery destination 5-1, when the remaining goods L ₁ becomes 8.91, further goods are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV L (1) = 0.59 based on the second term of the formula (1). When the delivery vehicle 4-1 reaches the delivery destination 5-1, the remaining goods L ₂ to L ₅ at the delivery destinations 5-2 to 5-5 are as follows, respectively. _{L 2} = 25.91, L ₃ = 6.91, L ₄ = 52.91, L ₅ = 13.91.

Next, the delivery vehicle 4-1 delivers the goods to the second delivery destination 5-2. The distance between the delivery destination 5-1 and the delivery destination 5-2 is 4.12. Therefore, at the delivery destination 5-2, when the remaining goods _L2 reaches 21.79, further goods are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (2) = 0.68 based on the second term of the formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-2, the remaining goods _L3 to _L5 at the delivery destinations 5-3 to 5-5 are as follows, respectively: _L3 = 2.79, _L4 = 48.79, _L5 = 9.79.

Next, the delivery vehicle 4-1 delivers supplies to the third delivery destination 5-3. The distance between the delivery destination 5-2 and the delivery destination 5-3 is 1.0. Therefore, at the delivery destination 5-3, when the remaining supplies _L3 reaches 1.79, further supplies are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (3) = 0.27 based on the second term of the formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-3, the remaining supplies _L4 and _L5 at the delivery destinations 5-4 and 5-5 are as follows, respectively: _L4 = 47.79, _L5 = 8.79.

Next, the delivery vehicle 4-1 delivers supplies to the fourth delivery destination 5-4. The distance between the delivery destination 5-3 and the delivery destination 5-4 is 3.0. Therefore, at the delivery destination 5-4, when the remaining supplies L ₄ reaches 44.79, further supplies are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (4) = 1.51 based on the second term of the formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-4, the remaining supplies L ₅ at the delivery destination 5-5 is as follows: L ₅ = 5.79.

Next, the delivery vehicle 4-1 delivers supplies to the fifth delivery destination 5-5. The distance between the delivery destination 5-4 and the delivery destination 5-5 is 5.39. Therefore, at the delivery destination 5-5, additional supplies are secured when the remaining supplies _L5 reaches 0.40. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (5) = 0.06 based on the second term of equation (1).

Based on the local evaluation values EV _L (1) to EV _L (5) calculated as above, the global evaluation value calculation unit 25 calculates the maximum local evaluation value EV _L (4) = 1.51 as the global evaluation value EV _G for the first delivery route.
(Second delivery route)
Fig. 9 is a schematic diagram showing a second delivery route generated by the delivery support operation in the delivery support device according to the embodiment. Fig. 10 is a schematic diagram showing an evaluation value based on the second delivery route generated by the delivery support operation in the delivery support device according to the embodiment.

9, the second delivery route is a route along which the delivery vehicle 4 delivers goods from the delivery base 3-1, which is the starting point, to the delivery destinations 5-3, 5-1, 5-2, 5-5, and 5-4 in that order. In the following, an example of calculating the local evaluation value EV _L and the global evaluation value EV _G when the second delivery route is selected as the evaluation target will be described.

As shown in FIG. 10, first, the delivery vehicle 4-1 leaves the delivery base 3-1 and delivers goods to the first delivery destination 5-3. The distance between the delivery base 3-1 and the delivery destination 5-3 is 6.41. Therefore, at the delivery destination 5-1, when the remaining goods L ₁ becomes 6.59, more goods are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (3) = 1.01 based on the second term of the formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-3, the remaining goods L ₁ , L ₂ , L ₄ , and L ₅ of the delivery destinations 5-1, 5-2, 5-4, and 5-5 are as follows, respectively. L ₁ = 8.59, L ₂ = 25.59, L ₄ = 52.59, L ₅ = 13.59.

Next, the delivery vehicle 4-1 delivers the goods to the second delivery destination 5-1. The distance between the delivery destination 5-3 and the delivery destination 5-1 is 5.10. Therefore, at the delivery destination 5-1, when the remaining goods L ₁ becomes 3.49, further goods are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (1) = 0.23 based on the second term of the formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-1, the remaining goods L ₂ , L ₄ , and L ₅ of the delivery destinations 5-2, 5-4, and 5-5 are as follows, respectively. L ₂ = 20.49, L ₄ = 47.49, L ₅ = 8.49.

Next, the delivery vehicle 4-1 delivers supplies to the third delivery destination 5-2. The distance between the delivery destinations 5-1 and 5-2 is 4.12. Therefore, at the delivery destination 5-2, when the remaining supplies _L2 reaches 16.37, further supplies are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (2) = 0.51 based on the second term of formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-2, the remaining supplies _L4 and _L5 at the delivery destinations 5-4 and 5-5 are as follows, respectively: _L4 = 43.37, _L5 = 4.37.

Next, the delivery vehicle 4-1 delivers supplies to the fourth delivery destination 5-5. The distance between the delivery destination 5-2 and the delivery destination 5-5 is 2.24. Therefore, at the delivery destination 5-5, when the remaining supplies L ₅ reaches 2.13, further supplies are secured. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (5) = 0.32 based on the second term of formula (1). Note that when the delivery vehicle 4-1 reaches the delivery destination 5-5, the remaining supplies L ₄ at the delivery destination 5-4 is as follows: _{L 5} = 41.13.

Next, the delivery vehicle 4-1 delivers supplies to the fifth delivery destination 5-4. The distance between the delivery destination 5-5 and the delivery destination 5-4 is 5.39. Therefore, at the delivery destination 5-5, additional supplies are secured when the remaining supplies _L4 reaches 35.74. Therefore, the local evaluation value calculation unit 24 calculates the local evaluation value EV _L (4) = 1.21 based on the second term of equation (1).

Based on the local evaluation values EV _L (1) to EV _L (5) calculated as above, the global evaluation value calculation unit 25 calculates the maximum local evaluation value EV _L (4) = 1.21 as the global evaluation value EV _G for the second delivery route.

1.3 Effects of the embodiment According to the embodiment, the delivery route generation unit 23 generates different delivery routes (for example, a first delivery route and a second delivery route). The local evaluation value calculation unit 24 calculates local evaluation values EV _L (1) to EV _L (5) for the delivery destinations 5-1 to 5-5 for each of the first delivery route and the second delivery route. Here, the local evaluation value calculation unit 24 calculates the local evaluation values EV _L (1) to EV _L (5) based on the priority set for each of the delivery destinations 5. The global evaluation value calculation unit 25 calculates the worst value of the local evaluation values EV _L (1) to EV _L (5) as the global evaluation value EV _G for each of the first delivery route and the second delivery route. The determination unit 26 determines the delivery route with the best global evaluation value EV _G. This allows the delivery support device 10 to select a delivery route that can preferentially deliver goods to the delivery destinations 5 with high priority. This allows the delivery plan to be efficiently formulated.

Additionally, both the first and second delivery routes described above allow the delivery vehicle 4 to reach the destinations 5-1 to 5-5 before supplies run out at all of these destinations. For this reason, if the priority of each destination 5 is not taken into consideration, it may not be possible to evaluate which delivery route is best, which is not preferable. According to the embodiment, the priority of each destination 5 is taken into consideration when evaluating the delivery route. This allows the delivery routes to be differentiated in more detail.

The local evaluation value calculation unit 24 also calculates the local evaluation values EV _L (1) to EV L (5) based on the time required for the delivery vehicle 4 to reach the delivery destinations 5-1 to 5-5 and the time required for the remaining supplies _{L 1} to L ₅ to be depleted. This allows the delivery support device 10 to select a delivery route that can reliably deliver supplies according to priority while minimizing the time required for supplies to be depleted.

Furthermore, the output unit 27 outputs the delivery route corresponding to the global evaluation value EV _G determined to be the best. This allows the user to know which delivery route can deliver the goods to the high-priority delivery destination 5 without depleting the goods. Therefore, the delivery support device 10 can support the creation of a more accurate delivery plan.

The supplies include one of electricity, water, and food. The delivery destination 5 includes one of evacuation shelters, hospitals, and town halls. The priority correlates with the number of people at the delivery destination 5. This allows the delivery support device 10 to select a delivery route while considering appropriate priorities for locations such as town halls, where the priority level is predetermined, as well as locations such as hospitals and evacuation shelters, where the priority level changes depending on the number of people. In particular, the delivery route can be selected while considering appropriate priorities for delivery destinations 5, such as evacuation shelters, where the priority level cannot be determined before a disaster occurs.

2. Others Various modifications can be applied to the above-described embodiment.

For example, in the above-described embodiment, the delivery assistance program is executed by the delivery assistance device 10 in the delivery assistance center 2, but this is not limited to the above. For example, the delivery assistance management program may be executed by computing resources on the cloud.

In addition, for example, in the above-described embodiment, the local evaluation value calculation unit 24 calculates the variable utility based on the formula (3), but this is not limited to this. For example, the local evaluation value calculation unit 24 may calculate the variable utility based on the following formula (3)'.

As a result, the local evaluation value calculation unit 24 can calculate a smaller local evaluation value EV _L the earlier the goods arrive at the delivery destination 5. Therefore, the delivery support device 10 can easily determine that a delivery route in which the travel distance of the delivery vehicle 4 is shorter is the optimal delivery route.

Note that the present invention is not limited to the above-described embodiments, and can be modified in various ways in the implementation stage without departing from the gist of the invention. The embodiments may also be implemented in appropriate combination, in which case the combined effects can be obtained. Furthermore, the above-described embodiments include various inventions, and various inventions can be extracted by combinations selected from the multiple constituent elements disclosed. For example, if the problem can be solved and an effect can be obtained even if some constituent elements are deleted from all the constituent elements shown in the embodiments, the configuration from which these constituent elements are deleted can be extracted as an invention.

LIST OF SYMBOLS 1...Delivery system 2...Delivery support center 3-1, 3-2...Delivery base 4-1, 4-2...Delivery vehicle 5-1, 5-2, 5-3, 5-4, 5-5...Delivery destination 10...Delivery support device 11...Control circuit 12...Memory 13...Communication module 14...User interface 15...Drive 16...Storage medium 21...Input section 22...Storage section 22a...Delivery vehicle information 22b...Delivery destination information 23...Delivery route generation section 24...Local evaluation value calculation section 25...Global evaluation value calculation section 26...Determination section 27...Output section

Claims (8)

A generation unit that generates a first route and a second route that are different from each other and are used for a delivery vehicle to reach a first target position and a second target position;
a first calculation unit that calculates, for the first route, a first evaluation value of the first target position and a second evaluation value of the second target position, and that calculates, for the second route, a third evaluation value of the first target position and a fourth evaluation value of the second target position;
a second calculation unit that calculates a worst value of the first evaluation value and the second evaluation value as a fifth evaluation value of the first route, and calculates a worst value of the third evaluation value and the fourth evaluation value as a sixth evaluation value of the second route;
a determination unit that determines a route corresponding to a best value among the fifth evaluation value and the sixth evaluation value;
Equipped with
The first calculation unit is
calculating the first evaluation value and the third evaluation value based on a first priority of the first target position;
The second evaluation value and the fourth evaluation value are calculated based on a second priority of the second target position.
Delivery assistance device. the first target position is associated with a first amount that decreases over time;
the second target position is associated with a second amount that decreases over time;
The first calculation unit is
Calculating the first evaluation value and the third evaluation value further based on a first time until the delivery vehicle reaches the first target position and a second time until the first amount is exhausted;
The second evaluation value and the fourth evaluation value are further calculated based on a third time until the delivery vehicle reaches the second target position and a fourth time until the second amount is exhausted.
The delivery assistance device according to claim 1. An output unit that outputs the determined route is further provided.
The delivery assistance device according to claim 1. the first priority is correlated to a number of people at the first target location;
The second priority is correlated to a number of people at the second target location.
The delivery assistance device according to claim 1. The first target location and the second target location include one of a shelter, a hospital, and a government office.
The delivery assistance device according to claim 1. the first amount includes one of power, water, and food at the first target location;
the second amount includes one of power, water, and food at the second target location.
The delivery support device according to claim 2. generating first and second routes different from each other for the delivery vehicle to reach the first and second target positions;
calculating, for the first route, a first evaluation value of the first target position and a second evaluation value of the second target position, and calculating, for the second route, a third evaluation value of the first target position and a fourth evaluation value of the second target position;
calculating a worst value of the first evaluation value and the second evaluation value as a fifth evaluation value of the first route, and calculating a worst value of the third evaluation value and the fourth evaluation value as a sixth evaluation value of the second route;
determining a route corresponding to a best one of the fifth evaluation value and the sixth evaluation value;
Equipped with
the first evaluation value and the third evaluation value are calculated based on a first priority of the first target position;
the second evaluation value and the fourth evaluation value are calculated based on a second priority of the second target position;
Delivery assistance methods. A delivery support program for causing a computer to function as each unit of the delivery support device according to any one of claims 1 to 6.

Images