JP7428293B2 - Guidance support device, guidance support method and program - Google Patents

Description

The present invention relates to a guidance support device, a guidance support method, and a program.

Techniques for guiding disaster victims to evacuation centers include technology that uses disaster simulation to notify disaster victims of information urging them to evacuate (Patent Document 1), and technology that displays evacuation shelters to which disaster victims should go on their mobile terminals. (Non-Patent Document 1) etc. are being considered.

JP2020-52527A

Hisato Umeki et al., "Evacuation site determination method considering crowding bias", Transactions of the Information Processing Society of Japan Vol.60 No.2 pp.608-616., [online], Internet <URL: http://arakawa -lab.com/wp-content/uploads/2019/03/umeki.pdf＞

However, since the technology of Patent Document 1 provides information to individual disaster victims to encourage evacuation, it is up to the victims to decide which evacuation center to go to, and there may be cases where the evacuation center to which they are directed is full and they cannot enter. . Furthermore, although the technique disclosed in Non-Patent Document 1 makes it possible to guide disaster victims to another evacuation center, the cost of travel, such as travel time and travel distance, may become excessive.

The present invention has been made in view of the above-mentioned points, and an object of the present invention is to support guidance of disaster victims to evacuation centers in consideration of travel costs.

Therefore, in order to solve the above problem, the guidance support device includes a starting point, a plurality of first nodes corresponding to each of the plurality of evacuation centers, and a plurality of second nodes corresponding to each of the plurality of evacuation centers. , an end point, and the edge from the start point to the first node has a capacity representing the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node, and a cost. The edge from the first node to the second node is set to 0, and the capacity is the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node, and the cost is the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node. a generation unit that sets a travel distance of the edge, and sets the empty capacity of the evacuation shelter corresponding to the second node as capacity and 0 as cost for the edge from the second node to the end point; A derivation unit that derives the number of disaster victims to be guided to another evacuation center for each evacuation center by solving a minimum cost flow problem of a directed graph.

It is possible to support the guidance of disaster victims to evacuation centers, taking into consideration travel costs.

1 is a diagram showing a configuration example of a guidance support system in a first embodiment; FIG. It is a diagram showing an example of the hardware configuration of the guidance support device 10 in the first embodiment. 1 is a diagram showing an example of a functional configuration of a guidance support device 10 according to a first embodiment. FIG. It is a figure showing an example of composition of shelter capacity DB121. It is a figure showing an example of composition of disaster victim information DB122 in a 1st embodiment. It is a figure showing an example of composition of road network DB123. It is a flow chart for explaining an example of a processing procedure of guidance processing of a disaster victim in a 1st embodiment. It is a diagram showing an example of a directed graph in the first embodiment. It is a figure which shows an example of the calculation result of the number of induced disaster victims. It is a flow chart for explaining an example of a processing procedure of guidance processing of a disaster victim in a 2nd embodiment. It is a figure showing an example of composition of disaster victim information DB122 in a 2nd embodiment. It is a figure which shows an example of the directed graph in 2nd Embodiment. It is a figure showing an example of a guide disaster victim list. It is a figure showing the result of a simulation experiment.

Embodiments of the present invention will be described below based on the drawings. FIG. 1 is a diagram showing a configuration example of a guidance support system in a first embodiment.

In FIG. 1, a guidance support device 10 is connected to a plurality of evacuation center terminals 20 and a plurality of disaster victim terminals 30 via a network such as the Internet.

The evacuation center terminal 20 is a terminal such as a PC (Personal Computer) placed at each evacuation center in a region where a disaster has occurred (hereinafter referred to as "area A"). The evacuation center terminal 20 transmits information regarding the evacuation center (capacity, number of people already accommodated, etc.) to the guidance support device 10, and receives processing results by the guidance support device 10 from the guidance support device 10.

The disaster victim terminal 30 is a mobile terminal such as a smartphone carried by each disaster victim in area A. The disaster victim terminal 30 has information (hereinafter referred to as (referred to as “position information”) is provided to the guidance support device 10.

The guidance support device 10 is one or more computers that execute processing to support guidance of each disaster victim to an evacuation center, taking into consideration the travel cost.

FIG. 2 is a diagram showing an example of the hardware configuration of the guidance support device 10 in the first embodiment. The guidance support device 10 in FIG. 2 includes a drive device 100, an auxiliary storage device 102, a memory device 103, a processor 104, an interface device 105, etc., which are interconnected via a bus B.

A program for realizing the processing in the guidance support device 10 is provided by a recording medium 101 such as a CD-ROM. When the recording medium 101 storing the program is set in the drive device 100, the program is installed from the recording medium 101 to the auxiliary storage device 102 via the drive device 100. However, the program does not necessarily need to be installed from the recording medium 101, and may be downloaded from another computer via a network. The auxiliary storage device 102 stores installed programs as well as necessary files, data, and the like.

The memory device 103 reads the program from the auxiliary storage device 102 and stores it therein when there is an instruction to start the program. The processor 104 is a CPU, a GPU (Graphics Processing Unit), or a CPU and a GPU, and executes functions related to the guidance support device 10 according to a program stored in the memory device 103. The interface device 105 is used as an interface for connecting to a network.

FIG. 3 is a diagram showing an example of the functional configuration of the guidance support device 10 in the first embodiment. As shown in FIG. 3, the guidance support device 10 includes an evacuation center information collection section 11, a disaster victim information collection section 12, an evacuation center allocation section 13, and a guidance information distribution section 14. Each of these units is realized by one or more programs installed in the guidance support device 10 causing the processor 104 to execute the process. The guidance support device 10 also uses databases (storage units) such as an evacuation center capacity DB 121, a disaster victim information DB 122, and a road network DB 123. Each of these databases can be realized using, for example, the auxiliary storage device 102 or a storage device connectable to the guidance support device 10 via a network.

For example, after the occurrence of a disaster, the evacuation center information collection unit 11 collects information regarding each evacuation center (hereinafter referred to as "evacuation center information") from each evacuation center terminal 20, and stores the collected evacuation information on the evacuation center. Register in the capacity DB 121.

FIG. 4 is a diagram showing a configuration example of the evacuation center capacity DB 121. The shelter capacity DB 121 stores the shelter ID, point ID, capacity, number of people accommodated, etc. for each shelter. The shelter ID is identification information of the shelter. The point ID is identification information of the point where the evacuation center is located. The capacity is the upper limit of the number of people the evacuation center can accommodate. The number of people accommodated is the number of disaster victims that the evacuation center has already accommodated.

The evacuation center information collection unit 11 collects evacuation center information from each evacuation center terminal 20 at regular intervals (for example, every few minutes, etc.) and updates the evacuation center capacity DB 121, for example. This is because disaster victims arrive at evacuation centers from time to time, and the number of people accommodated changes. Therefore, the number of people accommodated in the evacuation center capacity DB 121 indicates the number of people accommodated in each evacuation center at approximately the present time. Note that since the location ID and capacity are fixed, the evacuation shelter information collected at regular intervals only needs to include the evacuation center ID and the number of people accommodated.

The disaster victim information collection unit 12 collects information regarding each disaster victim (hereinafter referred to as "disaster victim information") from each disaster victim terminal 30, and registers the collected disaster victim information in the disaster victim information DB 122.

FIG. 5 is a diagram showing a configuration example of the disaster victim information DB 122 in the first embodiment. The disaster victim information DB 122 stores a disaster victim ID, a point ID, an estimated evacuation shelter ID, etc. for each disaster victim terminal 30 (for each disaster victim). The disaster victim ID is identification information for each disaster victim terminal 30 (for each disaster victim). The point ID is a point ID corresponding to the point closest to the current position of the disaster victim terminal 30 (disaster victim) among the point IDs registered in advance. Each point ID registered in advance is associated with the position information (latitude and longitude) of the corresponding point, and is stored in advance in, for example, the auxiliary storage device 102 or the like. The estimated evacuation shelter ID is the evacuation shelter ID of the evacuation shelter where the disaster victim associated with the disaster victim ID is estimated to arrive (hereinafter referred to as the "estimated evacuation shelter"). For example, the estimated evacuation center for a certain disaster victim is the nearest evacuation center from the current location of the disaster victim.

The disaster victim information collection unit 12 collects disaster victim IDs and point IDs from each disaster victim terminal 30 at regular intervals (for example, every few minutes, etc.), and stores the point information corresponding to the disaster victim ID in the disaster victim information DB 122. Update ID. Therefore, the point ID has a value indicating approximately the current location of the disaster victim. The disaster victim information collection unit 12 also estimates the estimated evacuation center for the disaster victim whose point ID has been updated, and updates the estimated evacuation center ID for the disaster victim in the disaster victim information DB 122. For example, the disaster victim information collection unit 12 estimates the nearest evacuation shelter from the current location of the disaster victim as the estimated evacuation shelter for the disaster victim. The nearest evacuation center from the current location of the disaster victim can be specified using, for example, road network information stored in the road network DB 123. Further, for example, when a disaster victim is guided to a certain evacuation center, the evacuation center is estimated as the estimated evacuation center for the disaster victim.

FIG. 6 is a diagram showing an example of the configuration of the road network DB 123. One record of the road network DB 123 includes a point ID1, a point ID2, and a distance. Point ID1 and point ID2 are point IDs corresponding to respective points of one node and the other node of two adjacent nodes in the graph representing the road network. For example, intersections, branch points, etc. in a road network become nodes of the graph. In addition, each evacuation center also becomes a node of the graph. The distance is the distance of the road section between point ID1 and point ID2. Note that the point ID in the evacuation center capacity DB 121 and the point ID in the disaster victim information DB 122 are values registered as the point ID 1 or the point ID 2 in the road network DB 123.

For example, the disaster victim information collection unit 12 uses the graph of the road network shown in the road network DB 123 to search for the nearest evacuation center using the Dijkstra method, starting from the disaster victim's point ID and using the distance of each road section as the cost. can do.

Incidentally, those whose disaster victim information is registered in the disaster victim information DB 122 are disaster victims who have not yet been accommodated in any evacuation center. For "disaster victims who have not yet been accommodated in any evacuation center," after arriving at the estimated evacuation center, the victim was guided to another evacuation center. This includes those who are not detained. When the disaster victim information collection unit 12 detects that a certain disaster victim has been accommodated in any evacuation center, the disaster victim information collection unit 12 deletes the record of the disaster victim from the disaster victim information DB 122. Accommodation of disaster victims in the evacuation center may be detected based on a predetermined notification from the disaster victim terminal 30, for example. In the following, unless otherwise specified, disaster victims refer to those who are not accommodated in evacuation centers.

The evacuation center allocation unit 13 executes processing for guiding (allocating) each disaster victim to an evacuation center so that the total movement cost of each disaster victim is optimized (minimized). The evacuation center allocating section 13 outputs the processing results (such as the number of people guided from each evacuation center to another evacuation center) to the guidance information distribution section 14 .

The guidance information distribution unit 14 distributes the processing results by the evacuation center allocation unit 13 to each evacuation center terminal 20.

The processing procedure executed by the guidance support device 10 will be described below. FIG. 7 is a flowchart illustrating an example of a procedure for guiding a disaster victim in the first embodiment. The process in FIG. 7 is executed, for example, at regular intervals (for example, every few minutes) after the occurrence of a disaster.

In step S101, the shelter allocation unit 13 calculates, for each combination of two shelters from the set of all shelters registered in the shelter capacity DB 121, the travel distance between the shelters related to the combination. . The travel distance between two certain evacuation centers can be calculated with reference to the road network DB 123. For example, in the road network (graph) shown by the road network DB 123, the evacuation shelter allocation unit 13 assigns a point ( calculate the shortest route among the routes between the point (node) corresponding to the point ID stored in the shelter capacity DB 121 for the other evacuation shelter using Dijkstra's method, and move the distance of the shortest route. It may also be a distance.

Next, the evacuation center allocation unit 13 refers to the disaster victim information DB 122 (FIG. 5) and calculates the estimated number of disaster victims who are expected to arrive at the evacuation center (hereinafter referred to as "estimated disaster victim number") for each evacuation center. (S102). Specifically, the evacuation center allocation unit 13 classifies the records (disaster victim IDs) stored in the disaster victim information DB 122 into groups with a common estimated evacuation center ID, and calculates the number of records belonging to each group. Calculated as the estimated number of disaster victims at the evacuation center corresponding to each group. Note that the estimated number of disaster victims for evacuation center m is expressed as Im.

Note that the evacuation center allocating unit 13 may update the estimated evacuation center ID in the disaster victim information DB 122 at this timing (immediately before step S102).

Next, the evacuation center allocation unit 13 generates a directed graph G=(V,E) for formulating guidance of disaster victims between evacuation centers (allocation to evacuation centers) using a minimum cost flow problem (S103). . V is a set of nodes of a directed graph, and is classified into (O, S, G, D), which will be described later.

The minimum cost flow problem is a directed graph G = (V, E), where the capacity u _e > 0 and cost c _e of each edge e∈E are given, and the outflow amount b _v of each vertex v∈V is given. , the problem is to find the flow x _e on each edge that minimizes the total cost Σ _e∈E c _e x _e . However, the following constraints regarding capacity and outflow amount shall be satisfied.

図８は、第１の実施の形態における有向グラフの一例を示す図である。図８の有向グラフＧにおいて、Ｓｍ∈ＳとＧｍ'∈Ｇのノードは避難所ｍに対応する。したがって、有向グラフＧは、２つの避難所の全ての組み合わせに対応する辺を含む。避難所割当部１３は、始点Ｏ（Ｏｒｉｇｉｎ）からＳ（Ｓｔａｒｔ）への辺（Ｏ，Ｓｍ）には、容量としてＩｍを設定し、コストとして０を設定する。避難所割当部１３は、また、ＳｍからＧｍ'（Ｇｏａｌ）への辺（Ｓｍ，Ｇｍ'）には、容量としてＩｍを設定し、コストとして避難所間の移動距離を設定する。当該移動距離は、ステップＳ１０１において算出された値である（但し、ＳｍとＧｍ'とが同じ避難所である場合、移動距離＝０である）。避難所割当部１３は、更に、Ｇから終点Ｄ（Ｄｅｓｔｉｎａｔｉｏｎ）への辺（Ｇｎ，Ｄ）には、容量として避難所ｍの空き容量（＝定員Ｃ_ｍ－収容済み人数）を設定し、コストとして０を設定する。なお、定員及び収容済み人数は、いずれも避難所容量ＤＢ１２１（図４）を参照して特定可能である。

FIG. 8 is a diagram showing an example of a directed graph in the first embodiment. In the directed graph G of FIG. 8, the nodes SmεS and Gm'εG correspond to the shelter m. Therefore, the directed graph G contains edges corresponding to all combinations of two shelters. The shelter allocation unit 13 sets Im as the capacity and 0 as the cost for the side (O, Sm) from the starting point O (Origin) to S (Start). The shelter allocating unit 13 also sets Im as the capacity on the side (Sm, Gm') from Sm to Gm' (Goal), and sets the travel distance between shelters as the cost. The movement distance is the value calculated in step S101 (however, if Sm and Gm' are the same evacuation center, the movement distance = 0). The shelter allocating unit 13 further sets the available capacity of the shelter m (=capacity C _m - number of accommodated persons) as the capacity on the side (Gn, D) from G to the destination D (Destination), and calculates the cost. Set 0 as . Note that both the capacity and the number of people accommodated can be specified with reference to the evacuation center capacity DB 121 (FIG. 4).

Next, the evacuation center allocation unit 13 calculates the number of disaster victims to be guided to another evacuation center (hereinafter referred to as the "number of guided disaster victims") for each evacuation center by solving the minimum cost flow problem of the digraph G. Derived (S104). In the first embodiment, in the digraph G, the moving distance from the shelter m to the shelter m' is set as the cost for the edge (Sm, Gm'). Therefore, the number of induced disaster victims is calculated such that the sum of the travel distances of each disaster victim is minimized under the constraints of the capacity of each evacuation center.

FIG. 9 is a diagram showing an example of the calculation result of the number of induced disaster victims. As shown in FIG. 9, in the first embodiment, as a solution to the minimum cost flow problem, information including the number of people is obtained for each combination of the guide source ID and the guide destination shelter ID. The guiding source shelter ID is the shelter ID of the guiding source shelter. The evacuation shelter of the guidance source is an evacuation shelter that corresponds to the estimated evacuation shelter of one of the disaster victims. On the other hand, the guidance destination evacuation shelter ID is the evacuation shelter ID of the guidance destination evacuation shelter. The number of people is the number of disaster victims guided from the source evacuation center to the destination evacuation center.

In addition, in the solution to the minimum cost flow problem, the number of people assigned to the side where Sm and Gm' are the same evacuation center is the number of people who are not guided to another evacuation center (the number of people accommodated (guided) to Sm). number of people). In FIG. 9, records in which the guiding source evacuation center ID and the guiding destination evacuation center ID are the same correspond to such sides.

Regarding the minimum cost flow algorithm, for example, see "Korte, B., Vygen, J., Korte (2012). Combinatorial optimization (Vol. 2, p. 2). Heidelberg: Springer." Korte (Author), J. Fegen (Author), Takao Asano (Translator), Yasuhito Asano (Translator), Takao Ono (Translator), & 1 Others, Combinatorial Optimization 2nd Edition (Theory and Algorithms) Hardcover, February 2012 /29”).

Subsequently, the guidance information distribution unit 14 distributes the information shown in FIG. 9 to each evacuation center terminal 20 (S105). For example, the guidance information distribution unit 14 transmits the number of people (guidance victims information indicating the number) may also be transmitted. By doing so, the guiding evacuation center can determine how many disaster victims should be guided to which evacuation center.

In addition, among the evacuation shelters that are the source of guidance, in evacuation shelters that have been assigned multiple evacuation destinations, victims may be guided to the evacuation shelter closest to the evacuation center on a first-come, first-served basis. (hereinafter referred to as "first-come-first-served short-distance guidance"), disaster victims may be guided to a more distant evacuation shelter on a first-come, first-served basis to the evacuation center (hereinafter referred to as "first-come-first-served long-distance guidance"). ).

As described above, according to the first embodiment, it is possible to support guidance of disaster victims to evacuation centers in consideration of travel costs (travel distance).

Next, a second embodiment will be described. In the second embodiment, differences from the first embodiment will be explained. Points not specifically mentioned in the second embodiment may be the same as those in the first embodiment. In the second embodiment, an example will be described in which travel time is used as travel cost.

FIG. 10 is a flowchart for explaining an example of a procedure for guiding a disaster victim in the second embodiment. In FIG. 10, steps that are the same as those in FIG. 7 are given the same step numbers, and their explanations will be omitted.

Following step S102, the evacuation center allocation unit 13 calculates the estimated travel time for each section from the estimated evacuation center to each other evacuation center (hereinafter simply referred to as "travel time") for each disaster victim. Calculate (S203). The estimated evacuation center can be specified with reference to the disaster victim information DB 122.

FIG. 11 is a diagram showing a configuration example of the disaster victim information DB 122 in the second embodiment. The disaster victim information DB 122 in FIG. 11 further includes a column (item) of estimated movement speed, in contrast to the disaster victim information DB 122 in FIG. 5. The estimated moving speed is an estimated value of the walking speed of the disaster victim related to the disaster victim ID.

The evacuation center allocation unit 13 divides the estimated travel distance of each section from the disaster victim's evacuation center to each other evacuation center by the estimated movement speed of the disaster victim, and calculates the distance for each section for the disaster victim. It is possible to calculate the travel time of

Note that the estimated movement speed of the disaster victim can be calculated, for example, by applying existing technology to the history of position information of the GPS (Global Positioning System) function of the disaster victim terminal 30.

Subsequently, the shelter allocation unit 13 generates the digraph G=((O, P, G, D), E) in FIG. 12 (S204). In the directed graph G, the node Pn∈P corresponds to the disaster victim n, and the node Gm∈G corresponds to the evacuation center m. Therefore, the directed graph G includes edges corresponding to all combinations of all disaster victims and all evacuation centers. The shelter allocating unit 13 sets a capacity of 1 person and a cost of 0 on the side (O, Pn) from the starting point O (Origin) to P (Person). The evacuation shelter allocation unit 13 also sets the capacity of one person and the estimated travel time of the disaster victim n from the evacuation center to the evacuation center m as the cost for the edge (Pn, Gm) (however, , the travel time=0 for the edge where Gm is the estimated shelter of Pn). The evacuation center allocating unit 13 further sets the available capacity of the evacuation center m (=capacity C _m - number of accommodated persons) as the capacity on the side (Gn, D) from Gm to the destination D (Destination), and calculates the cost. Set 0 as .

Next, the evacuation center allocation unit 13 solves the minimum cost flow problem of the digraph G to obtain a list of disaster victims to be guided by each evacuation center to another evacuation center (hereinafter referred to as "guided disaster victim list"). Derived (S205). In particular, in the second embodiment, in the digraph G, the travel time of the disaster victim n from the estimated evacuation center to the evacuation center m is set as a cost for the edge (Pn, Gm). Therefore, a list of guided disaster victims is derived such that the total travel time of each disaster victim is minimized under the constraints of the capacity of each evacuation center.

FIG. 13 is a diagram showing an example of a guided disaster victim list. As shown in FIG. 13, the guide disaster victim list is a list of pairs of guide source evacuation center ID, guide disaster victim ID, and guide destination evacuation center ID. The guidance source evacuation shelter ID and the guidance destination evacuation shelter ID are as described in FIG. 9 . The guided disaster victim ID is the disaster victim ID of the disaster victim who is guided from the shelter related to the guide source shelter ID to the shelter related to the guide destination shelter ID.

In addition, in the solution of the least cost flow problem, the victims assigned to the side where Gm is the estimated evacuation center of Pn are the victims who do not need to be guided to another evacuation center (accommodated in the estimated evacuation center (guided)) ). In FIG. 13, records in which the guide source ID and guide destination shelter ID are the same correspond to such sides.

Subsequently, the guidance information distribution unit 14 distributes the guidance victim list to each evacuation center terminal 20 (S206). For example, the guidance information distribution unit 14 sends the guidance victim ID corresponding to the guidance source evacuation shelter ID and the guidance destination evacuation center to the evacuation shelter terminal 20 associated with each guidance source evacuation center ID in the guidance disaster victim list (FIG. 13). A list of place IDs may also be sent. By doing so, the guidance source evacuation shelter can notify the disaster victim associated with the guidance victim ID to move to the evacuation shelter associated with the guidance destination evacuation shelter ID.

As described above, according to the second embodiment, it is possible to support guidance of disaster victims to evacuation centers in consideration of travel costs (travel time).

Note that FIG. 14 shows the results of a simulation experiment in which 5,000 disaster victims and 19 evacuation centers were set, which was conducted by the inventor of the present invention regarding the conventional technology and each of the above embodiments.

In FIG. 14, the rule base is a method of guiding disaster victims exceeding capacity to the nearest evacuation center that is not full.

The existing method is the method described in Non-Patent Document 1, which involves guiding disaster victims who exceed capacity to the nearest evacuation shelter that is not full and has reservations available, and then making a reservation at the destination evacuation shelter at the time of the guidance. be.

The first embodiment (a) is a method corresponding to short-distance guidance on a first-come, first-served basis in the first embodiment.

The first embodiment (b) is a method corresponding to first-come, first-served long-distance guidance in the first embodiment.

As is clear from FIG. 14, the minimum average travel time for each disaster victim was obtained in the second embodiment. In addition, good performance was also obtained in the first embodiment compared to the rule-based method and the existing method.

Note that in this embodiment, the evacuation center allocation unit 13 is an example of a generation unit and a derivation unit.

Although the embodiments of the present invention have been described in detail above, the present invention is not limited to these specific embodiments, and various modifications can be made within the scope of the gist of the present invention as described in the claims. - Can be changed.

10 Guidance support device 11 Evacuation center information collection unit 12 Victim information collection unit 13 Evacuation center allocation unit 14 Guidance information distribution unit 20 Evacuation center terminal 30 Multiple victim terminals 100 Drive device 101 Recording medium 102 Auxiliary storage device 103 Memory device 104 Processor 105 Interface device 121 Evacuation center capacity DB
122 Disaster victim information DB
123 Road network DB
B bus

Claims (5)

Generate a directed graph including a starting point, a plurality of first nodes corresponding to each of the plurality of evacuation centers, a plurality of second nodes corresponding to each of the plurality of evacuation centers, and an end point, and On the edge to the first node, the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node is set as the capacity, and 0 is set as the cost. For the edge to the second node, the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node is set as the capacity, and the travel distance of the edge is set as the cost. On the edge from the node to the end point, a generation unit that sets the free capacity of the evacuation center corresponding to the second node as the capacity and 0 as the cost;
a derivation unit that derives the number of disaster victims to be guided to a different evacuation center for each evacuation center by solving a minimum cost flow problem of the directed graph;
A guidance support device comprising: a plurality of first nodes corresponding to each of a plurality of disaster victims estimated to arrive at one of the plurality of evacuation centers; and a plurality of first nodes corresponding to each of the plurality of evacuation centers. 2 nodes and an end point, the capacity is set to 1, the cost is set to 0, and the edge from the first node to the second node is set to 1 as the capacity and 0 as the cost. On the edge to the node, the capacity is 1, and the cost is the distance from the evacuation center where the disaster victim corresponding to the first node is estimated to arrive to the evacuation shelter corresponding to the second node. a generation unit that sets a travel time, and sets an empty capacity of a shelter corresponding to the second node as a capacity and 0 as a cost on the side from the second node to the end point;
a derivation unit that derives a destination evacuation center for each of the disaster victims by solving a minimum cost flow problem of the directed graph;
A guidance support device comprising: Generate a directed graph including a starting point, a plurality of first nodes corresponding to each of the plurality of evacuation centers, a plurality of second nodes corresponding to each of the plurality of evacuation centers, and an end point, and On the edge to the first node, the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node is set as the capacity, and 0 is set as the cost. For the edge to the second node, the number of disaster victims estimated to arrive at the evacuation center corresponding to the first node is set as the capacity, and the travel distance of the edge is set as the cost. On the edge from the node to the end point, a generation procedure that sets the free capacity of the evacuation center corresponding to the second node as the capacity and 0 as the cost;
a derivation procedure for deriving the number of disaster victims to be guided to a different evacuation center for each evacuation center by solving a minimum cost flow problem of the directed graph;
A guidance support method characterized in that a computer executes the following. a plurality of first nodes corresponding to each of a plurality of disaster victims estimated to arrive at one of the plurality of evacuation centers; and a plurality of first nodes corresponding to each of the plurality of evacuation centers. 2 nodes and an end point, the capacity is set to 1, the cost is set to 0, and the edge from the first node to the second node is set to 1 as the capacity and 0 as the cost. On the edge to the node, the capacity is 1, and the cost is the distance from the evacuation center where the disaster victim corresponding to the first node is estimated to arrive to the evacuation shelter corresponding to the second node. a generation procedure of setting a travel time, and setting an empty capacity of a shelter corresponding to the second node as a capacity and 0 as a cost on the side from the second node to the end point;
a derivation procedure for deriving a destination evacuation center for each of the disaster victims by solving a minimum cost flow problem of the directed graph;
A guidance support method characterized in that a computer executes the following. A program for causing a computer to execute the guidance support method according to claim 3 or 4.

Images