Skip to main content

Context-aware heatstroke relief station placement and route optimization for large outdoor events



Heatstroke is becoming an increasingly serious threat to outdoor activities, especially, at the time of large events organized during summer, including the Olympic Games or various types of happenings in amusement parks like Disneyland or other popular venues. The risk of heatstroke is naturally affected by a high temperature, but it is also dependent on various other contextual factors such as the presence of shaded areas along traveling routes or the distribution of relief stations. The purpose of the study is to develop a method to reduce the heatstroke risk of pedestrians for large outdoor events by optimizing relief station placement, volume scheduling and route.


Our experiments conducted on the planned site of the Tokyo Olympics and simulated during the two weeks of the Olympics schedule indicate that planning routes and setting relief stations with our proposed optimization model could effectively reduce heatstroke risk. Besides, the results show that supply volume scheduling optimization can further reduce the risk of heatstroke. The route with the shortest length may not be the route with the least risk, relief station and physical environment need to be considered and the proposed method can balance these factors.


This study proposed a novel emergency service problem that can be applied in large outdoor event scenarios with multiple walking flows. To solve the problem, an effective method is developed and evaluates the heatstroke risk in outdoor space by utilizing context-aware indicators which are determined by large and heterogeneous data including facilities, road networks and street view images. We propose a Mixed Integer Nonlinear Programming model for optimizing routes of pedestrians, determining the location of relief stations and the supply volume in each relief station. The proposed method can help organizers better prepare for the event and pedestrians participate in the event more safely.


With global warming and heat island effects caused by urbanization, heatstroke is becoming an increasingly severe threat to outdoor activities in summer [1, 2]. On the other hand, summer is a popular season for outdoor trips due to summer vacations and many events that normally take place in this season. In such a case, it is fundamental to reduce heatstroke risk when holding large outside events, especially for pedestrians who are likely to be exposed to high temperatures [3].

There are several strategies that local governments or event holders could take to reduce heatstroke during large outdoor events. The easiest one is to set outdoor events to an earlier or later time of the day [4]. However, this strategy would potentially reduce the number of visitors for early events, or increase the cost and other risks for nighttime events. Considering the potential income loss and cost increase, it is usually more reasonable for event organizers to minimize the risk in other ways such as providing relief stations to give first-aids to those who suffer or may suffer from heatstroke, as well as carefully planning routes that pose the smallest risk [5]. However, simply implementing either of these two strategies could be rather challenging when the walkable space is complicated, e.g., spanning a large area with multiple origins and destinations (OD) and with complex routes between many OD pairs. In such a case, setting relief stations for all the routes would translate to a high cost. On the other hand, though heatstroke risk could be reduced by enforcing visitors to choose the optimal routes predefined by the organizers, heatstroke risk on long routes could be still inevitably high. To prevent these scenarios, setting up temporal relief stations based on predefined routes would ensure safer travel and at the same time keep the cost under control.

On the other hand, the location optimization scenario of heatstroke prevention varies from other similar scenarios in that heatstroke risk is sensitive to different environmental contexts within the walkable space [6]. Specifically, a road segment with a better physical environment (e.g., an environment with less solar radiation) might pose less heatstroke risk than the road segment with a poor physical environment (e.g., an environment with more solar radiation). As a result, pedestrians walking along the routes with high heatstroke risk cause high potential demand for assistance such as providing shelter or water. However, the traditional data used for representing spatial contexts, such as public satellite images and statistic information, are usually characterized by low spatial or temporal resolution that cannot be applied to represent the detailed environmental context [7, 8]. As a result, the existing studies usually have the Uncertain Geographic Context Problem (UGCoP) [9] of ignoring health risk variance in different spatial and temporal units.

The development of big data and location-based services (LBS) makes however detailed contextual information available for reasoning about the health risk of diverse locations. Different from the traditional data collection and processing approaches, contextual information can be now collected through road network-based sensors such as cars and street cameras. The data provided thanks to the deployment of such sensors can help to distinguish contextual differences in road networks when it comes to health risks such as heatstroke. Based on large contextual data, our study proposes a problem of optimizing routes and placement of heatstroke relief stations in a road network within walkable spaces. The objective of this problem is to minimize global heatstroke risk, which is calculated by microscope contextual information on each road segment. Specifically, we propose a heatstroke risk model that measures the heatstroke risk of each road segment with different indicators calculated using heterogeneous data including characteristics of road segments. Based on this model, we conduct a case study in a real-world scenario of the Tokyo Olympic Games with heterogeneous data collected from different data sources including Olympic schedules, facility locations and road network information. With the calculated contextual heatstroke risk, we further propose a Mixed Integer Nonlinear Programming (MINLP) model to optimize pedestrian routes, relief station locations and supply volume of each station at different times.

The contributions of this study can be listed as follows:

  1. 1.

    We propose a novel emergency service problem that can be applied in large outdoor event scenarios with multiple walking flows.

  2. 2.

    We introduce a dedicated framework to solve this task. Both supply and demand are considered during the facility optimization. Specifically, the demand in this study is represented by pedestrian flows instead of demand points.

  3. 3.

    The model we propose does not only plan the placement of relief stations and supply volume scheduling but also determines the optimal routes for the dynamic pedestrian flows.

Related work

Emergency facility location optimization

Emergency facilities are of great significance in public health as they can provide first aid to emergency victims to reduce casualties. Comparing to non-emergency facilities, the demand for emergency facilities is more time-sensitive and dependent on particular emergency scenarios. Therefore, although the existing studies on emergency facility location optimization (EFLO) have similar objectives with other FLO problems to maximize covering location (MCLP) [10] or minimize cost or the number of facilities while making sure that the entire target region remains covered [11], the existing studies distinguish themselves from other EFLO problems in terms of optimization targets and problem settings [12].

From the perspective of optimization targets, several types of emergency facilities have received attention in existing studies. Off-site public access devices (OPAD) usually refer to those facilities that provide medical service out of regular healthcare facilities, e.g., automated external defibrillator (AED). Siddiq et al. [13] pointed out that the limited accessibility, poor visibility and lack of registration could influence AED demand and set different coverage values for different devices in location optimization.

The emergency center or department is another type of common emergency facility. Different from the OPAD devices, each emergency center usually has a larger supply volume and higher cost. Thus, in addition to studies of setting permanent emergency centers or departments with coverage problem settings [14], a lot of studies have been conducted on optimizing locations for temporary relief emergency centers. In these studies, emergency medical service demand, supply and accessibility distribution is supposed to vary in different emergency scenarios and their phases [15]. Schempp et al. [16] proposed a framework of utilizing social networking services (SNS) data to detect the emergency demand distribution and optimize the temporal rescue centers via global particle swarm optimization and mixed-Integer linear programming. Oran et al. [17] proposed a location-routing problem that considers the propriety of the locations and solves the problem using an mix integer programming solver.

Finally, ambulance transportation is significant in emergency medical services (EMS) and has received much attention in some existing studies. Comparing to other emergency facilities, the optimization targets of ambulance transportation are not limited to the location of ambulance stations, but also include the relocation and dispatching of ambulances. Since the supply volume of an ambulance fleet is limited, a problem that can represent the vacancy of ambulances is necessary for real-world application. This problem could be either solved by deterministic models via the backup of multiple ambulances to cover EMS demands [14], or solved by the probabilistic models that represent the access information by the probability of ambulance vacancy [18]. Daskin [19] proposed a maximum expected coverage location problem (MEXCLP) that the expected coverage of ambulances is calculated by the vacant probability. The MEXCLP could be improved via short-term dynamic settings of ambulance supply and demand [20].

The problem approached in this study distinguishes itself from the existing EFLO problems in the following aspects: first, we assume the potential "patients" of our problem are pedestrians; second, the relief stations are not the destinations of the pedestrians, and the heatstroke risk is generated during the trip. Altogether these differences make our task a novel research problem in the field of emergency service.

Context-aware LBS application

Context-aware LBS application refers to those LBS applications that can provide service based on their present context including location, time and companions [21]. This extra information is of great significance to application users as their contexts vary from time to time, and any analysis with uncertain contextual information will generate bias and reduce application utility [9].

The last decade has witnessed the great development of contextual-aware LBS applications due to the availability of spatial and temporal data in high resolution [22]. A common context-aware implementation in the LBS application is to recommend points of interest (POI) to the visitors based on their spatio-temporal information, profiles and historical records. Yao et al. [23] proposed a tensor-factorization-based recommender system to recommend POIs with multi-dimensional contextual information. Besides single POI, several studies focused on recommending POI sequences. Chen and Jiang [24] proposed a context-aware personalized POI sequence recommendation system to recommend a sequence of POIs via reinforcement learning. Laß et al. [25] represented POIs by a graph and incorporated contextual information including historical records and traveling time into the traditional two-dimension user-item recommender system.

Another important implementation of context-aware information in LBS applications is route recommendation and navigation. In routing applications, contextual information could be utilized to measure the quality of each road segment to improve the traditional routing application by providing users with scenic, safe or attractive routes among other dimensions [26]. Specifically, the contextual information is utilized to evaluate each road segment based on its attractiveness or risk and choose the roads which are more attractive or less dangerous for different application scenarios. Attractiveness is usually evaluated by the accessibility to POIs [27] or the landscape diversity [28] while risk can be assessed by social environment represented by metrics such as accidents, crimes and population density[29, 30], or physical environment such as solar radiation and infrastructure preparedness [31]. Generally, the contextual information could be collected from official statistical data [32], location-based social networking (LBSN) platforms [29], or web map services [33]. Unlike the above-mentioned researches focused on recommending individual optimal routes, this study focuses on recommending routes for a group of people with the global optimal objective.


Problem definition and setting

Let us assume there is a planned large, long-lasting event that consists of several sub-events to be held in a given area. The area is composed of a road network with multiple venues, hotels, train stations and scenic spots that will be origin/destinations (ODs) for walking users. At different periods of each day, different sub-events will be held in different venues. During walking outdoors between ODs, pedestrians are at risk of heatstroke. In this study, many factors that affect the heatstroke risk of pedestrians, such as walking distance, solar radiation, pedestrian flow (which is represented simply by ‘flow’ in the following) density, the number and location of relief stations and the supply volume, are taken into the consideration.

The proposed problem is set as optimizing the number, location and supply volume of each temporary station as well as the pedestrian routes in the road network to reduce heatstroke each day during the large outdoor event. It should be emphasized that the solution of the problem corresponds to the scheduling scheme for all the sub-events every single day during the event. Before the optimization, there are some preparatory works needed to be done: (a) facilities and POIs extraction; (b) extraction and simplification of the road network for a given area; (c) the extraction and calculation of the heatstroke related data; (d) event schedule collection and pedestrian flow simulation. By handling the preparatory work and solving the optimization problem, we are not only able to provide event holders with a reasonable allocation scheme of relief stations and supply volume but also to recommend walking paths for pedestrians.

The optimization setting in our research can be described as follows:


  1. 1.

    There will be several inflows before each event and outflows after the event between event venues and other facilities such as places of interests (POIs), hotels and stations.

  2. 2.

    The location of the relief station cannot be changed during the day, the supply volume can be however reassigned at different times of the day.


  1. 1.

    The road network information including nodes, edges, the length of each edge, and the factor value that increases the vulnerability of each edge, the coordinates of each node.

  2. 2.

    The Environment related data of the given area.

  3. 3.

    The numbers of time units and simulated flow density at each time interval.

  4. 4.

    The sets of start nodes and end nodes of all flows.

  5. 5.

    The maximum number of relief stations and supply volumes of each station, the maximum allowed heatstroke risk of all edges (road) in the road network, the edge set on the path of each flow and the edge set between every two adjacent stations on the path of each flow.


  1. 1.

    The numbers and locations of relief stations on a given day.

  2. 2.

    The supply volume of each relief station at different time units.

  3. 3.

    The optimal route is made up of a set of road segments with the least heatstroke risk of different flows at different time units.

To mathematically model the problem, we represent the road network as a graph \(G = \left( {V,E} \right)\) that consists of the vertex set V and edge set E. Specifically, a vertex \(v \in V\) of the road network represents either an origin or destination point of flows or the intersections of the road segments. Then we propose a heatstroke risk metric to measure the risk of each road segment at different times during the events with different indicators including both pre-calculated parameters and the decision variables to be optimized. With the objective function of minimizing global risk values, a Mixed Integer Nonlinear Programming (MINLP) model [34] is established to work out the optimal solutions. MINLP model refers to a model whose decision variables include integer variables and continuous variables and, at the same time, the objective function or constraint condition contains the nonlinear form of the decision variable. For this type of model is difficult to guarantee the global optimal solution. However, the relatively optimal solution can be obtained by using a meta-heuristic algorithm such as genetic algorithm. All notations of the mathematical models that we are going to introduce are listed and described in the section of Nomenclature.

Measuring heatstroke risk

We use a framework of a traditional risk model with heterogeneous data collected from different data sources. A traditional risk model divides risk into three factors which are hazard, vulnerability and exposure. Then a simple approach for measuring emergency risk is realized by multiplication of these three factors:\(R = r_{hazard} \times r_{vulnerability} \times r_{exposurre}\).Generally, the hazard represents the possibility that the emergency happens [35] while vulnerability represents the lack of proper resistance to the emergency, which is dependent on the context information. Finally, exposure refers to the amount of time spent when exposed to the hazard or the number of people involved. Although several studies have been applied to estimate the heatstroke risk on a macro scale [36], few focus on microanalysis, which should have different indicators depending on the distinct micro context. We utilize different micro indicators to implement our risk model for micro heatstroke analysis. The indicators of the hazard, vulnerability and exposure factors are listed as follows:


Hazard is measured by Wet Bulb Globe Temperature (WBGT) which has been applied in other heatstroke-related studies [36, 37]. Specifically, we choose a data-driven approach to measure heatstroke hazard via historical WBGT data at different hours during summertime. We utilize a normalized index Wt to represent the probability of the heatstroke severity for each hour t. In particular, for each hour we evaluate the average WBGT in all summer days. Then the average WBGT is normalized by the min and max temperature based on the government guidance.Footnote 1


Vulnerability is the factor related to the contextual environment. Generally, the vulnerability could be generated by the existing contextual environment, or reduced by improving the environment via temporary service. In this study, vulnerability is denoted by the indicators of a road segment. Sky view factor (SVF) defines the ratio of sky hemisphere visible from the ground that is not obstructed by buildings, terrain or trees [38]. SVF has been proved to be quite an important indicator for computing solar radiation related to heatstroke. Generally, higher SVF in a place denotes more solar radiation, making the place more vulnerable to heatstroke [39]. Therefore, in our model SVF is utilized to measure the vulnerability of the existing contextual environment. On the other hand, the relief stations are set to reduce vulnerability and a station with a larger service volume (e.g., more volunteers) could help more pedestrians. Therefore, Vulnerability \(R_{i,t}^{V}\) could be measured by Eq. (1) with a given SVF value \(V_{i}^{I}\) and the vulnerability reduction indicator \(V_{i,t}^{R}\) computed from the supply volume \(N_{i,t}^{V}\) in each road segment i and time interval t.

$$R_{i,t}^{V} = \frac{{V_{i}^{I} }}{{V_{i,t}^{R} }} = \frac{{V_{i}^{I} }}{{1 + \left( {B_{i}^{S} N_{i,t}^{V} } \right)^{d} }} \, \forall i \in E,t \in T$$

where \(B_{i}^{S}\) are binary variables that refer to whether there is a relief station on the road segment i,\(N_{i,t}^{V}\) are integer variables that refer to the volumes of all the relief stations on the road segment i at time interval t. Finally, d is an index of vulnerability reduction indicator and is set to 1 in this research.


Exposure is measured by the total walking time of all pedestrians for each road segment. To simplify the calculation, we assume all pedestrians walking at the same speed in all road segments and within all-time intervals. As a result, the exposure of heatstroke in this study is proportional to the number of pedestrians and the road length for each road segment. Therefore, for a given road segment i at time interval t, exposure volume is denoted by Eq. (2)

$$R_{i,t}^{E} = L_{i} \sum\limits_{f} {B_{i,f,t}^{P} N_{f,t}^{P} } \, \forall i \in E,f \in F,t \in T$$

where \(L_{i}\) is the length of road segment i,\(B_{i,f,t}^{P}\) are binary variables referring to whether flow f is observed on edge i at time interval t, while \(N_{f,t}^{P}\) denotes the number of people of flow f at time interval t.

With the factors defined, the risk for flow f in road segment i at time interval t could be denoted by Eq. (3).

$$\begin{gathered} R_{i,f,t} = B_{i,f,t}^{P} \left( {W_{t} } \right)^{a} \left( {R_{i,t}^{V} } \right)^{b} \left( {R_{i,t}^{E} } \right)^{c} \hfill \\ \, = B_{i,f,t}^{P} \left( {W_{t} } \right)^{a} \left( {\frac{{V_{i}^{I} }}{{1 + \left( {B_{i}^{S} N_{i,t}^{V} } \right)^{d} }}} \right)^{b} \left( {L_{i} \sum\limits_{f} {B_{i,f,t}^{P} N_{f,t}^{P} } } \right)^{c} \, \forall i \in E,f \in F,t \in T \hfill \\ \end{gathered}$$

where \(W_{t}\) is the hazard factor defined by WBGT score during the time interval t.

Optimization model

With the risk metric defined above, this study provides an MINLP model to work out the solutions for facility and path optimization with one objective function and several constraints. The model is solved by genetic algorithm with several strategies to accelerate the computation process.

Objective function

The objective function is to minimize the total heatstroke risk, i.e., the risk value generated by the risk metric introduced in the last section, for all flows during all the events within a time interval T, which can be denoted by Eq. (4):

$$\min \, Risk = \sum\limits_{i} {\sum\limits_{f} {\sum\limits_{t} {R_{i,f,t} } } } \quad \forall i \in E,f \in F,t \in T$$


In this study, several constraints are set either for solutions to meet the predefined parameters or for overcoming the shortages of a single objective function for enabling more practical application. Generally, constraints can be categorized into the following four groups based on their target:

  1. A.

    Station constraints

The total number of supply stations established cannot exceed the maximum. It is described as below:

$$B_{i}^{S} = \left\{ \begin{gathered} 1, \, if \, \exists i = E_{s}^{S} \hfill \\ 0, \, if \, \forall i \ne E_{s}^{S} \hfill \\ \end{gathered} \right. \, \forall i \in E,s \in S$$
$$\sum\limits_{i} {B_{i}^{S} } \le N^{S,max} \, \forall i \in E$$
  1. B.

    Flow path constraints

In this study, since the flows are represented by a set of edges from the given origin and destination nodes, the path constraints mainly focus on edge connectivity and origin–destination connectivity.

Specifically, the origin–destination connectivity constraint denotes that the start (end) edge should be the only edge connected to the origin (destination) node. These constraints are as follows:

$$\sum\limits_{i} {B_{i,f,t}^{P} } = 1 \, \forall i \in E^{SE} ,f \in F,t \in T$$
$$\sum\limits_{i} {B_{i,f,t}^{P} } = 1 \, \forall i \in E^{EE} ,f \in F,t \in T$$

For each flow path at time interval t, the connectivity is judged by two Boolean matrices with the size of \(n_{f,t}^{E}\), adjacency matrix \(A_{f,t}\) and the reachability matrix \(P_{f,t}\) of the selected edges. Adjacency is represented by Constraint (11) which means if there is a point connected by both edge i and edge j, then the two edges are adjacent, the value of \(a_{i,j,f,t}\) is 1, otherwise it is 0. Reachability matrix \(P_{f,t}\) is obtained by Boolean addition and Boolean multiplication for adjacency matrix which are described by Eq. (13) and Eq. (14), and constraint (15) ensures that the graph composed of the selected edges is connected.

$$n_{f,t}^{E} = \sum\limits_{i} {B_{i,f,t}^{P} } \quad \forall i \in E,\,f \in F,\,t \in T$$
$$A_{f,t} = \left( {a_{i,j,f,t} } \right)_{{n_{f,t}^{E} \times n_{f,t}^{E} }} \, \forall i,j \in E^{FP} ,f \in F,t \in T$$
$$a_{i,j,f,t} = \left\{ \begin{gathered} 1, \, if \, N_{{_{i,f,t} }}^{EF} = N_{{_{j,f,t} }}^{EF} \, or \, N_{{_{i,f,t} }}^{EF} = N_{{_{j,f,t} }}^{ES} \, or \hfill \\ \, N_{{_{i,f,t} }}^{ES} = N_{{_{j,f,t} }}^{EF} \, or \, N_{{_{i,f,t} }}^{ES} = N_{{_{j,f,t} }}^{ES} \, \hfill \\ 0, \, otherwise \hfill \\ \end{gathered} \right. \, \forall i,j \in E^{FP} ,f \in F,t \in T$$
$$P_{f,t} = \left( {p_{i,j,f,t} } \right)_{{n_{f,t}^{E} \times n_{f,t}^{E} }} \, \forall i,j \in E^{FP} ,f \in F,t \in T$$
$$P_{f,t} = \bigcup\limits_{k = 1}^{{n_{f,t}^{E} }} {A_{f,t}^{\left( k \right)} } \, \forall f \in F,t \in T$$
$$A_{f,t}^{\left( k \right)} = A_{f,t}^{{\left( {k - 1} \right)}} \odot A_{f,t} \, \forall f \in F,t \in T$$
$$p_{i,j,f,t} = 1 \quad \forall i,j \in E^{FP} ,f \in F,\,t \in T$$
  1. C.

    Volume constraints

The following volume constraints ensure that the total volume of service number of all supply stations at any time interval cannot exceed the max value. In addition, the constraint that the volume number of supply stations on each road segment should not exceed the maximum function is realized by implementing a sufficiently large constant M.

$$N_{i,t}^{V} = \left\{ \begin{gathered} \sum\limits_{s} {N_{s,t}^{V} \, } , \, if \, i = E_{s}^{S} \hfill \\ 0, \, otherwise \hfill \\ \end{gathered} \right. \, \forall i \in E,s \in S,t \in T$$
$$\sum\limits_{i} {\left( {B_{i}^{S} N_{i,t}^{V} } \right)} \le N^{V,max} \, \forall i \in E,t \in T$$
$$N_{i,t}^{V} \ge M\left( {B_{i}^{S} - 1} \right) + 1 \, \forall i \in E,t \in T$$
$$N_{i,t}^{V} \le M\left( {1 - B_{i}^{S} } \right) + N^{SV,max} \, \forall i \in E,t \in T$$

where \(N_{s,t}^{V}\) is the volume of relief station s at time interval t.

  1. D.

    Risk constraints

Risk constraints are set to exclude those solutions with concentrated stations in adjacent road segments. Specifically, the constraints should ensure that the value of the risks at each edge (\(R_{i,t}\)), at all edges of each flow (\(\sum\limits_{i} {R_{i,f,t} }\)) and between every two adjacent stations on the path of flow f (\(\, R_{s,k,f,t}\)) should not exceed the predetermined max risk values. The constraints are listed as follows:

$$R_{i,t} \le Ri^{max} \quad \forall i \in E,\,t \in T$$
$$\sum\limits_{i} {R_{i,f,t} \le Rf^{max} } \quad \forall i \in E,\,f \in F,\,t \in T$$
$$\, R_{s,k,f,t} \le Rs^{max} \quad \forall s,k \in S,\,f \in F,\,t \in T$$

Optimization algorithm

The proposed MINLP problem is NP-hard and it is time-consuming to directly apply any solution to the proposed model due to a large number of variables. We then apply several strategies to effectively generate efficient solutions.

In particular, the problem is solved by genetic algorithm (GA). GA is a widely used effective algorithm with good performance of global search and strong robustness. It is suitable for solving complex optimization problems that can be described as mixed linear models or mixed nonlinear models. The GA algorithm in this work starts with a set of the initial population that is generated based on certain requirements rather than randomly generated. This is beneficial to improve the convergence rate and the quality of the solution. Then the algorithm evaluates each individual in the population through the fitness function. A certain proportion of individuals at the top are selected as elite individuals and directly retained in the next-generation population. The next-generation population also includes children who are reproduced by selected elite individuals through crossover and mutation. With the process of evolution, the solution gradually approaches the optimal solution according to the principle of the survival of the fittest.

Generating initial GA population

Inspired by the assignment of initial solutions to ant colony optimization (ACO) in [40], the proposed method generated an initial GA population with feasible solutions to accelerate the convergence. In this study, we choose a group of paths based on the actual situation of excluding the solutions with large detours. Specifically, we apply Dijkstra algorithm to generate the shortest paths with the least SVF weighted length. Dijkstra is a classic algorithm for finding the shortest path from a given starting vertex x to all n-1 other vertices in a positively weighted graph. Then a depth-first search is applied to acquire all paths with the edge number smaller than or equal to the edge number in the shortest path + 5. Then the initial population can be represented by a combination of different paths for different flows.

Penalty function

To get solutions that satisfy constraints in the presented model, we use a penalty function to exclude the chromosomes that cannot meet the constraints in the evolution. Then the fitness function by which the next generation is bred could be represented by a sum of the objective function and penalty function, which is shown as Eq. (23).

$$\begin{aligned} F\left( {{\mathbf{X}},\delta_{n} } \right) & = f\left( {\text{X}} \right) + \delta_{1} \sum\limits_{i = 1}^{{n^{p} }} {\left( {p_{i} \left( {\mathbf{X}} \right) - 1} \right)} + \delta_{2} \sum\limits_{j = 1}^{{n^{v} }} {\max \left\{ {0,\left( {v_{i} \left( {\mathbf{X}} \right) - N^{V,max} } \right)} \right\}} + \delta_{3} \sum\limits_{k = 1}^{{n^{ri} }} {\max \left\{ {0,\left( {ri_{i} \left( {\mathbf{X}} \right) - Ri^{max} } \right)} \right\}} \hfill \\ & \quad + \delta_{4} \sum\limits_{p = 1}^{{n^{rf} }} {\max \left\{ {0,\left( {rf_{i} \left( {\mathbf{X}} \right) - Rf^{max} } \right)} \right\}} + \delta_{5} \sum\limits_{q = 1}^{{n^{rs} }} {\max \left\{ {0,\left( {rs_{i} \left( {\mathbf{X}} \right) - Rs^{max} } \right)} \right\}} \hfill \\ \end{aligned}$$

where \({\mathbf{X}}\) represents a chromosome, i.e., a potential solution to the problem.\(f\left( {\text{X}} \right)\) is the objective function while the remaining items are penalty functions.\(\delta_{k} \left( {k = 1,2,3,4,5} \right)\) represents the weight of each penalty function which is usually a sufficiently large constant. The more variables that do not meet the constraints, the greater the value of the penalty function. Besides, the objective function is to minimize the risk of heatstroke. Therefore, the smaller the value of fitness, the better the solution. In addition, to further speed up the convergence, we compute the fitness function of the entire population in parallel.

Case study: an application scenario for Tokyo Olympic Games in Tokyo Waterfront City

Study area

Based on the model proposed above we conduct experiments on the walkable space of Olympic venues in the Tokyo Waterfront City (TWC) which mainly includes the regions of Odaiba (Aomi included) and Ariake. During the Tokyo Olympic Games, a lot of games are scheduled to be held in TWC. Besides, as a region with concentrated scenic spots, shopping malls and theme parks, TWC attracts a lot of visitors every year and ranks 12th among 4,027 scenic spots in the central Tokyo area.Footnote 2 The abundant scenic spots and hotels distributed in TWC make it a space with the forecasted high demand for walking during the Olympic Games as there will be a lot of visitors walking to the scenic spots near Olympic venues[41]. Figure 1 shows the map of the two main regions in TWC with different types of facilities and the extracted road network.

Fig. 1
figure 1

Spatial distribution of POIs in TWC

Data collection and preprocessing

POI and facility extraction

We collect different types of POIs including scenic spots, hotels, railway stations and Olympic venues from heterogeneous data sources. Scenic spots and hotel data are taken from TripAdvisor, railway stations from the National Land Numerical Information and avenue locations are taken from their official websites. Starting with the initial number of 400 raw POIs in Odaiba area collected from the TripAdvisor, we next merge them based on their spatial entities to remove duplicated POIs in the same building and we use the total comment numbers in each location as its popularity.

Road network

Road network is collected from OpenStreetMap (OSM) with the help of the library Osmnx [42]. In TWC region, the raw data collected from OSM include more than 4,000 road links including different road types, which makes it difficult to be directly applied to the optimization problem for pedestrians. Thus, we simplify the road network based on the extracted skeleton [43, 44] and attributes of roads: levels and types. After this simplification, the total number of road segments in TWC area is reduced to 234, in which 131 segments are located in Odaiba and 103 segments are located in Ariake.

Heatstroke related data collection and processing

  1. A.

    WBGT data

WBGT data is collected from the government websiteFootnote 3 at one-hour intervals. To represent the situation during the Tokyo Olympic Games, we take data on the same day from 2017 to 2019 to calculate the normalized index.

  1. B.

    SVF data

In order to calculate SVF for each road segment, we refer to the work of [44] to collect Google Street View images for each simplified road segment in the TWC area and we conduct image segmentation to extract the sky range in the images. Specifically, we generate intermediate points on each road segment with a five-meter interval, then use the coordinates of the points and nodes as the request parameters for Google API to gather panorama data. Having collected the panorama data, we utilize a SegNet model [45] trained by CityScape dataset [46] for image detection and convert the detection results to fisheye images to calculate SVF values.

Event schedule collection and flow simulation

In the case study, events represent the sports held in the venues of TWC during the Olympic Games. For each sport event, the official schedule of time, locationFootnote 4 and the estimated audience numberFootnote 5 are collected from the official website. In total there will be 71 sports events held during 16 days in the whole research area.

To simplify the computation, we choose in this study an hour as the time unit for calculating the flows. For each event, its estimated audience number is distributed as the total inflows within two-time units (two hours) just before the event. Similarly, the audience number is taken to represent the total outflows distributed during the two-time units (two hours) right after the event. Since there are no records for allocating the total flow volumes to individual flows, we apply the Huff model [47] to simulate the flow number between venues and other facilities which takes both distance decay and the facility popularity into consideration.

Experiments and results

Having the data collected and processed as explained above, we conduct in this case study several experiments with different data inputs for solving the optimization problem under different flow numbers and contextual information.

On one hand, TWC has an area of 400 ha which is too large to form a single walkable space and the distance of facilities between its two regions (Odaiba and Ariake) is relatively far (as shown in Fig. 1; it is necessary to go across bridges to reach another region). Thus, in this study, we regard these two regions as two independent walkable spaces and conduct experiments separately on each of these two regions. On the other hand, the sports events on different days have different schedules and different estimated numbers of audiences, while there is sufficient time to shift temporary stations and supplies at night. Therefore, in this study, we build different models for different days to make the application scenario more practical and to reduce the computation time for each model. In total, there will be 32 models (a combination of 16 days and 2 walkable spaces) to solve the problem in different contextual environments and people flows with a single group of parameters.

The optimization including the genetic algorithm and the proposed model is implemented by C +  + in the software called Qt in Ubuntu Linux 14.04.2. There are 2 CPUs where each of which is Intel (R) Xeon (R) CPU E5-2699 v3 @2.30 GHz. For the parameters of GA, the generation is set as 2000, the population size is set as 3000, while the rates of selection, crossover and mutation are 0.4, 0.8 and 0.3, respectively.

Result statistic and visualization

The results and the visualizations use the solution with a group of parameters in which the station number is 10, the total supply volume is 100 and the maximum supply volume in each station is set to 20. The two plots in Fig. 2 respectively show the optimized total risk as well as the expected risk for the shortest paths without relief stations in different days and hours in different areas during the Olympic games. In particular, the solid lines denote the expected heatstroke at different days and hours without any relief stations, while the dashed lines denote the heatstroke risk with relief stations.

Fig. 2
figure 2

Risk in Odaiba and Ariake area during Olympic games

From the plots, we can find that the risk varies in different days and hours with several peaks in several days and hours. Daily and hourly differences indicate that heatstroke risk is very sensitive to the Olympic schedule. Additionally, hourly differences can also reflect weather variation within a day. This is noticeable in the daily risk change, besides the peak observed at 1 p.m., due to both the busy schedule of events and high temperature. The observed peak at 8 a.m. is mainly due to the game schedule. This result mainly could contribute to the efforts made by the Tokyo government aiming at reducing the heatstroke risk for outdoor sports events. Although the performance varies at different hours and days, correctly setting relief stations and optimizing routes can significantly reduce total risk in different event scenarios.

Since there are too many events to be visualized in maps, we selectively visualize the flow density, optimized facility location and the supply volume of each facility in both Odaiba and Ariake area at 8 a.m. and 1 p.m. on July 26 and August 1 respectively in 8 maps of Fig. 3. From these maps, we can observe that the supply volume and pedestrian flow density vary at different hours in a day, which stresses the significance of optimizing supply volume within one day. On the other hand, the changes in the optimized locations and flow density at different days suggest the necessity of setting different relief stations on different days.

Fig. 3
figure 3

Visualization of event flow density, relief station location and supply volume in each station

Sensitivity analysis

We now conduct sensitivity analysis on the supply volume and stations. Figure 4 shows the sensitivity results for the data of Odaiba on the 3rd, August.

Fig. 4
figure 4

Sensitivity analysis: fitness functions in relation to station numbers and supply volumes

The increase in the total supply volumes or the number of relief stations will reduce the value of the fitness function. This means that increasing the number of supplies (e.g., the number of volunteers or the number of relief resources such as bottled water) or relief stations will either reduce the total risk or reduce the probability that the variables will not meet the constraints in the presented model.

From the results shown in Fig. 4a, the fitness basically decreases linearly with the increase in the number of supply volumes. This shows that in the experiments, 100 units of supply volume may not have reached the upper limit to minimize the total risk in Odaiba area on 3rd, August. However, for the number of relief stations, as shown in Fig. 4b, the rate of fitness reduction gradually decreases along with the increase in the number of stations and tends to remain stable.

On the other hand, when the number of supply volume and the number of relief stations are greater than 50 and 5, respectively, for each flow, the risk between adjacent relief stations on its path has already met the constraint of being less than the maximum risk. Therefore, these solutions are feasible. Overall, when resources are limited, such as the maximum supply volume is 100 and the maximum number of relief stations is 10, the more supply volumes and relief stations, the lower the total risk value is.

Ablation study

We conduct several ablation analyses to directly evaluate the performance of our method. Specifically, we compare the fitness between our model and other ablated model settings which are listed as follows:

  1. 1.

    Fixed routes: with the optimized station location, we set all routes of each flow as the shortest routes.

  2. 2.

    Fixed volume: with the optimized station location and routes, we set fixed and equal supply volume, i.e., 10 volume units in each station when the total volume is 100 and the station number is 10.

  3. 3.

    No station: only routes are optimized for each OD and no relief stations are set.

The ablation analysis results conducted on different dates and areas are given in Table 1. In the table, the bold values are the best solutions. Generally, we can observe an increase of the fitness value under different tested assumptions, which results from the poor performance of stations and routes under the risk model. Also, we can observe some large difference between the ablated results and our models, which results from the large penalty value generated in the ablated models.

Table 1 Ablation analysis based on fitness


Results discussion

From the results reported in “Result statistic and visualization” section, the Olympic schedule, solar radiation and the relief station have obvious effects on the total risk. A busy schedule of Olympic events and strong solar radiation (high temperature) will increase the total risk, as shown in Fig. 2. On the contrary, the setting of rescue stations can effectively reduce the risk, as shown in Fig. 2 and Table 1. These results are consistent with the description of Eq. (3). The Olympic schedule determines the flow density on the road. Risk is proportional to the flow density and solar radiation, while it is inversely proportional to the number of relief stations and the supply volumes. Therefore, for the Olympic Games' organizers, planning a schedule reasonably and setting up relief stations would be the key ways to reduce the total risk, which also reflects the necessity of optimizing the layout of relief stations and the supply volumes scheduling in this research.

The sensitivity analysis illustrates that the risk decreases as relief stations and supply volumes increase. For the experiment in this research, the setting of the number of relief stations (10) is reasonable, while the supply volumes can be further increased. From Fig. 4, it can be found that continuing to increase the supply volumes will further reduce the total risk and the setting of 100 units has not yet reached the upper limit. However, the increase in the supply volume will bring an increase in operational costs. It is thus necessary to balance these two factors in the optimization, however, note that this research does not take operational costs into the consideration. Therefore, future work will improve this limitation and multi-objective optimization between risk and cost needs to be studied.

The ablation study illustrates the advantages of the proposed model which can be used to optimize the relief station layout, supply volume scheduling and recommended routes of pedestrians, simultaneously. Comparing the proposed model and the fixed routes model, almost all the results of the former are better than the latter. This indicates that the route with the shortest distance may not be the route with the least risk, because the addition of relief stations is another reason for the risk reduction. Therefore, it is essential to optimize relief stations and routes at the same time. For pedestrians, selecting the recommended routes which have been optimized is a good way to reduce the heatstroke risk. Besides, looking at the results of the model of fixed volume we observe that all its results are not better than the results of the proposed model, proving the effectiveness of the optimization of volume scheduling at different hours of each day. Furthermore, the results of the model with no stations further illustrate the advantage of our proposal. The addition of relief stations can significantly reduce the total risk, and its impact is greater than the optimization of routes and volume schedule.

Method discussion

The advantages of the proposed method are that it does not only plan the placement of relief stations and supply volume scheduling but also determines the optimal routes for the dynamic pedestrian flows. Besides, it is a general method that also has social values that are not only confined to Tokyo Olympic Games. With the indicators and metrics for other types of risks, our method is potentially applicable for solving optimization problems in other specific scenarios that require facility and route optimization in large walkable spaces such as large theme parks and big outdoor exhibitions in any other countries with the risks that are also context-sensitive. In addition, although it cannot be applied directly in daily life as we cannot estimate the flow demand in each road and it is not realistic to enforce all passengers to walk in the fixed route, the concept of our heatstroke risk model can still be applied in practice with different parameters, constraints and other optimization contents such as setting vending machines or planting trees to reduce vulnerability.

Nevertheless, this study has the following limitations on data and models. First, the population simulation could not be evaluated in the current stage since there was no such a big event held with flow data and detailed schedules being provided, as well as it is difficult for local governments to replicate our experiment even with the upcoming big events. In addition, although various prior studies support our choice of contextual information for modeling the heatstroke risk, it is still an assumption that the contextual information utilized in our analysis has an actually high influence in a specific scenario that we focus on, while other factors such as topology, different walking speed and heatstroke resistance of pedestrians among different age groups are not included in the current study. With this, the model is then still not perfect enough for representing real-world scenarios. Besides, we use an MINLP model for the optimization with tens of thousands of variables, which suggests that it needs more validation for the cases of larger and more complicated walkable spaces than ones used for the Tokyo Olympics.

In the future study, we will first try to improve the limitations of our work. Specifically, we will simulate pedestrian flows and evaluate contextual information with more observational data and infrastructure data from several datasets. Besides we will propose a better model with the consideration of operational costs that apply improved, more effective algorithms to optimize routes, facilities and SVF-related infrastructures. Finally, with the improved data and methods, we will try to apply our framework to other application scenarios.


This study proposed a novel emergency service problem that can be applied in large outdoor event scenarios with multiple walking flows and a novel framework to evaluate the heatstroke risk in walkable spaces during large events by utilizing context-aware indicators that are generated by large and heterogeneous data including facilities, road networks and street view images. Based on a heatstroke risk model, we minimize the total heatstroke risk by solving an MINLP problem for optimizing routes of pedestrians, determining the location of relief stations and the supply volume in each relief station. To illustrate the effectiveness of the proposed model, we then conduct a case study on the planned site of the Tokyo Olympics that is simulated during the two weeks' long period of the Olympic schedule. The social value of the proposed framework is that it not only helps provide layout and scheduling of service facilities and volumes for government and event holders but also recommends routes for pedestrians to reduce the heatstroke risk (or other risks) during large-scale outdoor events.

Availability of data and materials;, based on the ranking on August 25, 2020;;, in this study we use the schedule before the games' postponement., in this study we use the schedule before the games' postponement.



  2., based on the ranking on August 25, 2020.


  4., in this study we use the schedule before the games' postponement.

  5., in this study we use the schedule before the games' postponement.



Ant colony optimization


Automated external defibrillator


Emergency facility location optimization


Genetic algorithm


Location-based services


Location-based social networking


Problem to maximize covering location


Maximum expected coverage location problem


Mixed integer nonlinear programming


Origins and destinations


Off-site public access devices




Points of interest


Sky view factor


Tokyo Waterfront City


Uncertain geographic context problem


Wet bulb globe temperature

E :

The ID set of all edges in the road network, each one denoted by indices i and j indicating start and end node of an edge

E EE :

The set of the edges connected with end node of each flow at all time intervals, each denoted by indices i and j,\(E^{EE} \in E\)

E FP :

The ID set of selected edges of the flow path in the road network, denoted by indices i and j, \(E^{FP} \in E\)

E SE :

The ID set of the edges connected with start node of each flow at all time intervals, each denoted by indices i and j,\(E^{SE} \in E\)

F :

The ID set of flows, denoted by the index f

S :

The ID set of stations, denoted by s and k

T :

The ID set of candidate time intervals, denoted by the index t

V :

The ID set of all nodes in the road network, denoted by indices \(\alpha\) and \(\beta\)

c :

Factor value that increases vulnerability in the road segment, the average SVF value in this paper

L i :

Road length (or travel time) of edge i

N T :

The number of time intervals

\(N_{t}^{F}\) :

The number of flows at time interval t

\(N_{f,t}^{P}\) :

The number of people of flow f during time interval t

N V,max :

The max supply volumes of all stations

N SV,max :

The max supply volumes of one station

N S,max :

The max station numbers

\(N_{i,f,t}^{EF}\) :

The first node ID of the selected edge i on flow path f at a time interval t

\(N_{i,f,t}^{ES}\) :

The second node ID of the selected edge i on flow path f at a time interval t

RF max :

The threshold of the maximum risk of edges of flow f

Ri max :

The threshold of the maximum risk of each edge

Rs max :

The threshold of the maximum risk between two adjacent stations on the path of flow f

W t :

Hazard factor denoted by WBGT score during a time interval

\(B_{i,f,t}^{P}\) :

Binary variable, 1 if a flow f is observed on edge i at a time interval t, 0 otherwise

\(E_{s}^{S}\) :

Integer variable refers to the ID of the edge which has a station s

\(N_{s,t}^{V}\) :

Integer variable refers to the volume of service station s at a time interval t

\(a_{i,j,f,t}\) :

The value of each element in the adjacency matrix of selected edges for flow f at time interval t

\(B_{i}^{S}\) :

Binary variable, 1 if there are some stations are established on edge i; 0 otherwise

\(N_{i,t}^{V}\) :

Integer variable refers to the volume of service in a station on edge i at a time interval t

\(n_{f,t}^{E}\) :

The number of edges on flow path f at time interval t

\(p_{i,j,f,t}\) :

The value of each element in the accessibility matrix of selected edges for flow f at time interval t

\(R_{i,f,t}\) :

Refers to the risk value of edge i of flow f at a time interval t

\(R_{i,t}^{E}\) :

Refers to vulnerability on edge i at a time interval t

\(R_{i,t}^{V}\) :

Refers to exposure on edge i at a time interval t

\(V_{i,t}^{R}\) :

Factor value that decreases vulnerability in the road segment i at time interval t


  1. Barnosky AD. Heatstroke: nature in an age of global warming. Washington: Island Press; 2010.

    Google Scholar 

  2. Hanna EG, Tait PW. Limitations to thermoregulation and acclimatization challenge human adaptation to global warming. Int J Environ Res Public Health. 2015;12:8034–74.

    Article  CAS  Google Scholar 

  3. Orosa JA, Costa ÁM, Rodríguez-Fernández Á, Roshan G. Effect of climate change on outdoor thermal comfort in humid climates. J Environ Health Sci Eng. 2014;12:46.

    Article  Google Scholar 

  4. Demartini JK, Casa DJ, Stearns R, Belval L, Crago A, Davis R, et al. Effectiveness of cold water immersion in the treatment of exertional heat stroke at the falmouth road race. Med Sci Sports Exerc. 2015;47:240–5.

    Article  Google Scholar 

  5. Kim S-H, Jo S-N, Myung H-N, Jang J-Y. The effect of pre-existing medical conditions on heat stroke during hot weather in South Korea. Environ Res. 2014;133:246–52.

    Article  CAS  Google Scholar 

  6. Xia TQ, Adam J, Wang ZN, Si RC, Zhang HR, Xin Liu, et al. CoolPath: an application for recommending pedestrian routes with reduced heatstroke risk. Web and Wireless Geographical Information Systems 18th International Symposium, W2GIS 2020 Proceedings Lecture Notes in Computer Science (LNCS 12473). 2020. p. 14–23.

  7. Sun Q, Macleod T, Both A, Hurley J, Butt A, Amati M. A human-centred assessment framework to prioritise heat mitigation efforts for active travel at city scale. Sci Total Environ. 2021.

    Article  PubMed  PubMed Central  Google Scholar 

  8. Li XJ, Ratti C. Mapping the spatio-temporal distribution of solar radiation within street canyons of Boston using Google Street View panoramas and building height model. Landsc Urban Plan. 2019;191:12.

    Article  Google Scholar 

  9. Kwan M-P. The uncertain geographic context problem. Ann Assoc Am Geogr. 2012;102:958–68.

    Article  Google Scholar 

  10. Church R, ReVelle C. The maximal covering location problem. Pap Reg Sc Assoc. 1974;32(1):101–18.

    Article  Google Scholar 

  11. Toregas C, Swain R, ReVelle C, Bergman L. The location of emergency service facilities. Oper Res. 1971;19:1363–73.

    Article  Google Scholar 

  12. Ahmadi-Javid A, Seyedi P, Syam SS. A survey of healthcare facility location. Comput Oper Res. 2017;79:223–63.

    Article  Google Scholar 

  13. Siddiq AA, Brooks SC, Chan TC. Modeling the impact of public access defibrillator range on public location cardiac arrest coverage. Resuscitation. 2013;84:904–9.

    Article  Google Scholar 

  14. Hogan K, ReVelle C. Concepts and applications of backup coverage. Manag Sci. 1986;32:1434–44.

    Article  Google Scholar 

  15. Larson RC. Decision models for emergency response planning. Handbook of homeland security. Citeseer; 2005. p. 911–27.

  16. Schempp T, Zhang H, Schmidt A, Hong M, Akerkar R. A framework to integrate social media and authoritative data for disaster relief detection and distribution optimization. Int J Disaster Risk Reduct. 2019;39:101143.

    Article  Google Scholar 

  17. Oran A, Tan KC, Ooi BH, Sim M, Jaillet P. Location and routing models for emergency response plans with priorities. Future Security Research Conference. Springer; 2012. p. 129–40.

  18. Başar A, Çatay B, Ünlüyurt T. A taxonomy for emergency service station location problem. Optim Lett. 2012;6:1147–60.

    Article  Google Scholar 

  19. Daskin MS. A maximum expected covering location model: formulation, properties and heuristic solution. Transp Sci. 1983;17:48–70.

    Article  Google Scholar 

  20. Coskun N, Erol R. An optimization model for locating and sizing emergency medical service stations. J Med Syst. 2010;34:43–9.

    Article  Google Scholar 

  21. Brown PJ, Bovey JD, Chen X. Context-aware applications: from the laboratory to the marketplace. IEEE Pers Commun. 1997;4:58–64.

    Article  Google Scholar 

  22. Subbu KP, Vasilakos AV. Big data for context aware computing—perspectives and challenges. Big Data Res. 2017;10:33–43.

    Article  Google Scholar 

  23. Yao L, Sheng QZ, Qin Y, Wang X, Shemshadi A, He Q. Context-aware point-of-interest recommendation using tensor factorization with social regularization. Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2015. p. 1007–10.

  24. Chen J, Jiang W. Context-aware personalized POI sequence recommendation. International Conference on Smart City and Informatization: Springer; 2019. p. 197–210.

  25. Laß C, Herzog D, Wörndl W. Context-aware tourist trip recommendations. Proceedings of the 2nd workshop on recommenders in tourism co-located with 11th ACM conference on recommender systems (RecSys 2017), Como, Italy, August 27, 2017.

  26. Siriaraya P, Wang Y, Zhang Y, Wakamiya S, Jeszenszky P, Kawai Y, et al. Beyond the shortest route: a survey on quality-aware rroute navigation for pedestrians. IEEE Access. 2020;8:135569–90.

    Article  Google Scholar 

  27. Gavalas D, Kasapakis V, Konstantopoulos C, Pantziou G, Vathis N. Scenic route planning for tourists. Pers Ubiquit Comput. 2017;21:137–55.

    Article  Google Scholar 

  28. Zhang Y, Siriaraya P, Wang Y, Wakamiya S, Kawai Y, Jatowt A. Walking down a different path: route recommendation based on visual and facility based diversity. Companion Proceedings of the Web Conference 2018. 2018. p. 171–4.

  29. Mata F, Torres-Ruiz M, Guzmán G, Quintero R, Zagal-Flores R, Moreno-Ibarra M, et al. A mobile information system based on crowd-sensed and official crime data for finding safe routes: a case study of Mexico City. Mob Inf Syst. 2016.

    Article  Google Scholar 

  30. Zhang Y, Siriaraya P, Kawai Y, Jatowt A. Rehab-path: recommending alcohol and drug-free routes. Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 2019. p. 2929–32.

  31. Bao S, Nitta T, Ishikawa K, Yanagisawa M, Togawa N. A safe and comprehensive route finding method for pedestrian based on lighting and landmark. 2016 IEEE 5th Global Conference on Consumer Electronics: IEEE; 2016. p. 1–5.

  32. Galbrun E, Pelechrinis K, Terzi E. Urban navigation beyond shortest route: the case of safe paths. Inf Syst. 2016;57:160–71.

    Article  Google Scholar 

  33. Posti M, Schöning J, Häkkilä J. Unexpected journeys with the HOBBIT: the design and evaluation of an asocial hiking app. Proceedings of the 2014 Conference on Designing Interactive Systems 2014. p. 637–46.

  34. Lee J, Leyffer S. Mixed integer nonlinear programming. New York: Springer Science & Business Media; 2011.

    Google Scholar 

  35. Kron W. Keynote lecture: Flood risk = hazard × exposure × vulnerability. Flood Def. 2002. p. 82–97.

  36. Kasai M, Okaze T, Yamamoto M, Mochida A, Hanaoka K. Summer heatstroke risk prediction for Tokyo in the 2030s based on mesoscale simulations by WRF. J Heat Island Inst Int. 2017;12:2.

    Google Scholar 

  37. Lemke B, Kjellstrom T. Calculating workplace WBGT from meteorological data: a tool for climate change assessment. Ind Health. 2012;50:267–78.

    Article  Google Scholar 

  38. Bernard J, Bocher E, Petit G, Palominos S. Sky view factor calculation in urban context: computational performance and accuracy analysis of two open and free GIS tools. Climate. 2018.

    Article  Google Scholar 

  39. Masoud B, Coch H, Crespo I, Beckers B. Effects of urban morphology on shading for pedestrians: sky view factor (SVF) as an indicator of solar access. Smart and Healthy Within the Two-degree Limit (Plea 2018). 2018;3:1029–30.

  40. Zhang H, Liang Y, Liao Q, Wu M, Yan X. A hybrid computational approach for detailed scheduling of products in a pipeline with multiple pump stations. Energy. 2017;119:612–28.

    Article  Google Scholar 

  41. Weed M. Olympic tourism. London: Routledge; 2007.

    Book  Google Scholar 

  42. Boeing G. OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput Environ Urban Syst. 2017;65:126–39.

    Article  Google Scholar 

  43. Ladak A, Martinez RB. Automated derivation of high accuracy road centrelines Thiessen polygons technique. 1996. p. 370.

  44. Liang J, Gong J, Zhang J, Li Y, Wu D, Zhang G. GSV2SVF—an interactive GIS tool for sky, tree and building view factor estimation from street view photographs. Build Environ. 2020;168:106475.

    Article  Google Scholar 

  45. Badrinarayanan V, Kendall A, Cipolla R. Segnet: a deep convolutional encoder-decoder architecture for image segmentation. IEEE Trans Pattern Anal Mach Intell. 2017;39:2481–95.

    Article  Google Scholar 

  46. Cordts M, Omran M, Ramos S, Rehfeld T, Enzweiler M, Benenson R, et al. The cityscapes dataset for semantic urban scene understanding. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2016. p. 3213–23.

  47. Huff DL. Defining and estimating a trading area. J Mark. 1964;28:34–8.

    Article  Google Scholar 

Download references


The support provided by the China Scholarship Council (CSC) during a visit of Yan Wu to the University of Tokyo is gratefully acknowledged. Financial support from 19K15260 KAKENHI (Early-Career Scientists Grant) is acknowledged. The support provided by the New Energy and Industrial Technology Development Organization (NEDO) is acknowledged.


The funding provided by China Scholarship Council (CSC). 19K15260 KAKENHI (Early-Career Scientists Grant). New Energy and Industrial Technology Development Organization (NEDO).

Author information

Authors and Affiliations



YW performed the mathematical modeling, the experiment and wrote the manuscript; TX contributed to the conception of the study, data processing, the visualization and was a major contributor in writing the manuscript; AJ and KK contributed to the manuscript revision; HZ helped improve the method of the optimization; XF and RS helped improve the quality of the article and review the manuscript. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Tianqi Xia.

Ethics declarations

Ethics approval and consent to participate

Not applicable.

Consent for publication

Not applicable.

Competing interests

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit The Creative Commons Public Domain Dedication waiver ( applies to the data made available in this article, unless otherwise stated in a credit line to the data.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, Y., Xia, T., Jatowt, A. et al. Context-aware heatstroke relief station placement and route optimization for large outdoor events. Int J Health Geogr 20, 23 (2021).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: