Material supply support device, method, and program

The materials supply support device optimizes routes by calculating and updating depletion times to maximize the extended depletion period, addressing the challenge of supply exhaustion in material delivery.

JP7740499B2Active Publication Date: 2025-09-17NIPPON TELEGRAPH & TELEPHONE CORP
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
JP2024504091
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2022-03-02
Publication Date
2025-09-17
Estimated Expiration
2042-03-02

AI Technical Summary

Technical Problem

Existing technologies fail to account for extended supply depletion times after material delivery, leading to difficulties in optimizing routes that maximize the period after supplies are exhausted.

Method used

A materials supply support device and method that calculates and updates depletion times to maximize the extended depletion time by selecting routes with the smallest maximum value and adjusting stay times at each location, using a server computer to optimize material delivery routes.

Benefits of technology

Enables setting routes that maximize the extended depletion time, ensuring efficient supply delivery to multiple locations by extending the period after supplies are depleted.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007740499000006
    Figure 0007740499000006
  • Figure 0007740499000007
    Figure 0007740499000007
  • Figure 0007740499000008
    Figure 0007740499000008
Patent Text Reader

Abstract

When performing a process for assisting in the operation of sequentially supplying materials to a plurality of points, an embodiment of the present invention: acquires parameter information relating to the supply and depletion of the materials at the plurality of points; calculates, for each of a plurality of material supply routes that can be set for the plurality of points, the times to depletion of the materials at the plurality of points on the basis of the parameter information, and selects, as the optimum route, the material supply route that minimizes the largest of the values of the calculated times to depletion; and updates, for the selected optimum route, the extension time by which the times to depletion at the plurality of points are to be extended, on the basis of the largest of the values of the times to depletion for the optimum route. The embodiment then repeats the process for selecting the optimum route and the process for updating the extension time until the largest of the values of the times to depletion reflecting the extension time meets a prescribed condition, and outputs the optimum route for which the largest of the values of the times to depletion meets the prescribed condition, and the stay times at the plurality of points that reflect the extension time.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] One aspect of the present invention relates to a materials supply support device, method, and program used to support the task of supplying materials to multiple locations when a disaster occurs, for example. [Background technology]

[0002] The delivery and supply of resources, goods, and other materials to multiple locations by vehicle is an essential task in modern society. In particular, in the event of a large-scale disaster, the transport and supply of necessary materials such as power supplies, water, and food to points of demand by vehicle is extremely important in extending the time until supplies run out at each location.

[0003] For example, when one vehicle supplies materials to multiple locations, it is necessary to supply the materials before they run out at each location. For example, Patent Document 1 describes a technique for achieving this, which determines a route that enables a vehicle to arrive at each location within a specified time for the materials to run out at each location.

[0004] Furthermore, Non-Patent Document 1 describes a technique for searching for a route that minimizes the maximum time it takes for supplies to run out at each location, using a branch-and-bound method that is commonly used to find an exact solution to a vehicle routing problem (VRP), for example. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] Japanese Patent Publication No. 2004-333377 [Non-patent literature]

[0006] [Non-Patent Document 1] M. Ogawa and 3 others, “A route searching method using two-dimensional coordinates”, IEICE, DOI:10.34385 / proc.63.E4-3, 2020. Summary of the Invention [Problem to be solved by the invention]

[0007] However, the technology described in Patent Document 1 seeks a route that minimizes travel costs within the supply depletion time range at each location before the supply of supplies. Therefore, the technology described in Patent Document 1 cannot perform route search taking into account the extended supply depletion time due to the supply of supplies.

[0008] Furthermore, the technology described in Non-Patent Document 1 is based on the assumption that supplies will run out at a location before the vehicle arrives. As a result, when supplies are supplied, the time of supply depletion at each location becomes 0, which results in all the evaluation values ​​for each route being the same, making it difficult to search for a route that takes into account the situation after supplies have been supplied.

[0009] This invention has been made in light of the above circumstances, and aims to provide a technology that makes it possible to set a route that maximizes the extended depletion time, taking into account the period after the supply of materials. [Means for solving the problem]

[0010] In order to solve the above problem, one aspect of the material supply support device or method according to the present invention includes, when performing processing to support the operation of sequentially supplying materials to a plurality of locations, a first processing unit or process for acquiring parameter information related to the supply and depletion of the materials at the plurality of locations, and a second processing unit or process for calculating, based on the parameter information, the supply and depletion of materials at the plurality of locations for each of a plurality of material supply routes that can be set to the plurality of locations. This is the time when the above-mentioned supplies are depleted. a second processing unit or step for calculating a depletion time and selecting the material supply route with the smallest maximum value of the depletion time as an optimal route; and the number of points on the optimum route, the point average value of the exhaustion time is calculated, and based on the point average value of the exhaustion time, For the plurality of points on the optimal route, , for extending the time when the material is depleted. and a third processing unit or step for updating the extension time. For each of the plurality of locations, the depletion time starting from the time when the extended supply time will be depleted is calculated based on the time when the extended supply time will be depleted and the arrival time of the supply at the location, and the calculated depletion time is calculated based on the time when the extended supply time will be depleted and the arrival time of the supply at the location. The process of selecting the optimum route and the process of updating the extension time are repeated until the maximum value of the exhaustion time satisfies a predetermined condition. Conduct , The extended time is reflected The aforementioned supplies run out the optimal route when the maximum time value satisfies the condition; at the plurality of locations calculated as the difference between the extension time and the time when the material will run out before the extension Stay time and The above information is included in the support information and output. [Effects of the Invention]

[0011] According to one aspect of the present invention, it is possible to provide a technology that enables setting a route that maximizes the extended depletion time, taking into account the period after the supply of materials. [Brief explanation of the drawings]

[0012] [Figure 1] FIG. 1 is a block diagram showing an example of the hardware configuration of a materials supply support device according to an embodiment of the present invention. [Figure 2] FIG. 2 is a block diagram showing an example of the software configuration of the materials supply support device according to an embodiment of the present invention. [Figure 3] FIG. 3 is a flowchart showing an example of the overall processing procedure and processing content executed by the control unit of the materials supply support device shown in FIG. [Figure 4] FIG. 4 is a flowchart showing an example of the processing procedure and processing contents of the exhaustion time optimum value calculation processing of the processing procedure shown in FIG. [Figure 5] FIG. 5 is a flowchart showing an example of the processing procedure and processing content of the extended time update processing of the processing procedures shown in FIG. [Figure 6] FIG. 6 is a flowchart showing an example of the processing procedure and processing contents of the optimum route and stay time setting control. [Figure 7] FIG. 7 is a diagram illustrating an example of travel time between points. [Figure 8]FIG. 8 is a diagram showing an example of the optimum route obtained. DETAILED DESCRIPTION OF THE INVENTION

[0013] Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

[0014] [One embodiment] (Configuration example) The materials supply support device SV according to one embodiment of the present invention is, for example, a server computer that is deployed on the web or in the cloud. The materials supply support device SV may also be a personal computer dedicated to the use of a local government or a delivery company.

[0015] 2 and 3 are block diagrams showing an example of the hardware and software configurations of the materials supply support device SV.

[0016] The materials supply support device SV includes a control unit 1 that uses a hardware processor such as a central processing unit (CPU). A storage unit having a program storage unit 2 and a data storage unit 3, and a communication interface unit (hereinafter referred to as communication I / F unit) 4 are connected to the control unit 1 via a bus 5.

[0017] Under the control of the control unit 1, the communication I / F unit 4 uses a communication protocol defined by a network (not shown), including the Internet, to send and receive information data between, for example, a management terminal used by a local government or delivery company, or an on-board terminal installed in a vehicle used as a transportation medium.

[0018] The program storage unit 2 is configured, for example, by combining a non-volatile memory such as an HDD (Hard Disk Drive) or SSD (Solid State Drive) as a storage medium that can be written to and read at any time, with a non-volatile memory such as a ROM (Read Only Memory), and stores application programs necessary to execute various control processes according to one embodiment of the present invention, in addition to middleware such as an OS (Operating System).

[0019] The data storage unit 3 is, for example, a combination of a non-volatile memory such as an HDD or SSD as a storage medium that can be written to and read from at any time, and a volatile memory such as a RAM (Random Access Memory), and is provided with a parameter information storage unit 31 and an optimal route / stay time storage unit 32 as storage areas according to one embodiment.

[0020] The parameter information storage unit 31 is used to store parameter information input from the management terminal of the local government or delivery company. The parameter information includes the remaining time until supplies run out at multiple supply destinations, the required stay time for supplying the supplies, and the travel time between the multiple destinations.

[0021] The optimal route and sojourn time memory unit 32 is used to store the material delivery route (hereinafter simply referred to as the route) obtained by the control unit 1 that maximizes the depletion time after extension, and information representing the sojourn time at each point on the route.

[0022] The control unit 1 includes, as processing functions according to an embodiment of the present invention, a parameter information acquisition processing unit 11, an exhaustion time optimum value calculation processing unit 12, an extension time update processing unit 13, an optimum route / stay time setting control unit 14, and a support information output processing unit 15. These processing units and control units 11 to 14 are all realized by causing a hardware processor of the control unit 1 to execute application programs stored in the program storage unit 2.

[0023] Note that part or all of the processing units 11 to 14 may be realized using hardware such as an LSI (Large Scale Integration) or an ASIC (Application Specific Integrated Circuit).

[0024] Prior to the delivery of goods, the parameter information acquisition processing unit 11 receives parameter information transmitted via a network from, for example, a management terminal of a local government or delivery company via the communication I / F unit 4, and stores the received parameter information in the parameter information storage unit 31.

[0025] Based on the parameter information stored in the parameter information storage unit 31, the depletion time optimum value calculation processing unit 12 calculates the depletion time of supplies for each of all routes that can be selected when a single vehicle is moving and delivering supplies to multiple locations in sequence, and finds the maximum value.The processing unit then performs a process of selecting the route with the smallest maximum depletion time as the optimum route.The depletion time can be calculated from the remaining time until supplies are depleted at each location and the arrival time of the vehicle at each location, which are included in the parameter information.The arrival time can be calculated from the travel time between locations and the stay time at each location.

[0026] The extension time update processing unit 13 calculates the point average of the depletion time from the maximum value of the depletion time of the optimal route selected by the depletion time optimal value calculation processing unit 12 and the number of points on the optimal route, and updates the extension time for extending the depletion of the material based on this point average value of the depletion time.

[0027] The optimum route and sojourn time setting control unit 14 calculates the maximum exhaustion time reflecting the updated extension time, and repeatedly executes the optimum route selection process by the exhaustion time optimum value calculation processing unit 12 and the extension time update process by the extension time update processing unit 13 until this maximum exhaustion time satisfies a predetermined condition.The optimum route and sojourn time setting control unit 14 then executes the process of storing in the optimum route and sojourn time storage unit 32 the optimum route when the maximum exhaustion time reflecting the updated extension time satisfies the condition, and the sojourn time calculated from the extension time at each point.

[0028] The support information output processing unit 15 generates support information for supporting the supply of goods, including the optimum route and the stay time at each point thereof stored in the optimum route / stay time storage unit 32. Then, it performs processing to transmit the generated support information from the communication I / F unit 4 to, for example, a management terminal of a local government or delivery company, or an on-board terminal mounted on a delivery vehicle.

[0029] (Example of operation) Next, an example of the operation of the material supply support system SV configured as above will be described. FIG. 3 is a flowchart showing an example of a materials supply support operation executed by the control unit 1 of the materials supply support apparatus SV.

[0030] (1) Obtaining parameter information For example, in the event of a disaster, a local government or delivery company selects all locations where supplies need to be supplied, and inputs parameter information into a management terminal, including travel time between each location, the remaining time until supplies run out at each location, and the time required to supply supplies.The parameter information is then transmitted from the management terminal to the supplies supply support device SV via a network (not shown).

[0031] In response to this, in step S10, the control unit 1 of the material supply support device SV, under the control of the parameter information acquisition processing unit 11, receives the parameter information sent from the management terminal via the communication I / F unit 4, and stores the received parameter information in the parameter information storage unit 31.

[0032] For example, there are n+1 points to which supplies are to be delivered on a two-dimensional plane representing the disaster area. Let us consider these points as v i ,i∈{0,1,…,n},n∈Z. In this case, for each point v i Travel time t(v i ,v j )∈R >0 , the starting point is the time t = 0, and each point v i Time remaining until supplies run out in d i ∈R >0 , each point v i Stay time p i ∈R >0 These are input at the management terminal, and are sent as parameter information from the management terminal to the material supply support device SV and stored in the parameter information storage unit 31.

[0033] (2) Calculating the optimal value of the exhaustion time When the above parameter information is acquired, the control unit 1 of the material supply support device SV first performs the following process in step S20, under the control of the optimal depletion time calculation processing unit 12, to calculate the depletion time at each point for each route and select the route with the smallest maximum value of the depletion time.

[0034] FIG. 4 is a flowchart showing an example of the processing procedure and processing content of the optimum exhaustion time calculation processing executed by the optimum exhaustion time calculation processing unit 12.

[0035] The exhaustion time optimum value calculation processing unit 12 first selects one route r from all selectable routes in step S21, and then calculates the optimum exhaustion time value v i Time to run out of supplies at T i (r) is calculated respectively.

[0036] This depletion time T i (r) is the remaining time d at each point i (r) and the time a when the vehicle arrives at the point. i (r) and

number

[0037] Then, in step S23, the exhaustion time optimum value calculation processing unit 12 calculates the optimum exhaustion time for each of the calculated points v i The depletion time T i (r) maximum value

number

[0038] The exhaustion time optimum value calculation processing unit 12 calculates the maximum exhaustion time T max Once (r) is found, it is determined in step S24 whether or not the selection of all routes r has been completed. If the result of this determination is that there is an unselected route r, the process returns to step S21 to select the next route, and the maximum exhaustion time T max (r) is calculated. After that, the maximum exhaustion time T max The process of calculating (r) is repeated.

[0039] Then, the maximum exhaustion time for all routes r is T max After the calculation of (r), the exhaustion time optimum value calculation processing unit 12 calculates the maximum exhaustion time T max (r) is minimized by the route r*.

number

[0040] This maximum exhaustion time T max The route r* that minimizes (r) is the optimal route with the least exhaustion time, and the minimum value is the maximum exhaustion time T max The optimal route r* can be calculated by a well-known method such as a method of finding the optimal route by counting all the routes r or a branch and bound method.

[0041] (3) Update of extended time Next, in step S30, the control unit 1 of the material supply support device SV, under the control of the extension time update processing unit 13, updates the time at each point v on the above-mentioned optimal route r*. i The process of updating the extension time given to is performed as follows.

[0042] By the way, each point v i To maximize the depletion time after extension at v, ideally, we should find a route and extension time that will result in the same depletion time at each point after extension. i The route and extension time that averages the depletion time after extension are calculated.

[0043] FIG. 5 is a flowchart showing an example of the processing procedure and processing content of the extended time update processing executed by the extended time update processing unit 13.

[0044] First, in step S31, the extension time update processing unit 13 receives the maximum value T max Next, in step S32, the extended time update processing unit 13 receives the selected optimum route r*. i The extension time X in

number

[0045] Here, the extended time X is the extended time from the departure time t = 0 of the vehicle, n indicates the number of points, and k indicates the ratio of the exhaustion time after the extension to the extended time. The value of k is i (i=1,...,n) and the remaining time d i It is assumed that the value does not depend on

[0046] That is, the extension time update processing unit 13 calculates the maximum exhaustion time T max The extension time X is updated by subtracting the point average value of (r*) from the extension time X before update. The extension time update processing unit 13 outputs the updated extension time X obtained by the above calculation to the optimal route and staying time setting control unit 14 in step S33.

[0047] (4) Setting the optimal route and stay time When the updated extended time is obtained by the extended time update processing unit 13, the control unit 1 of the material supply support device SV then executes control in step S40, using the optimal route / stay time setting control unit 14, to determine the optimal route and the stay time at each point when the extended time is reflected, as follows:

[0048] FIG. 6 is a flowchart showing an example of the control procedure and processing contents executed by the optimum route / stay time setting control unit 14.

[0049] The optimum route and stay time setting control unit 14 first receives the updated extension time X from the extension time update processing unit 13 in step S41, and then in step S42, calculates the maximum exhaustion time T max (r*) is calculated. The maximum depletion time T max (r*) can be calculated, for example, as follows:

[0050] That is, first, at each point v i From the difference between the above extension time X and the exhaustion time at each point v i Stay time p iis calculated, and the calculated stay time p i and each point v i Travel time to and from each point v i Arrival time at a i is calculated. Then, the calculated arrival time a i and the depletion time at each point v i The depletion time T i (r*) is calculated, and the maximum exhaustion time T max (r*) can be found.

[0051] Next, in step S43, the optimum route and stay time setting control unit 14 calculates the maximum exhaustion time T max The absolute value of (r*) is compared with a threshold value set in advance as an update condition, and the maximum depletion time T max It is determined whether the absolute value of (r*) is less than the threshold value. max If the absolute value of (r*) is not less than the threshold value, the maximum exhaustion time T max Instructs the recalculation of (r*) and reselection of the optimal route r*.

[0052] Upon receiving the above instruction, the exhaustion time optimum value calculation processing unit 12 calculates the optimum exhaustion time for each point v for each of all routes r in steps S21 to S25. i The exhaustion time is recalculated to reflect the updated extended time X. Then, based on the result of this recalculation, the maximum exhaustion time T max (r) and calculate the maximum value of this exhaustion time T max Then, the exhaustion time optimum value calculation processing unit 12 reselects the route r* that minimizes the exhaustion time T max (r) is passed to the extended time update processing unit 13.

[0053] The extension time update processing unit 13 calculates the maximum value T max (r) and calculate the maximum exhaustion time Tmax The extension time X is updated based on (r), and the updated extension time X is notified to the optimum route and staying time setting control unit 14.

[0054] The optimum route and staying time setting control unit 14 calculates the maximum exhaustion time T 1 reflecting the extended time X based on the updated extended time notified from the extended time update processing unit 13 in steps S41 to S43 shown in FIG. max Calculate (r*) and calculate the maximum depletion time T max It is again determined whether (r*) is less than the threshold value. Then, as a result of this determination, the maximum depletion time T max If (r*) still does not fall below the threshold, the process returns to the optimum route reselection process by the exhaustion time optimum value calculation processing unit 12.

[0055] Similarly, the control unit 1 of the material supply support device SV sets the maximum depletion time T max The optimum route reselection process by the exhaustion time optimum value calculation processor 12 and the extension time update process by the extension time update processor 13 are repeatedly executed until (r*) becomes less than the threshold value.

[0056] On the other hand, the maximum exhaustion time T max Assume that (r*) has fallen below the threshold. In this case, the optimal route and staying time setting control unit 14 determines that the difference in exhaustion time between the points on the selected optimal route r* after extension has approached 0. In other words, it determines that the exhaustion time between the points on the optimal route after extension has been averaged, and proceeds to step S44.

[0057] In step S44, the optimum route and staying time setting control unit 14 calculates the optimum route r* finally obtained by the exhaustion time optimum value calculation unit 12 and the extension time update unit 13 at each point v i Based on the extended time X at each point v i Stay time P i Calculate the stay time P iis calculated as the difference between the extension time X and the exhaustion time. Then, in step S45, the optimum route and staying time setting control unit 14 calculates the final optimum route r* and the staying time P i The information representing the above is stored in the optimum route and sojourn time storage unit 32 as information representing the optimum route that maximizes the exhaustion time after extension and the sojourn time at each point.

[0058] (5) Generation and output of support information Finally, in step S50, the control unit 1 of the material supply support device SV, under the control of the support information output processing unit 15, obtains the optimum route r* and each of its points v from the optimum route / stay time storage unit 32. i Stay time P i The information representing the optimal route r* and each point v i Stay time P i The support information includes the information representing the optimal route and the staying time P i In addition to the information representing the above-mentioned staying time P i The information may include the amount of material supply corresponding to the optimum route, road information and weather information corresponding to the optimum route, etc. The road information and weather information can be obtained from, for example, a website on the Web.

[0059] (Example of operation) Next, a specific example of the processing operation described above will be explained.

[0060] Let us assume that the points scattered in the disaster area are v0, v1, v2, v3, v4, v5, and v6. The remaining time until supplies run out at these points v1, v2, v3, v4, v5, and v6 is d1=17, d2=19, d3=18, d4=18, d5=18, and d6=19, respectively. The initial value of the extension time X given to each point v1, v2, v3, v4, v5, and v6 is X=25, and the stay time required for supply at each point v1, v2, v3, v4, v5, and v6 is p1=8, p2=6, p3=7, p4=7, p5=7, and p6=6, respectively.

[0061] FIG. 7 shows an example of the travel time between points v1, v2, v3, v4, v5, and v6 in this case, in hours [h].

[0062] Assume that the departure time is t=0 o'clock and one vehicle supplies goods to each point v1, v2, v3, v4, v5, and v6 in sequence. Under this condition, the optimum depletion time calculation processing unit 12 calculates the maximum depletion time T max (r) is calculated, and T max We get (r) = 23.45 hours.

[0063] Next, the extension time update processing unit 13 calculates the maximum exhaustion time T max Applying (r) to the above formula (1) and recalculating the extended time X, we get

number

[0064] Then, the optimum route and stay time setting control unit 14 calculates the maximum exhaustion time T max (r) is calculated, T max The optimum route and stay time setting control unit 14 then calculates the maximum exhaustion time T max (r) is compared with the threshold value, and the maximum depletion time T max Determine whether (r) is less than a threshold.

[0065] For example, if the threshold value is set to 0.1, the maximum depletion time T max(r) = 3.9 hours is not less than the threshold value 0.1. Therefore, the optimal route and staying time setting control unit 14 causes the exhaustion time optimum value calculation processing unit 12 to reselect a route that minimizes the maximum exhaustion time for all routes. Then, the extension time update processing unit 13 performs processing to update the extension time X for each point on the reselected route. As a result, the extension time update processing unit 13 substitutes the recalculated extension time X = 21.1 into equation (1) to recalculate the extension time X.

[0066] The optimum route and stay time setting control unit 14 calculates the maximum exhaustion time T max (r) is calculated, and the calculated maximum depletion time T max It is again determined whether (r) is less than the threshold value 0.1. Then, the maximum depletion time T max If (r) is not less than the threshold value, the optimum exhaustion time calculation processing unit 12 executes the route reselection process and the extension time update processing unit 13 executes the process of updating the extension time X at each point again. max The above-mentioned route reselection process and extension time update process are repeatedly executed until (r) becomes less than the threshold value 0.1.

[0067] By repeating the above control, for example, the maximum depletion time T max (r) is 3.9 → 0.65 → 0.11 → 0.02 The optimum route and stay time setting control unit 14 determines the maximum depletion time T max When (r) reaches 0.02, this value is less than the threshold value 0.1, so the process of selecting the optimum route r* and the process of updating the extension time X are terminated.

[0068] The optimum route and stay time setting control unit 14 then calculates the maximum exhaustion time T max Based on the final extension time X=20.3 when (r) becomes 0.02, which is less than the threshold, the stay time p iFor example, p1=5.3,p2=1.3,p3=2.3,p4=2.3 ,p5=2.3,p6=1.3 It is calculated as follows.

[0069] The optimum route and stay time setting control unit 14 determines the optimum route r* as v0→ v4→ v1→ v3→ v5→ v2→ v6 FIG. 8 shows an example of the determined optimum route r* shown on a two-dimensional plane.

[0070] (Actions and Effects) As described above, in one embodiment, based on parameter information related to the supply of goods, the optimal depletion time calculation processing unit 12 first calculates the optimal depletion time for each point v i Time to run out of supplies at T i (r) and calculate the maximum value T max (r) and calculate the maximum value of this exhaustion time T max The route for which (r) is the smallest is selected as the optimum route r*. Next, the extension time update processing unit 13 calculates the maximum exhaustion time T max The extension time X is updated based on (r) and the number of points. Then, the optimum route and stay time setting control unit 14 calculates the maximum exhaustion time T max The process of selecting the optimum route and the process of updating the extension time X are repeated until the absolute value of (r) falls below the threshold value, and the maximum exhaustion time T max When the absolute value of (r) becomes less than the threshold, the final route r* and each point v calculated from the extended time X are i Stay time point i is set to the optimal route and the optimal stay time at each point.

[0071] Therefore, it is possible to determine the route that maximizes the extended depletion time and the duration of stay at each point, taking into account the period after the supply of goods.

[0072] [Other embodiments] (1) In the above embodiment, a route that maximizes the extended depletion time and the sojourn time at each of the supply points are calculated for all supply points. However, the present invention is not limited to this. For example, it is also possible to specify points among the supply points to which no supplies are to be supplied, and calculate a route that maximizes the extended depletion time and the sojourn time at each of the supply points for the remaining set of points excluding the specified points.

[0073] In this way, it is possible to efficiently supply supplies to as many remaining points as possible before they run out, excluding, for example, points where there is no time left until the time of depletion and it is clear that supplies will not be able to be delivered in time, and points where there is sufficient time until the time of depletion and there is essentially no need for supplies for the time being.

[0074] (2) In the above embodiment, the entire series of processes from the parameter acquisition process to the support information output process is executed by a single server computer in the material supply support device SV. However, all or part of the series of processes from the parameter acquisition process to the support information output process may be distributed to multiple server computers or personal computers. In this case, the information processing device that performs the processes is not limited to a server computer or a personal computer, but may also be a mobile information terminal such as a smartphone or a tablet device.

[0075] (3) In the above embodiment, the case of supplying goods to multiple locations in the event of a disaster was described as an example. However, the present invention is not limited to this, and can also be applied as a support system for delivering goods to multiple stores during normal times, for example.

[0076] (4) In addition to road vehicles such as trucks, it is possible to selectively use railroads, ships, and flying objects such as drones as transportation means. In addition, the functions of the material supply support device, the processing procedures and processing contents, the types of materials, the contents of the support information, etc. can be modified and implemented in various ways without departing from the spirit of this invention.

[0077] Although the embodiments of the present invention have been described in detail above, the above description is merely an example of the present invention in every respect. It goes without saying that various improvements and modifications can be made without departing from the scope of the present invention. In other words, when implementing the present invention, specific configurations according to the embodiments may be appropriately adopted.

[0078] In short, this invention is not limited to the above-described embodiments, and in the implementation stage, the components can be modified and embodied without departing from the spirit of the invention. Furthermore, various inventions can be formed by appropriately combining multiple components disclosed in the above-described embodiments. For example, some components may be omitted from all the components shown in the embodiments. Furthermore, components from different embodiments may be appropriately combined. [Explanation of symbols]

[0079] SV…Materials supply support device 1...Control unit 2...Program memory section 3...Data storage unit 4...Communication I / F section 5...Bus 11...Parameter information acquisition processing unit 12...Depletion time optimum value calculation processing unit 13...Extension time update processing section 14...Optimal route and stay time setting control unit 15...Support information output processing unit 31...Parameter information storage unit 32...Optimal route and stay time memory section

Claims

1. A supplies supply support device that supports a task of sequentially supplying supplies to a plurality of locations, a first processing unit that acquires parameter information related to the supply and depletion of the material at the plurality of locations; a second processing unit that calculates a depletion time, which is the time it takes for the material to be depleted at each of a plurality of material supply routes that can be set to the plurality of locations, based on the parameter information, and selects the material supply route that has the smallest maximum value of the calculated depletion time as an optimal route; a third processing unit that calculates a point average value of the depletion time from the maximum value of the depletion time on the selected optimal route and the number of points on the optimal route, and updates an extension time to be given to the plurality of points on the optimal route based on the point average value of the depletion time in order to extend the time at which the material will be depleted; a fourth processing unit that calculates, for each of the plurality of points, a depletion time starting from the time the extended supply time will be depleted based on the time the supply will be depleted after being extended to the extension time and the arrival time of the supply at the point, causes the second processing unit to repeatedly select the optimum route and the third processing unit to repeatedly update the extension time until the maximum value of the calculated depletion time satisfies a predetermined condition, and outputs the optimum route when the maximum value of the depletion time starting from the time the extended supply time will be depleted after being extended to the extension time satisfies the condition, and a stay time at the plurality of points calculated as the difference between the extension time and the time the supply will be depleted before the extension; a fifth processing unit that generates and outputs assistance information including information representing the output optimum route and the stay time; A material supply support device equipped with the above.

2. The material supply support device of claim 1, wherein the second processing unit calculates the arrival time at the plurality of locations from the travel time and the stay time between the plurality of locations defined by the parameter information, and calculates the depletion time of the material at the plurality of locations from the calculated arrival time and the remaining time until depletion defined by the parameter information.

3. A materials supply support method in which an information processing device executes a process for supporting a task of sequentially supplying materials to a plurality of locations, obtaining parameter information relating to the supply and depletion of said material at said plurality of locations; a step of calculating a depletion time, which is the time it takes for the material to run out at each of a plurality of material supply routes that can be set to the plurality of locations, based on the parameter information, and selecting the material supply route that minimizes the maximum value of the calculated depletion times as an optimal route; a step of calculating a point average value of the depletion time from the maximum value of the depletion time on the selected optimal route and the number of points on the optimal route, and updating an extension time to be given to the plurality of points on the optimal route based on the point average value of the depletion time in order to extend the time at which the material will run out; a step of calculating, for each of the plurality of points, a depletion time starting from the time when the extended supply time will be depleted based on the time when the extended supply time will be depleted and the arrival time of the supply at the point, repeatedly selecting the optimum route and updating the extension time until the maximum value of the calculated depletion time satisfies a predetermined condition, and outputting the optimum route when the maximum value of the depletion time starting from the time when the extended supply time will be depleted satisfies the condition, and a stay time at the plurality of points calculated as the difference between the extension time and the time when the supply will be depleted before the extension; generating and outputting assistance information including information representing the output optimal route and the stay time; A material supply support method comprising:

4. 3. A program for causing a processor included in the materials supply support device to execute all of the processes executed by the first to fifth processing units included in the materials supply support device according to claim 1 or 2.

Citation Information

Patent Citations

  • Method and device for supporting transportation plan

    JP2002329286A

  • Route-search method

    JP2004333377A

  • Method and system for supporting article distribution

    JP2006188331A

  • Disaster support system and disaster support program

    JP2012173836A

  • Transportation plan creation device, transportation plan creation method, program, and disaster victim transportation method

    JP2021012424A