JP6532413B2 - INFORMATION PROCESSING SYSTEM AND INFORMATION PROCESSING METHOD - Google Patents

Description

  The present invention relates generally to information processing by a computer.

  It is considered to find a suitable pattern for evacuating a large number of people to a safe place in a short time by executing simulation on a computer. Patent Document 1 discloses that the population in a predetermined area is calculated based on the number of users of mobile devices, and the number of people passing on the route to the evacuation destination and the congestion status are calculated. Patent Document 2 is an evacuation behavior simulation that simulates the behavior of an evacuee who escapes from a building or evacuates in an outdoor space using a cellular automaton, and divides the space inside or outside the building into cells, all of the simulation targets. If the evacuees are placed in each cell and the density of the evacuees is the density of the crowd flow state at every discrete time step, the next to all the evacuees is based on the local neighborhood rule that is the flow coefficient in the crowd flow state. It is disclosed to determine the destination cell of the

JP 2012-83906 A JP, 2014-23548, A

  Patent Document 1 seeks an optimal evacuation route for each individual. Further, Patent Document 2 uses a cellular automaton by setting that only one pedestrian can exist in one cell. That is, according to Patent Documents 1 and 2, a simulation is performed in consideration of each individual existing in the entire target area, and an optimal evacuation route in the entire area is obtained. However, depending on the purpose of the simulation, it may often be preferable to output the optimal solution for a part of the target area as soon as possible, depending on the purpose of the simulation, such as when finding an optimal evacuation route. On the other hand, if only a part of the target area is separately simulated to calculate the optimum solution, a mismatch may occur between the whole target area and the optimum solution.

  Therefore, an object of the present invention is to provide an information processing system and an information processing method capable of outputting a result regarding simulation more quickly for a certain divided area while considering harmony in the entire area to be analyzed.

  An information processing system according to an embodiment is a system that executes simulation in a certain area, and includes a memory and a processor connected to the memory. The processor calculates an optimal solution of the entire area, and divides the entire area based on the calculated optimal solution to generate a plurality of divided areas, and the plurality of divided areas are respectively generated. The priority is set, the simulation is performed on the divided areas in order from the divided area with the highest priority to calculate the parameter, and the error generated in the calculation of the parameter is used to execute the simulation in the next higher divided area. Renormalize.

  According to the present invention, it is possible to output a simulation result faster for a certain divided area while considering the harmony in the entire area to be analyzed.

It is a figure showing an example of composition of an information processing system. It is a figure explaining an outline of a function of an information processing system. It is a figure which shows the operation example of an information processing system. It is a figure which shows the example of an area | region management table. It is a figure which shows the example of an area | region management table. It is a figure which shows the example of an adjacent area | region management table. It is a flowchart which shows an example of a process of a division processing part. It is a figure explaining the example by which a field is divided. It is a figure which shows the example of a process management table. It is a figure which shows the example of a simulation setting screen. It is a figure which shows the example of a simulation execution screen. It is a figure which shows the example of a simulation execution screen. It is a figure which shows the example of a simulation execution screen. It is a figure which shows the example of a simulation execution screen.

  An embodiment will be described below. In the following description, information may be described by the expression “xxx table”, but the information may be expressed by any data structure. That is, the "xxx table" can be called "xxx information" to indicate that the information does not depend on the data structure.

  Further, in the following description, processing may be described with “program” as the subject, but the program is executed by a processor (for example, a CPU (Central Processing Unit)) to appropriately determine the processing defined. The subject of the processing may be a processor, or an apparatus having the processor, in order to use at least one of a storage resource (for example, a memory) and a communication interface device. Some or all of the processing performed by the processor may be performed by hardware circuitry. The computer program may be installed from a program source. The program source may be a program distribution server or storage medium (eg, portable storage medium).

  Further, in the following description, when different elements of the same type are described separately, like “xxx 600 a” and “xxx 600 b”, reference numerals are used, and when the same elements are not distinguished, “ Only the common number among the reference signs may be used like "xxx600".

  FIG. 1 is a diagram showing an example of the configuration of an information processing system 1.

  The information processing system 1 includes a client device 10 and a server device 40, which are connected via a network 402 so as to be capable of bi-directional communication.

  The server device 40 may include a CPU 4011, a memory 4012, a storage 4013, and a network I / F 4014.

  The CPU 4011 realizes various functions of the server device 40 by executing the programs stored in the memory 4012.

  The memory 4012 stores a program executed by the CPU 4011 and data used for the program. Examples of the memory 4012 are a dynamic random access memory (DRAM), a magnetoresistive random access memory (MRAM), and a ferroelectric random access memory (FeRAM).

  The storage 4013 holds data. Examples of the storage 4013 are a hard disk drive (HDD), a solid state drive (SSD), a flash memory, and the like.

  The network I / F 4014 is a device for connecting the server device 40 to the network 402. An example of the network I / F 402 is a network interface card (NIC) or the like. Examples of the network 402 are a LAN (Local Area Network), a WAN (Wide Area Network), and the like.

  The client device 10 may include a CPU 4001, a memory 4002, a storage 4003, a network I / F 4004, an input I / F 4006, and an output I / F 4005. The CPU 4001, the memory 4002, the storage 4003, and the network I / F 4004 are substantially the same as devices of the same name of the server device 40 described above, and thus the description thereof is omitted.

  An input I / F 4006 is an I / F that receives an input from a user. Examples of the input I / F 4006 are a keyboard, a mouse, a touch panel, a microphone, and the like.

  An output I / F 4005 is an I / F that outputs information to the user. Examples of the output I / F 4005 are a display, a speaker, vibration and the like.

  Examples of the client device 10 are a PC, a mobile phone, a smartphone, a tablet terminal, and the like.

  FIG. 2 is a diagram for explaining an overview of the functions of the information processing system 1.

  The server device 40 performs social simulation in the area (region) to be processed. The server device 40 may have an optimal solution calculation unit 100, a division processing unit 101, a simulation unit 102, an error propagation graph display unit 105, and a parameter output unit 106 as functions (programs).

  The optimal solution calculation unit 100 calculates the overall optimal solution of the region to be processed. Here, the optimal solution may be the optimal flow rate of each branch in the flow network configured based on the area to be processed. The optimum flow rate of each branch may be, for example, the flow rate of each branch that maximizes the total flow from the start point to the end point. However, the maximum flow may be defined as a constraint for each branch.

  The flow network may be configured with branches in the area to be processed and nodes as intersections. In this case, the optimal flow rate of each branch may be the optimal flow rate (movement amount) of people on each road. And the maximum flow volume in each road may be defined based on the width of each road. In the case of social simulation regarding evacuation guidance, the start point may be a disaster occurrence point and the end point may be a evacuation destination point.

  The optimal solution calculation unit 100 calculates these appropriate flow rates as a value that maximizes or minimizes the objective function under the constraint conditions, for example, based on a method of determining the harmonic state of the entire object represented by linear programming. You may

  The division processing unit 101 divides the processing target area based on the optimum solution calculated by the optimum solution calculation unit 100, and generates a plurality of divided areas. Here, the division area may be an individual flow network (which may be called a “division flow network”) obtained by dividing the flow network based on the optimal flow rate of each branch. That is, the divided area and the divided flow network may correspond one to one. The division processing unit 101 may set priorities for each of the plurality of generated divided areas. An example of generation of divided areas and an example of setting of priorities will be described later.

  The division processing unit 101 may re-divide the divided area if the processing amount of social simulation for the divided area is larger than a predetermined threshold.

  The simulation unit 102 carries out social simulation in the divided area. The simulation unit 102 may include a scheduler 103 and a parameter calculation unit 104.

  The parameter calculation unit 104 may be in one-to-one correspondence with the divided areas. Then, the parameter calculation unit 104 performs social simulation on the divided area to calculate a parameter. The parameter is an optimal flow rate at the boundary of the divided area calculated based on the optimal flow rate of each branch calculated by the optimum solution calculation unit 100, and of the divided area calculated by social simulation for the divided area. It may be a value such that an error generated between the simulated flow rate at the boundary and the threshold value is less than a predetermined threshold. Further, the parameter calculation unit 104 may hold the error and propagate the error to a parameter calculation unit to be executed next.

  The scheduler 103 schedules the order in which the plurality of parameter calculation units 104 calculate the parameters. The scheduler 103 may perform scheduling such that the parameters are calculated in order from the high priority divided area.

  In the example of FIG. 2, after the parameter calculation unit 104 a corresponding to the divided area of priority “high” calculates the parameter in the scheduler 103, the parameter calculation unit 104 b corresponding to the divided area of priority “low” calculates the parameters. Schedule to calculate.

  Here, the simulation unit 102 performs the social simulation on the divided regions with high priority to calculate the parameter (that is, the error held by the parameter calculation unit 104 in the above), and the priority is given next. Can be included in the implementation of social simulation in the high division area of

  The simulation unit 102 may execute the parameter calculation units 104 corresponding to the divided regions having the same priority in parallel. The error may be included in the implementation of social simulation in the next higher priority division area.

  The error propagation graph display unit 105 causes the simulation unit 102 to display, in the form of a graph, the manner in which errors propagate one after another from the divided area with the highest priority to the divided area with the next higher priority. An example of the error propagation graph will be described later (see FIGS. 12 to 14). The error propagation graph may be generated by the server device 40 and displayed on the output I / F 4005 of the client device 10.

  The parameter output unit 106 sequentially outputs the parameters of the divided area that has been calculated. Typically, the parameters are output sequentially from the parameters of the high priority divided area. The calculated parameter may be displayed on the output I / F 4005 of the client device 10.

  FIG. 3 is a diagram showing an operation example of the information processing system 1. Hereinafter, description will be made with reference to FIGS. 2 and 3.

  The client device 10 transmits the objective function selected by the user to the optimal solution calculation unit 100 and the division processing unit 101 of the server device 40 (S108). An example of the objective function will be described later (see FIG. 10).

  The client device 10 transmits information of an initial state (for example, a road network of a region, a position of people, etc.) to the simulation unit 102 of the server device 40 and the optimum solution calculation unit 100 (S110).

  The client device 10 transmits the division policy to the division processing unit 101 of the server device 40 (S111). An example of the division policy will be described later (see FIG. 10).

  The optimal solution calculation unit 100 calculates a flow rate for optimizing (for example, maximizing or minimizing) the objective function in the entire area to be analyzed (S112). Here, the initial state may be a constraint on the objective function. The calculated flow rate may be referred to as "total harmony statistics".

  The optimal solution calculation unit 100 provides the division processing unit 101 and the scheduler 103 with the calculated overall harmony statistic. Further, the optimum solution calculation unit 100 notifies the client device 10 of the calculated overall harmony statistic (S113).

  The division processing unit 101 receives an instruction from the client device 105 (S114), and executes area division processing and priority setting processing (S115).

  The division processing unit 101 transmits the area division result and the priority of each divided area to the client device 10, the scheduler 103, and the parameter calculation units 104a and 104b of each priority of the simulation unit 102 (S116) ).

  The scheduler 103 schedules the parameter calculation unit 104 corresponding to each divided area to be executed in order from the one with the highest priority (S118).

  For example, after instructing the parameter calculation unit 104a with high priority to execute, the scheduler 103 may instruct the parameter calculation unit 104b with low priority to execute (S120).

  When receiving the instruction of S120, the parameter calculating unit 104a having a high priority executes a simulation on the divided area that it is in charge of, and calculates parameters (S133).

  The parameter calculation unit 104a with high priority transmits the simulation execution result and the parameter calculation result to the client device 10 (step S134).

  Also, the parameter calculation unit 104a with high priority passes the error generated in the execution result and the calculation result to the parameter calculation unit 104b with low priority (S135).

  Then, the parameter calculation unit 104a with high priority notifies the scheduler 103 of completion of execution (S136).

  The parameter calculation unit 104b with low priority performs simulation on the divided area in charge of itself including the error passed from the parameter calculation unit 104a with high priority, and calculates parameters (S137).

  The parameter calculation unit 104b with low priority transmits the simulation execution result and the parameter calculation result to the client device 10 (S138).

  Then, the parameter calculation unit 104b with high priority notifies the scheduler 103 of completion of execution (S139).

  When the scheduler 103 receives the notification of the completion of execution from both the high priority and low priority parameter calculation units 104, the scheduler 103 notifies the client device 10 of the completion of execution of all the simulations (S140).

  By the above process, the server apparatus can provide the simulation execution result and the parameter calculation result with priority given to the divided area with high priority. Thereby, for example, evacuation guidance can be started preferentially (earlierly) from a high-priority divided area.

  4 and 5 show examples of the area management table 600. FIG.

  The area management table 600 is a table for managing divided areas. The area management table 600 may have an area number 601, a shape 602, a priority 603, and a processing amount 604 as data items.

  The area number 601 stores a number for identifying a divided area.

  In the shape 602, information indicating the shape of the divided area of the area number 601 is stored. For example, when the divided area is a rectangle, the shape 602 may store XY coordinates of vertices located at diagonal corners of the rectangle indicating the area.

  The priority 603 stores information indicating the priority of the divided area of the area number 601. For example, the smaller the value of the priority 603, the higher the priority may be.

  In the processing amount 604, the processing amount for the divided area of the area number 601 is stored. As the processing amount 604 is larger, it may take more time to calculate the parameters of the divided area.

  In the area management table 600 a of FIG. 4, the processing amount 604 of the divided area of area number 601 “2” is “300”, which is larger than the divided areas of other area numbers 601 “1” or “3”. Therefore, the divided area of the area number 602 "2" may be subdivided as shown in FIG.

  The area management table 600 b of FIG. 5 is an example in the case where a part of the divided area of the area number 601 “2” is re-divided into the area number 601 “4”. As a result, the throughput 604 of each of the area numbers 601 “2” and “4” becomes “150”.

  At this time, priority may be set again for each divided area. For example, the priority 603 of the area number 601 “4” may be set to “3” which is lower than the priority 603 of the area number 601 “2”. Thereby, more important divided areas can be processed preferentially.

  FIG. 6 is a diagram showing an example of the adjacent area management table 700. As shown in FIG.

  The adjacent area management table 700 is a table for managing how the divided areas are adjacent to each other. The adjacent area management table 700 may have an area number 701 and an adjacent number 702 as data items.

  The adjacent area management table 700 indicates that the divided area indicated by the area number 701 is adjacent to the divided area indicated by the adjacent number. The adjacent area management table 700 may be changed accordingly when the area division is performed.

  FIG. 7 is a flowchart showing an example of processing of the division processing unit 101.

  The division processing unit 101 divides a predetermined area to generate divided areas (S501). Then, the process proceeds to the process of S502.

  The division processing unit 101 determines whether or not the processing of the following S503 to S506 has been completed for all the divided areas (S502). If the determination result is “YES”, the division processing unit 101 ends the present process, and if “NO”, the process proceeds to the next processing of S 503.

  The division processing unit 101 selects an unprocessed divided area (referred to as “selected divided area”), and sets a priority (S503). Then, the process proceeds to the process of S504.

  The division processing unit 101 calculates the processing amount of the selected divided area (S504). Then, the process proceeds to the process of S505.

  The division processing unit 101 determines whether the calculated processing amount exceeds a predetermined threshold (S505). If the determination result is “YES”, the division processing unit 101 proceeds to the process of S506, and if “NO”, the process returns to the process of S502.

  If the determination result of S505 is "YES", the division processing unit 101 redivides the selected divided area (S506), and returns to the process of S502.

  By the above processing, the predetermined area can be divided into a plurality of divided areas in which the processing amount is equal to or less than the threshold. Thereby, the simulation unit 102 can calculate the parameters of each divided area within a predetermined time.

  How the area is divided by the process of FIG. 7 will be described with reference to FIG.

  First, the division processing unit 101 sets a priority to the area 900 (S 503), and calculates the processing amount (S 504).

  If the processing amount of the area 900 exceeds the predetermined threshold (S505: YES), the division processing unit 101 redivides the area 900 into, for example, three areas 901, 902, and 903 (S506). .

  Then, the division processing unit 101 returns to the processing of S502, and executes the processing of S503 to S505 for each of the areas 901, 902, and 903. At this time, if the calculation amount of the area 902 exceeds the predetermined threshold (S505: YES), the area 902 is further subdivided into two areas 902b and 904 (S506).

  Typically, the smaller the area is, the smaller the amount of processing is. By dividing the area in this way, the simulation unit 102 can calculate the parameters of each divided area in a predetermined time.

  FIG. 9 shows an example of the process management table 800. As shown in FIG.

  The process management table 800 is a table for managing the process state of each divided area. The processing management table 800 may have, as data items, an area number 801, an n-th waiting area number 802, an n-th error 803, and a processing state 804. Here, n is a positive integer of 1 or more.

  The n-th waiting area 802 stores the area numbers of the other divided areas for which the divided area of the area number 801 associated therewith is waiting for the completion of the process. That is, the process for the divided area of the area number 801 is started after the process is completed for all the n-th waiting areas 802 associated with it.

  In the n-th error 803, the error generated in the processing of the n-th waiting area 802 of the same n is stored. That is, the process for the divided area of the area number 801 is performed including the n-th n-th error 803 associated with it.

  The processing state 804 stores the state of processing for the divided area of the area number 801 associated with it. Examples of the processing state are “completion” indicating completion of processing, “in processing” indicating that processing is in progress, “waiting” indicating that processing in another divided area is waiting for completion, etc. .

  FIG. 10 is a diagram showing an example of a simulation setting screen.

  The simulation setting screen 2000 is a screen for the user to set various conditions for the simulation. The simulation setting screen 2000 may have an initial state data file 2001, an objective function 2002, and a priority policy 2003 as setting items.

  As setting items of the initial state data file 2001, it is possible to set a data file including information on an area to be simulated. The initial state data file may include information such as the road network of the area, and how many people exist in the area (for example, artificial density).

  In the objective function 2002, an objective function for the optimal solution calculation unit 100 can be set.

  When “minimum convergence time” 2021 is set for the objective function 2002, the optimal solution calculation unit 100 selects a function related to the convergence time of processing as the objective function, and in the flow network in which the objective function is minimized. The optimal flow rate of each branch (each road) may be calculated.

  When the “maximum total flow” 2022 is set for the objective function, the optimal solution calculation unit 100 selects a function related to the total flow in the flow network as the objective function, and for each branch that maximizes the objective function. An optimal flow rate may be calculated.

  When "minimum maximum flow rate" 2023 is set for the objective function, the optimal solution calculation unit 100 selects a function related to the maximum flow rate of the branch in the flow network as the objective function and minimizes the objective function. Optimal flow rates of the branches may be calculated.

  In the priority policy 2003, a policy of priority for the division processing unit 101 can be set.

  When “height of population density” 2031 is set for the priority policy 2003, the division processing unit 101 sets high priority to divided areas with relatively high population density, and division with relatively low population density The area may be set to low priority. This makes it possible to evacuate and guide people in a highly populated divided area more quickly.

  When “flow rate” 2032 is set for the priority policy 2003, the division processing unit 101 sets high priority to divided areas with relatively large flow rates, and low in divided areas with relatively small flow rates. Priority may be set. This makes it possible to evacuate and guide the people in the divided area with a large flow more quickly.

  When the “length of movement distance to evacuation destination” 2033 is set in the priority policy 2003, the division processing unit 101 sets a high priority to a division area having a relatively long movement distance, and Lower priorities may be set for relatively short divided areas. This makes it possible to evacuate and guide people in a long divided area of the moving distance to the evacuation destination more quickly.

  When the “closeness to the disaster occurrence place” 2034 is set to the priority policy 2003, the division processing unit 101 sets a high priority to a division area relatively near to the disaster occurrence place, and from the disaster occurrence place Lower priorities may be set for relatively distant divided areas. Thus, it is possible to evacuate and guide people in the divided area closer to the disaster occurrence site more quickly.

  11 to 14 illustrate examples of the simulation execution screen 3000.

  The simulation execution screen 3000 may be generated by the parameter output unit 106 and displayed on the client terminal 10. The simulation execution screen 3000 may have a time display area 3000, a map display area 3001, an error propagation graph display area 3110, and an event display area 3310 as display areas.

  The time display area 3000 displays the time on the simulation.

  The map display area 3001 displays a map (a house map, a road map, etc.) of the area to be simulated and the simulation result at the time of the time display area 3000. As a result of the simulation, the direction 3220 of the flow rate of the people, the guiding member 3200 performing evacuation guidance, the guiding information 3400 of the digital signage, etc. may be displayed on the map (FIGS. 13 and 14). In addition, the map display area 3001 may display a line 3100 indicating divided areas on a map (FIGS. 12 to 14).

  The error propagation graph display area 3110 displays the error propagation graph and the propagation of the error at the time of the time display area. The error propagation graph is a flag indicating how much the error generated when calculating the parameter for the high priority divided region is to be propagated to which divided region. The error propagation graph may be generated by the error propagation graph output unit 105.

  The error propagation flag in FIG. 14 propagates “+5” to divided area B 3100 b and “−5” to divided area C 3100 c among errors generated in divided area A 3100 a having the highest priority. Show. Furthermore, the error propagation graph indicates that, among errors generated in the divided area B 3100 b, “−2” is propagated to the divided area D 3100 d and “+7 persons” is transmitted to the divided area C 3100 c.

  The event display area 3310 displays the relationship between the time 3000 and an occurrence event. For example, the event display area 3310 displays when to arrange the induction member 3200, when to display the guidance information on digital signage, and the like.

  With reference to FIGS. 10 to 14, for example, an example of simulation of evacuation guidance for a case where a tsunami occurs from the coast below the map will be described.

  When the “proximity to disaster occurrence place” 2034 is set as the priority policy 2003, the division processing unit 101 gives the highest priority to the division area A 3100a closest to the shore (disaster occurrence place), and Of the divided area D 3100 d farthest from the lowest.

  Then, the simulation unit 102 executes a simulation on the divided area A 3100 a having the highest priority, and calculates parameters (such as the arrangement positions of the induction members 3200 a and 3200 b).

  The parameter output unit 106 displays the calculation result (the arrangement position of the induction members 3200 a, 3200 b, etc.) in the map display area 3001 (FIG. 13). At the same time, the parameter output unit 106 displays information such as when to arrange the induction members 3200 a and 3200 b in the event display area 3310.

  Further, the error propagation graph output unit 105 outputs the propagation information of the error generated in the calculation to the error propagation graph (FIG. 13).

  Then, the simulation unit 102 executes simulation including errors propagated for the divided area B 3100 b, the divided area C 3100 c, and the divided area D 3100 d in descending order of priority, and the parameters (the arrangement position of the induction member 3200 c, digital Calculate the installation position of signage 3400 and the like. Then, in the same manner as described above, the parameter output unit 106 sequentially displays parameter calculation results from the divided areas for which the simulation is completed.

  In the case of a system that executes simulation for the entire area and outputs the execution result, the user can not view the execution result until all calculations are completed. However, since the information processing system according to the present embodiment can sequentially output the parameter calculation result and the simulation execution result from the high priority area, the user can execute the execution result of the high priority area. You can see it more quickly. Thus, for example, when the information processing system is used for evacuation guidance, evacuation guidance for a region with high priority can be started earlier, while considering appropriate evacuation guidance for the entire region.

  The embodiment described above is an illustration for explaining the present invention, and is not intended to limit the scope of the present invention to the embodiment. Those skilled in the art can practice the present invention in various other aspects without departing from the scope of the present invention.

  DESCRIPTION OF SYMBOLS 1 ... Information processing system 10 ... Client apparatus 40 ... Server apparatus 100 ... Optimal solution calculation part 101 ... Division processing part 102 ... Simulation part

Claims (12)

An information processing system for performing a simulation on the movement of people in a certain area, comprising:
A memory and a processor connected to the memory;
The processor is
Calculate the optimum flow rate of each branch in the flow network configured based on the movement path of the predetermined area, which is the optimum solution of the whole area,
The entire area is divided based on the calculated total optimal solution to generate a plurality of divided areas,
Set priorities for each of the generated divided areas,
From high priority divided areas by performing the simulation in the partition area in order to calculate the execution result,
The information processing system convolving the execution of the simulation in the next highest priority divided area error generated in the calculation of the execution result. Further comprising an output interface ,
The information processing system according to claim 1, wherein the processor outputs, to the output interface, a graph indicating an aspect of an error convolution between divided areas. Further comprising an output interface,
The processor, information processing system according to claim 1 sequentially outputs to the output interface from the execution result of the divided regions has finished calculated by performing the simulation. Wherein the processor, when the processing amount of the simulation for the divided regions is greater than a predetermined threshold value, the information processing system according to claim 1 subdividing the divided regions. The information processing system according to claim 1, wherein the processor executes the simulations of divided areas having the same priority in parallel. The optimal solution is an optimal flow rate of each branch in a flow network configured based on a road network in a predetermined area,
The divided region, the information processing system according to the flow network to <br/> claim 1 Ru individual flow network der divided based the optimal flow rate for each branch. The flow rate is the movement amount of people,
The simulation, Ru simulation der about people evacuation <br/> information processing system according to claim 6. The information processing system according to claim 7, wherein the processor sets priorities of the respective divided areas in accordance with the population density of people existing in the divided areas. 8. The information processing system according to claim 7, wherein the processor sets the priorities of the respective divided areas in accordance with the moving distances of people existing in the divided areas to a predetermined evacuation destination. The information processing system according to claim 7, wherein the processor sets the priorities of the respective divided areas in accordance with the distance from the disaster occurrence place of the people existing in the divided areas. The information processing system according to claim 6, wherein the optimal flow rate of each branch in the flow network is calculated based on a predetermined objective function and a constraint condition. An information processing method for executing simulation on movement of people in a certain area in a computer, comprising:
Processor is
Calculate the optimum flow rate of each branch in the flow network configured based on the movement path of the predetermined area, which is the optimum solution of the whole area,
The entire area is divided based on the calculated total optimal solution to generate a plurality of divided areas,
Each set priorities for the plurality of divided regions that produce,
From high priority divided areas by performing the simulation in the partition area in order to calculate the execution result,
An information processing method, wherein the error generated in the calculation of the execution result is included in the execution of the simulation in the next higher priority divided area.

Images