Research Article  Open Access
A Continuous Approximation Approach Based on Regular Hexagon Partition for the Facility Location Problem under Disruptions Risk
Abstract
Today’s business environment is complex, dynamic, and uncertain which makes a supply chain facility increasingly vulnerable to disruption from various risk accidents as one of the main threats to the whole supply chain’s operation. However, in general, most of the studies on facility location problems assume that the facilities, once built, will always run availably and reliably. In fact, although the probability is very low, supply chain disruptions often incur disastrous consequences. Therefore, it is critical to account for disruptions during designing supply chain networks. To accomplish planned outcomes and greater supply chain resiliency, this article proposes a continuous approximation approach based on regular hexagon partition to address the reliable facility location problems with consideration of facility disruptions risk. The optimization goal is to determine the best facility location that minimizes the expected total system cost on the premise that the supply chain network is not disrupted as a whole when one or some facilities are subject to probabilistic failure. Our numerical experiment discusses the performance of the proposed solution approaches which demonstrates that the benefits of considering disruptions in the supply chain design can be significant. In addition, considering the impact of disruption probability estimation error on the optimal decision, the misestimating of the disruption probability is also investigated in this paper.
1. Introduction
Today’s business context is totally different from before. The fierce competition and the rapid changing of customers’ preferences, together with the fast development of information technology and globalization, have forced firms to operate jointly instead of individually [1, 2]. However, the highly dynamic and uncertain environment often poses serious challenges to the supply chain decisionmakers. In general, the optimal decisions of supply chain network design include the quantity, location, and capacity of entities in each echelon of the chain. Therefore, supply chain network design increasingly becomes critical and difficult in nature which has remarkable impacts on all other decisions concerning a supply chain’s operation and performance. Particularly, it is very expensive to change and these processes become more and more complex [3]. In consequence, this complexity makes decisionmaking more difficult and complicated. Although great effort has been expended on trying to make supply chains leaner and reducing its operational costs, recent studies indicate that they have increased supply chain risks simultaneously [4]. Among the various types of risks related to supply chain management, facility disruption risk is highly focused due to its severe, sometimes disastrous, consequences than others [5, 6]. Therefore, in such a business context, the topic on supply chain facility location problems has gained widespread attention in the last two decades from a risk management perspective [7].
Facility location problems are among the classical OR/MS (Operations Research/ Management Science) problems which have been broadly investigated and applied in many areas [8]. In the supply chain context, the term “Facility” usually means a business entity which systematically integrates related resources, e.g., capital, material, manpower, equipment, and technology, together to manufacture specific products and services or to achieve the planned functions. Therefore, facility location plays a critical role in the strategic design of supply chain networks to accomplish an efficient and effective supply chain [9]. In essence, a general facility location optimization involves facility location, capacity, and route designing, in a specific area with specific goals, such as minimized cost or maximized market coverage. The supply chain should be carefully designed to best satisfy their spatially distributed demand. Furthermore, the expensive facility construction cost and difficulty in modifying highlight the importance of facility location decisions [10].
The extant literature on supply chain facility location problems generally assumes the facilities are always available and perfectly reliable to serve their customers throughout the planning horizon but without considering the facility disruption risk [11]. However, the risk accidents that could disrupt the supply chain maybe exit anywhere and anytime, and failing to cope with them adequately may led to huge economic losses [12]. In today’s complex, dynamic, and uncertain business environment, supply chain facilities are increasingly vulnerable to disruption partially or completely which has become one of the main threats to the whole supply chain’s operation [13]. Various risk events, e.g., natural catastrophes, keysupplier failure, strikes, or purposeful terrorist attacks and trade barriers, indicated that the business environment is becoming increasingly more uncertain and fragile than ever before [14, 15]. Further, the globalized procurement, decentralized manufacturing and outsourcing, supplier reduction and minimizing inventory, etc., as well as tightly optimized, lean supply chain practices championed by practitioners and researchers, increase the vulnerability of supply chain and highlight the significance and urgency of proactive risk management [5, 16]. So, the topic on supply chain disruption risk has attracted growing attention in the last few years [12].
Designing a robust and reliable supply chain network will contribute to maintaining and enhancing its ability to better against supply chain disruptions [17]. There are some reliable facility location models that have only appeared very recently which generally addressed the ability of supply chain networks as a whole to maintain basic operations when some facilities are disrupted unexpectedly. To our knowledge, the seminal work on reliable facility location problem was carried out by Snyder & Daskin [18] which investigates facility disruption risk. Although the topic on reliable location problems has received much attention, it is still understudied, especially in the subfield of continuous facility location problem [9, 19].
In this study, focusing on facility disruption risk, a stylized reliable facility location model will be formulated in a continuous plane which divides the demand area as hexagonal grid. The optimization goal is to minimize the expected total cost on the premise that the supply chain network is not disrupted as a whole with consideration of facility disruptions risk. More specific, the expected total cost includes initial facility construction costs and expected transportation cost in normal and disruption scenarios. In addition, considering the disruption probability estimation error, the impact of misestimating the disruption probability on optimal decisions is also examined in this paper.
Our findings contribute to the literature in several ways: this study adds to the growing body of literature on reliable facility location problems. As mentioned above, the supply chain failure would incur severe, even disastrous, consequences to the supply chain’s operational continuity or firm’s survival. However, this topic is still understudied. Some research investigated discrete reliable location problem, while very few literature addressed continuous location problem which is proposed to overcome the deficiency of discrete models in solving largescale problems; for the continuous location literature, to our knowledge, this is the first study that adopts a new method that divides the demand area as hexagonal grid in a continuous facility location model. The hexagonal partition is an optimal scheme to divide a huge plane into a number of regular subregions with equal area and it is a substantial improvement in continuous location problem; the analysis on the misestimating disruption probability is very limited in the extant supply chain literature. Actually, the estimation error never vanishes. This study will shed light on it by discussing the sensitivity and robustness of the model to explore the effect of estimation error on the optimal solution.
The remainder of the paper is structured as follows. Section 2 presents a related literature review, which systematically summarizes the current research of reliable facility location problem. Section 3 proposes the research problem by formulating it into a continuous location model with consideration of facility disruptions risk and the empirical results are analyzed. In Section 4, this paper conducts a numerical experiment to analyze the algorithm’s solving performance, as well as its sensitivity and robustness which are also investigated. In Section 5, we end the paper by concluding remarks and drawing managerial insights, as well as briefly discussing further research directions.
2. Theoretical Background and Literature Review
The topic of facility location is not new which could be traced back to the classical Weber problem in 1909 [20, 21]. Basically, facility location problems explore where to configure facilities so as to minimize the cost of satisfying a certain amount of demands in an efficient way [22]. In addition, the facility location decisions can have a longlasting impact on future business of a supply chain as well as its flexibility to satisfy these demands as they maybe evolve over time. Thereafter, facility location problem received increasing attention and has been broadly investigated and applied in many areas.
Based on a systematic review of the extant literature, we could identify a variety of classifications on facility location problems. In order to present a clearer logic, we will adopt the classification of American Mathematical Society [23] in this paper to outline and examine research related to the facility location problems, particularly reliable facility location problems. According to this classification, the facility location problems are usually sorted into discrete location problem and continuous location problem which are interrelated logically. The original facility location problem was raised as a discrete problem which is usually defined as an optimal decision of the sites to locate new facilities among some available candidate locations. It seeks to determine the optimal facility locations and demand assignments to balance the tradeoff between initial fixed setup costs and routine transportation costs (as shown in Figure 1(a)). Most facility location problems focused on discrete, especially for some specific facility location decisions (e.g., [18, 24, 25]). Although the discrete models are considered more realistic in most cases, the researchers still hold negative attitudes on the practicality of the models in largescale facility location problems [26]. The main argument is that its excessive computational burden in largescale problems often makes it unable to obtain the optimal solution and even becomes NPhard (e.g., Figure 1(b)). In order to overcome this deficiency, continuous approximation (CA) models are developed to obtain good approximate solutions to largescale problems which is a good alternative to find nearoptimal solutions. In most CA models, a large set of spatially distributed customers (demand points) can be approximated properly by a continuous function [27]. Accordingly, the whole target demand region could be divided continuously into a number of subregions and each one is serviced by an assigned facility. In this way, the continuous subdemand regions and facilities could be stated as Figure 1(c). This solution may be feasible when there are a limited number of subregions. However, it is almost impossible to deal with the increasing number of subregions and also becomes NPhard as Figure 1(b). Therefore, aims to make a rational tradeoff between solution’s accuracy and computational burden,improved CA models in an infinite homogeneous plane based on stylized grid emerged (e.g., Figure 1(d)). The principal idea of CA models is to approximate a large amount of discrete spatially distributed customers (demand points) as a continuously distributed service area to overcome the computational difficulties associated with largescale problems [28]. While the CA approach does not decide the exact location of the candidate facilities, it defines a subregion for each facility in terms of continuous service areas [29].
(a)
(b)
(c)
(d)
However, in general, most studies on facility location problems assume that the facilities, once built, will always run availably and reliably. Actually, today’s dynamic and uncertain environment makes facilities increasingly vulnerable to fail from time to time. Although the probability is very low, there are numerous legendary examples of significant supply chain disruptions that have resulted in heavy losses to the whole supply chain network. Therefore, the research on the reliable facility location problem which considers disruption risk is an emerging research area in recent years [5].
To increase the robustness and reliability of a supply chain in mitigating unpredicted facility disruptions, a number of reliable models have been designed. To the best of our knowledge, the seminal work on reliable facility location problem was carried out by Snyder & Daskin [18] in this field. Assuming that the facility failure probabilities are mutually independent and equal, this paper investigates an uncapacitated fixedcharge location problem (UFLP) based on pmedian problem. Thereafter, many researches mainly focused on discrete location problems attracting more attention as an emerging field. However, there are only a few papers that examined facility location problems with consideration of disruption risk by introducing CA model. Lim et al. [4] addressed a continuous facility location problem under the facility disruption scenario with the option of hardening selected facilities (various protection plans). In their model, the disruption probabilities are assumed independent and the whole service area follows a continuous uniform distribution which is divided as chessboard grid. Further, Cui, Ouyang, and Shen [27] investigated the same problem by developing a CA model with a relaxed assumption of locationspecific probabilities. In their model, an infinite homogeneous plane is divided as regular trianglehexagon partition to achieve the optimal facility location decision. Li and Ouyang [30] focused his research on spatially correlated, sitedependent disruption probabilities by developing a CA model to minimize the sum of initial facility setup costs and the expected transportation costs between facilities and demands under normal and failure scenarios. This paper also discusses the impacts of spatial distribution characteristics of a continuous service area and the changes of disruption probability on the model. By formulating a disk model, Ouyang and Daganzo [31] transform the CA approach for location problems into feasible discrete designs which could be easily applied to other logistics problems. Furthermore, Wang, Lim, and Ouyang [28] extend the disk model of Ouyang and Daganzo [31] to a tube model to discretize the continuous facility density function into a set of timevarying facility location trajectories which effectively solves the dynamic location problem to a certain accuracy. In addition, Wang and Ouyang [10] propose a gametheoretical model based on a CA program to optimize supply chain network design in which the spatial competition and facility disruption risks are considered. In addition, considering three risk factors (demand, supply, and financial), Jabalameli et al. [32] studied a capacitated location problem in a continuous space as a risk model.
Briefly, there are two limitations to the existing literature about the continuous location problem. First, the partition on the target area is still understudied. In most CA models, how to divide the whole target area continuously as a key issue determines the computational performance. For example, in the extant literature, Novaes et al. [33] investigate a quasicontinuous facility location problem in a finite irregular region (Figure 2(a)). While the works of Lim et al. [4] (Figure 2(b)), Li and Ouyang [30] (Figure 2(c)), and Cui, Ouyang, and Shen [27] (Figure 2(d)) transform the specific target area to a regular geometric plane graphics approximately. As shown in Figures 2(b), 2(c), and 2(d), the regular partition on the target area aims to make the study generalized. If not, as shown in Figure 2(a), although the irregular scheme is more realistic, it still needs to, respectively, calculate the definite integral of the 6 subregions. Accordingly, in essence, it is still a discrete thinking. Obviously, if the amount of subregions increases, the calculation process would be very difficult. Therefore, as a “compromise”, the target area must be regularly divided into a number of subregions with regular geometry to achieve the feasible solution in an infinite homogeneous plane. Obviously, the partition rule of the target area is one of the key issues that impact the optimal solution. In addition, it should be pointed out that due to the low efficiency of the partition in Figure 2(b) and the extra computational complexity in Figures 2(c) and 2(d), the largescale problems are difficult to be solved effectively and efficiently.
(a)
(b)
(c)
(d)
Second, the necessary analysis on the impact of misestimating disruption probability lacks. In fact, the optimal solution may be changed because of market uncertainties or the parameter estimation error, etc. And even all the relevant parameters are known in advance, the supply chain network will still be subjected to disruptions due to the dynamic changing business environment [34]. Therefore, these limitations will restrict the validity of the optimal solution in application.
It is these research gaps that motivate us to conduct this study and form the main contributions of this paper. To address these gaps, this paper will investigate a continuous facility location problem by formulating a stylized reliable facility location model in a continuous plane which divides the demand area as hexagonal grid under the facility disruption scenario. The optimization goal is to minimize the expected total cost on the premise that the supply chain network is not disrupted as a whole under the facility disruption scenario. Further, considering the impact of disruption probability estimation error on the optimal decision, this paper will focus on the further discussion about the disruption probability estimation and the robustness of the model.
3. Model Formulation
In this section, a CA model for the location problem in a continuous plane is formulated in which the demand area is divided as hexagonal grid under the risk of disruptions. As discussed above, the partition of target demand plane in continuous facility location problem is one of the key issues that impact the optimal solution. We draw on the research conclusions in the field of mathematics. According to the “Honeycomb conjecture” [35, 36] and Circlepacking theorem [37, 38], hexagonal partition is an optimal scheme to divide the target plane into a number of subregions of equal area (as shown in Figure 3). More specific, in supply chain facility location context, it means that the distance sum of any demand point in the grid to the center facility is minimal. Furthermore, Drezner and Zemel [39] and Trietsch [40], respectively, proved that hexagonal partition is significantly better than square partition which is better than triangular partition. Therefore, this paper adopts the hexagonal partition as an optimal scheme in addressing continuous facility location problem which is an improvement than previous research.
The following notations will be used throughout the paper:
G: the target region with area of S which subjects to a uniform distribution with a probability density of ρ
q: the facility disruption probability, . Considering the focus on the study, the disruption probability is presented as a given parameter
c: the perunit transportation costs
: the setup cost of reliable facilities
: the setup cost of unreliable facilities,
r: the hardening cost factor of unreliable facility,
: the travel distance between and
In addition, generally, there are three ways to calculate the distance between two points, Euclidean distance, Manhattan distance and Great Circle distance (as shown in Figure 4). Considering the specific situation of the research problem, this study adopts the Manhattan distance, i.e. .
(a)
(b)
The target region G is assumed uniformly distributed with a probability density of ρ. The supply chain decisionmaker seeks to locate a number of facilities to meet all the demand with considering random facility disruptions. Consistent with the study of Snyder and Daskin [18], two types of facilities are designed in this paper: reliable facilities, which are not subject to disruption risk by additional hardening cost input and unreliable facilities, which are subject to disruption risk, where the setup cost . To satisfy the whole target region, each subregion would be served by a reliable/ unreliable facility initially, where 1q is the probability that the facility works availably. If an initial allocated unreliable facility in a subregion fails, there is a closest reliable facility as a backup to serve its demands. In addition, we assume the reliable facilities have no capacity constraints and the decisionmakers are riskneutral in this study. Therefore, we model the objective function as follows:
The objective of the model is to find solutions that minimize the expected total cost (TC) of locating reliable facilities, unreliable facilities, and the expected transportation cost between facilities and demands.
Consider a hexagonal subregion with area in the whole service region that is large enough. Moreover, this paper argues that the transportation cost of the central part of a subregion to its assigned facility could be ignored since its closeness. As shown in Figure 5(a), the side length of hexagon is supposed as to make the calculation convenient. Accordingly, the whole demand region G can also be approximated as a hexagon with side length of . Thus, the area of the hexagon is , where the shaded part of is the central area that the transportation cost is ignored. The graphical representation is shown in a Cartesian coordinate system (Figure 5(a)).
(a)
(b)
Accordingly, the expected distance between the central facility in a subregion and demands can be expressed according to Figure 4(a).
F(x) is a cumulative distribution function of D and is the probability density function. More specifically, denotes the ratio of the shaded part to the whole hexagon area; i.e., .
Furthermore, suppose that is serviced by facilities and each facility covered a demand area of which means the subregion is divided further as honeycomb grid as shown in Figure 5(b). Each subregion is a separated service area and is allocated with one reliable/unreliable facility, and the facilities make a set of facilities. We assume only one reliable facility in the facility set. Accordingly, considering the reliable facility does not fail as designed above, the optimal location decision is to locate the reliable facility in the center of which is surrounded by unreliable ones. Thus, each subregion will be served by a facility as its primary assignment and by the reliable facility from the center as an emergency backup when one or some of the unreliable facilities disrupted.
Based on formula (2), in each grid, if its own initial facility is available, the expected distance between facility and demands is , while when an unreliable facility fails, the random distance between its demand and the adjacent reliable facility is D_{R}. Therefore, the expected distance between the central reliable facility and the demands of adjacent grid which is severed by unreliable facilities initially expressed as E[D_{R}]. So, . This implies that
Furthermore, as discussed above, the whole service area G comprises numerous continuously distributed regular subregions . Obviously, it is an optimal partition to an infinite area; but to a finite area, the partition would only be an approximate optimal solution due to its specific shape. Therefore, the whole area is divided into hexagonal subregions, and there are reliable facilities and unreliable facilities in total.
In each set of subregions as shown in Figure 5(b), the expected distance between facility and demands is . So the expected transportation costs of satisfying the whole service region when all the unreliable facilities disrupted are the expected transportation costs for serving the whole service region by reliable facilities, . Accordingly, the expected transportation costs for serving the whole region G are
Furthermore, according to our network design, there is one reliable facility corresponding to unreliable facilities. So, it means that each grid with a reliable facility is surrounded by grids with unreliable facilities.
Set , . Therefore, could be derived from formula (3):
Further, we derive the expected total cost by combining of the facility setup cost and the expected transportation cost:
Thus, the following equation can be obtained by necessary algebra processing:
where is a constant.
The objective function is to minimize the expected total cost. As a consequence, the optimal quantity of reliable and unreliable facilities when the expected total cost is minimized and can be obtained by derivative of formula (7):
Then, .
Since , the optimal solution is expressed as follows.
When , the optimal result is (8); and when , the optimal solution is deploying reliable facilities only or hardening all unreliable facilities to reliable ones; i.e.,
Therefore, the optimal solution of the problem is described as follows.
The disruption probability threshold divides supply chain network design into two situations: when , both types of facilities should be deployed as formula (8) stated; when , the optimal solution is deploying reliable facilities only or hardening all unreliable facilities to reliable ones as formula (9) stated.
According to the optimal solution, the threshold q_{th} will approach zero when the value of approaches . It indicates that if the supply chain facilities disruption probability is large or the incremental hardening cost of unreliable facilities is relatively small, the best choice is to deploy reliable facilities only whereas, if the disruption probability is relatively small or the hardening cost of unreliable facilities is large, both types of facilities should be deployed.
It is important to note that all the demands should be fully satisfied as a prerequisite in this paper which means the supply chain network as a whole is not disrupted in virtue of the reliable facilities. Therefore, the situation of all facilities is unreliable and is beyond the scope of this study.
By substituting formulas (8) and (9) into (7), the optimal expected total cost is obtained:
4. Numerical Studies
4.1. The Optimal Numerical Solution
The goal of this section is to show the performance of the CA model for a reliable facility location problem in a continuous service plane by a numerical experiment.
Consider a demand region G is 150,000 km^{2} which uniformly distributed with a density of ρ= 300; the setup costs of the reliable and unreliable facilities are and respectively; the perunit transportation costs c = 0.75; and the facilities disruption probability q = 0.05.
Therefore, the optimal numerical solution is shown in Table 1.

It should be highlighted that the disruption probability is usually assumed accurately estimated in the literature on reliable facility location but lacked the discussion on misestimating the disruption probability. However, as discussed above, the business environmental uncertainty or misestimating the disruption probability would significantly impact the optimal solution. Therefore, this paper argues that it is essential to analyze the impact of misestimating the disruption probability to improve the robustness of the model.
4.2. Sensitivity Analysis on the Model
Firstly, sensitivity analysis on the model, i.e., the sensitivity of the optimal solution , to the disruption probability q is addressed.
Based on formula (8), , and their derivations of q are as follows: , .
Obviously, , . The sensitivity of , to q depends on the value of , , and q. Then the sensitivity analysis of the numerical example is shown in Table 2.

The result indicates that when q is small (e.g., ), is relatively sensitive to q, while is not sensitive to q. In consequence, when q is small, the total quantity of facilities is relatively stable and the quantity of reliable facilities will vary with q significantly.
Then there is the further investigation on the key parameters. This paper will discuss how the disruption probability q and the facility hardening cost factor r impact the expected total cost and the quantities of the two kinds of facilities, i.e., keeping and c fixed as usual, changing q from 0.01 to 0.5, and changing r from 1.25 to 2 (1.25, 1.5, 1.75, 2). The results are shown in Tables 3–5.


Table 3 illustrates the changing of the expected total cost with q and r. It is obvious that when q is small, the amount of facilities is relatively sensitive to q; when q is large, all facilities should be hardened to reliable facilities. So, the value of E[TC] will keep stable when q increases to a certain extent, and the value of E[TC] will also increase with r.
Tables 4 and 5 illustrate the relationship of the facility quantities with q and r. As Table 4 shows, the quantity of reliable facility will increase with q, while it will decrease with r. Meanwhile, Table 5 indicates the quantity of unreliable facility will decrease with q, while it will decrease with r. More specific, all the unreliable facilities will be upgraded to reliable ones when q increases to a certain degree.
In other words, Tables 4 and 5 show that both kinds of facilities will be deployed when the disruption probability is lower than the threshold q_{th}. Nevertheless, when the disruption probability is higher than the threshold q_{th}, only the reliable facilities will be deployed. It indicates that misestimating disruption probability will considerably impact the supply chain network design, especially when the disruption probability is small. Therefore, in the following section, how the misestimation of disruption probability affects the expected total cost will be studied.
4.3. Robustness Analysis on the Model
The robustness analysis aims to investigate the impact of misestimating the disruption probability on the optimal solution. Due to the lack of historical data on disruptions and the continuous emerging of new disruption incidents, it is almost impossible to estimate the disruption probability accurately in practice. Therefore, robustness analysis on the model should be introduced to address the misestimation of disruption probability. In addition, the faulttolerant ability of the model should also be investigated by robustness analysis to examine the practicability of the model.
Since the misestimation of disruption probability affects the expected total cost, the absolute and relative difference of the expected total cost when r=1.5 (Figure 6) will be discussed first, where q is the true disruption probability and is the estimated disruption probability, so is the estimation error and is the estimation error rate of q (as shown in Figure 6).
(a)
(b)
Comparing Figures 6(a) and 6(b), although the misestimation of disruption probability will affect the supply chain network design significantly, the estimation error of q would have a slight impact on the expected total cost. For instance, when we estimate the disruption probability while the true disruption probability is q=0.05, although it will dramatically change the optimal quantity of facilities, the impact on the expected total cost is less than 7%. And as shown in Figure 6(b), when the relative estimation error is 50%, its impact on the expected total cost is even less than 3%. And the different combinations of q and are showed in Table 6 in which the expected total cost will significantly change with r.

The above analysis indicates that although the estimated disruption probability has a substantial impact on the facilities configuration, the impact on the total amount of facilities and the expected total cost is very minor; i.e., it shows strong robustness of this model. Furthermore, according to Figures 6(a) and 6(b), the impact of misestimation of q is relatively large while the true q is small. On the contrary, the impact will be reduced with the increase of q. When , e.g., q_{th} =0.2, the changes of q will not impact the total cost anymore since all the facilities have been hardened to be reliable ones.
In addition, although the above discussion indicates the robustness of the model to the misestimation of q, the misestimation interval will increase with the disruption probability. Therefore, it is particularly necessary to study the solving performance of the model in the worstcase setting. As shown in Figure 7, the difference ratio of expected total cost will be less than 12% when r=1.25 and the misestimation of disruption probability is . The bottom diagonal means there is no misestimation error.
Furthermore, based on the comparison of Figures 6 and 7, this paper finds that the expected total cost difference caused by the underestimation of disruption probability is considerably higher than that of the equal overestimation. Therefore, this finding supports the viewpoint of this study: the supply chain designers should moderately overestimate the facility disruption risk based on the “pessimistic principle”. Although this policy will make the number of reliable facilities increase to a certain extent, the total number of facilities is relatively stable.
5. Discussion and Conclusion
This paper investigates a continuous reliable facility location problem under facility disruption risk and presents a stylized reliable facility location model in a continuous plane. Drawing from Honeycomb conjecture, this paper proposes a new research approach that divides the target service area as the hexagonal grid to deal with spatial continuous facility location problem. This paper argues that it is an optimal scheme in addressing continuous facility location problem and an improvement compared to previous research. In addition, considering the disruption probability estimation error, the impact of misestimating the disruption probability on optimal decisions is also examined by sensitivity analysis and robustness analysis in this paper. Based on the findings, some managerial insights are summarized for supply chain designers.
(1) When the disruption probability q is large enough, the supply chain designers should upgrade all the facilities to the reliable ones with additional hardening investment. Contrarily, when the disruption probability q is small, both types of facilities should be deployed. So, the disruption probability threshold q_{th} is derived. It indicates that q_{th} is only related to the cost value of the two types of facilities, but not the disruption probability q.
(2) When the disruption probability q is relatively small, the expected total cost is not sensitive to the changes of disruption probability. Therefore, the misestimation to a certain extent is acceptable. More specifically, only if the unreliable facility hardening cost factor r and the estimation error of disruption probability are not too large, the misestimation of disruption probability just influences the expected total cost slightly. Thus, the validity of the model is further proved.
(3) The expected total cost difference caused by the underestimation of disruption probability is considerably higher than that of the equal overestimation. It means the supply chain designers should moderately overestimate the disruption risk based on the “pessimistic principle”. Therefore, taking all the demands are fully satisfied as a prerequisite, i.e., the supply chain undisrupted as a whole, although this policy will make the number of reliable facilities increases to a certain extent, the total number of facilities is relatively stable. This principle is more practicable and meaningful in actual decisionmaking.
More specific, this study is an extension of our previous work [41] which left some questions unaddressed. To bridge the gaps, this study carried on a thorough and comprehensive investigation, and the primary differences between two works are summarized as follows: (1) In the previous study, there is a lacking systematic theoretical discussion and literature review about the facility location problem. Without this knowledge, it is difficult to understand the theoretical connections and evolutionary processes about the location problem from the classical Weber problem (1909) [20, 21] to the topic of this paper, i.e., continuous location problem. To our knowledge, at this point, it is understudied in academia. To address this call, this paper presents a detailed theoretical discussion about the classification on location problems (e.g., [18, 24–29]) and outlines a clear logic about it in Figure 1. This part of work provides strong theoretical supports for our study. (2) To make the study more rigorous, in part 3, we add the discussion about the Euclidean distance, Manhattan distance, and Great circle distance which are shown in Figure 4. This adding and improvement lays a strong research basis to this study. (3) This research proposes a continuous approximation approach based on regular hexagon partition to address the reliable facility location problems under disruptions risk. As discussed in this paper, the partition of target demand plane in continuous facility location problem is one of the key factors that affect the optimal solution. Based on the conclusions in the field of mathematics, this paper argues that the hexagonal partition is optimal scheme in addressing continuous facility location problem which is an improvement. To make the approach more reliable and more scientific, this paper discussed its optimality and literature basis. According to the “Honeycomb conjecture” [35, 36] and Circlepacking theorem [37, 38], hexagonal partition is an optimal scheme to divide the target plane into regions of equal area (as shown in Figure 3). Furthermore, Drezner and Zemel [39] and Trietsch [40], respectively, proved that hexagonal partition is significantly better than square partition which is better than triangular partition. Nevertheless, there is lacking appropriate discussion on this issue in our last paper as an unaddressed problem. (4) In this paper, we further studied the sensitivity of expected total cost, reliable facility quantity, and unreliable facility quantity by adding Tables 3, 4, and 5 to describe their changings with different q and r. Furthermore, in order to make the analysis more comprehensive, we consider more situations with different parameter. Based on these outcomes we comprehensively describe the different ratio of expected total cost caused by estimation error of q and present the corresponding result interpretation. Comparing with the last paper, this is a remarkable improvement and makes the analysis of this paper more sufficient.
Our findings bring up new questions and motivate promising future research. First, partial failure of a facility that makes a facility partially reliable is not considered in this paper. Second, this paper supposes the disruption probability of unreliable facilities is random and independent. Last, capacity limits are not considered in this paper based on the classical UFLP. These questions are beyond the scope of our paper and are left for future research.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Acknowledgments
This work was supported by the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (Project no. 16YJC630116).
References
 A. Baghalian, S. Rezapour, and R. Z. Farahani, “Robust supply chain network design with service level against disruptions and demand uncertainties: a reallife case,” European Journal of Operational Research, vol. 227, no. 1, pp. 199–215, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 D. M. Lambert and M. C. Cooper, “Issues in supply chain management,” Industrial Marketing Management, vol. 29, no. 1, pp. 65–83, 2000. View at: Publisher Site  Google Scholar
 A. Banyai, T. Banyai, and B. Illes, “Optimization of consignmentstorebased supply chain with black hole algorithm,” Complexity, vol. 2017, Article ID 6038973, 12 pages, 2017. View at: Publisher Site  Google Scholar
 M. K. Lim, A. Bassamboo, S. Chopra, and M. S. Daskin, “Facility location decisions with random disruptions and imperfect estimation,” Manufacturing and Service Operations Management, vol. 15, no. 2, pp. 239–249, 2013. View at: Publisher Site  Google Scholar
 S. Chopra and M. S. Sodhi, “Reducing the risk of supply chain disruptions,” MIT Sloan Management Review, vol. 55, no. 3, pp. 73–80, 2014. View at: Google Scholar
 L. V. Snyder, Z. Atan, P. Peng, Y. Rong, A. J. Schmitt, and B. Sinsoysal, “OR/MS models for supply chain disruptions: a review,” IIE Transactions, vol. 48, no. 2, pp. 89–109, 2016. View at: Publisher Site  Google Scholar
 İ. Akgün, F. Gümüşbuğa, and B. Tansel, “Risk based facility location by using fault tree analysis in disaster management,” Omega , vol. 52, pp. 168–179, 2015. View at: Publisher Site  Google Scholar
 R. Z. Farahani, S. Fallah, R. Ruiz, S. Hosseini, and N. Asgari, “OR models in urban service facility location: a critical review of applications and future developments,” European Journal of Operational Research, 2018, In press. View at: Publisher Site  Google Scholar
 M. T. Melo, S. Nickel, and F. SaldanhadaGama, “Facility location and supply chain management—a review,” European Journal of Operational Research, vol. 196, no. 2, pp. 401–412, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 X. Wang and Y. Ouyang, “A continuum approximation approach to competitive facility location design under facility disruption risks,” Transportation Research Part B: Methodological, vol. 50, pp. 90–103, 2013. View at: Publisher Site  Google Scholar
 L. Qi, Z.J. M. Shen, and L. V. Snyder, “The effect of supply disruptions on supply chain design decisions,” Transportation Science, vol. 44, no. 2, pp. 274–289, 2010. View at: Publisher Site  Google Scholar
 P. R. Kleindorfer and G. H. Saad, “Managing disruption risks in supply chains,” Production Engineering Research and Development, vol. 14, no. 1, pp. 53–68, 2005. View at: Google Scholar
 S. Chopra and M. S. Sodhi, “Managing risk to avoid: supplychain breakdown,” MIT Sloan Management Review, vol. 46, no. 1, pp. 53–61, 2004. View at: Google Scholar
 B. Tomlin, “On the value of mitigation and contingency strategies for managing supply chain disruption risks,” Management Science, vol. 52, no. 5, pp. 639–657, 2006. View at: Publisher Site  Google Scholar
 P. Trkman and K. McCormack, “Supply chain risk in turbulent environments—a conceptual model for managing supply chain network risk,” International Journal of Production Economics, vol. 119, no. 2, pp. 247–258, 2009. View at: Publisher Site  Google Scholar
 S. M. Wagner and N. Neshat, “Assessing the vulnerability of supply chains using graph theory,” International Journal of Production Economics, vol. 126, no. 1, pp. 121–129, 2010. View at: Publisher Site  Google Scholar
 C. S. Tang, “Robust strategies for mitigating supply chain disruptions,” International Journal of Logistics Research and Applications, vol. 9, no. 1, pp. 33–45, 2007. View at: Publisher Site  Google Scholar
 L. V. Snyder and M. S. Daskin, “Reliability models for facility location: the expected failure cost case,” Transportation Science, vol. 39, no. 3, pp. 400–416, 2005. View at: Publisher Site  Google Scholar
 T. Sawik, “On the fair optimization of cost and customer service level in a supply chain under disruption risks,” Omega , vol. 53, pp. 58–66, 2015. View at: Publisher Site  Google Scholar
 G. Wesolowsky, “The weber problem: history and perspectives,” Location Science, vol. 1, no. 1, pp. 5–23, 1993. View at: Google Scholar
 C. S. Revelle and H. A. Eiselt, “Location analysis: A synthesis and survey,” European Journal of Operational Research, vol. 165, no. 1, pp. 1–19, 2005. View at: Publisher Site  Google Scholar
 T. S. Hale and C. R. Moberg, “Location science research: a review,” Annals of Operations Research, vol. 123, no. 1, pp. 21–35, 2003. View at: Publisher Site  Google Scholar  MathSciNet
 AMS, “Mathematics Subject Classification (MSC),” 2000, http://www.emis.de/MSC2000/. View at: Google Scholar
 Z. J. M. Shen, “Reliable facility location design under the risk of disruptions,” Operations research, vol. 58, no. 4, part 4, pp. 998–1011, 2010. View at: Google Scholar
 M. Lu, L. Ran, and Z.J. M. Shen, “Reliable facility location design under uncertain correlated disruptions,” Manufacturing and Service Operations Management, vol. 17, no. 4, pp. 445–455, 2015. View at: Publisher Site  Google Scholar
 S. Basu, M. Sharma, and P. S. Ghosh, “Metaheuristic applications on discrete facility location problems: a survey,” Opsearch, vol. 52, no. 3, pp. 530–561, 2015. View at: Publisher Site  Google Scholar
 T. Cui, Y. Ouyang, and Z.J. M. Shen, “Reliable facility location design under the risk of disruptions,” Operations Research, vol. 58, no. 4, part 1, pp. 998–1011, 2010. View at: Publisher Site  Google Scholar
 X. Wang, M. K. Lim, and Y. Ouyang, “A continuum approximation approach to the dynamic facility location problem in a growing market,” Transportation Science, vol. 51, no. 1, pp. 343–357, 2017. View at: Publisher Site  Google Scholar
 Y.C. Tsao, D. Mangotra, J.C. Lu, and M. Dong, “A continuous approximation approach for the integrated facilityinventory allocation problem,” European Journal of Operational Research, vol. 222, no. 2, pp. 216–228, 2012. View at: Publisher Site  Google Scholar
 X. Li and Y. Ouyang, “A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions,” Transportation Research Part B: Methodological, vol. 44, no. 4, pp. 535–548, 2010. View at: Publisher Site  Google Scholar
 Y. Ouyang and C. F. Daganzo, “Discretization and validation of the continuum approximation scheme for terminal system design,” Transportation Science, vol. 40, no. 1, pp. 89–98, 2006. View at: Publisher Site  Google Scholar
 M. S. Jabalameli, S. J. Hosseininezhad, and S. G. Jalali Naini, “A risk management model for the plant location problem,” International Journal of Management Science and Engineering Management, vol. 8, no. 2, pp. 93–101, 2013. View at: Google Scholar
 A. G. N. Novaes, J. E. Souza de Cursi, A. C. L. da Silva, and J. C. Souza, “Solving continuous locationdistricting problems with Voronoi diagrams,” Computers & Operations Research, vol. 36, no. 1, pp. 40–59, 2009. View at: Publisher Site  Google Scholar
 R. De Caux, C. Smith, D. Kniveton, R. Black, and A. Philippides, “Dynamic, smallworld social network generation through local agent interactions,” Complexity, vol. 19, no. 6, pp. 44–53, 2014. View at: Publisher Site  Google Scholar
 T. C. Hales, “The honeycomb conjecture,” Discrete & Computational Geometry, vol. 25, no. 1, pp. 1–22, 2001. View at: Publisher Site  Google Scholar  MathSciNet
 F. Morgan, “The hexagonal honeycomb conjecture,” Transactions of the American Mathematical Society, vol. 351, no. 5, pp. 1753–1763, 1999. View at: Publisher Site  Google Scholar  MathSciNet
 K. Stephenson, Introduction to Circle Packing: The Theory of Discrete Analytic Functions, Cambridge University Press, 2005. View at: MathSciNet
 C. R. Collins and K. Stephenson, “A circle packing algorithm,” Computational Geometry, vol. 25, no. 3, pp. 233–256, 2003. View at: Publisher Site  Google Scholar
 Z. Drezner and E. Zemel, “Competitive location in the plane,” Annals of Operations Research, vol. 40, no. 1, pp. 173–193, 1992. View at: Publisher Site  Google Scholar
 D. Trietsch, “Optimal multifacility defensive location on planes with rectilinear distances,” Networks, vol. 23, no. 6, pp. 517–523, 1993. View at: Publisher Site  Google Scholar  MathSciNet
 J. Wang and Y. Wu, “An improved voronoidiagrambased algorithm for continuous facility location problem under disruptions,” Sustainability, vol. 10, p. 3099, 2018. View at: Google Scholar
Copyright
Copyright © 2019 Jiguang Wang and Yucai Wu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.