Location models in the public sector

The past four decades have witnessed an explosive growth in the field of networkbased facility location modeling. This is not at all surprising since location policy is one of the most profitable areas of applied systems analysis in regional science and ample theoretical and applied challenges are offered. Location-allocation models seek the location of facilities and/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or several objectives generally related to the efficiency of the system or to the allocation of resources. This paper concerns the location of facilities or services in discrete space or networks, that are related to the public sector, such as emergency services (ambulances, fire stations, and police units), school systems and postal facilities. The paper is structured as follows: first, we will focus on public facility location models that use some type of coverage criterion, with special emphasis in emergency services. The second section will examine models based on the P-Median problem and some of the issues faced by planners when implementing this formulation in real world locational decisions. Finally, the last section will examine new trends in public sector facility location modeling.Location analysis, public facilities, covering models

A regret model applied to the maximum capture location problem

This article addresses issues related to location and allocation problems. Herein, we intend to demonstrate the influence of congestion, through the random number generation, of such systems in final solutions. An algorithm is presented which, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained with regard to its robustness for different scenarios. Taking as our point of departure the Maximum Capture Location Problem proposed by Church and Revelle [1, 26], an alternative perspective is added in which the choice behavior of the server does not depend only on the elapsed time from the demand point looking to the center, but includes also the service waiting time.N/

A regret model applied to the maximum coverage location problem with queue discipline

This article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions. It is presented an algorithm that, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained in regard to its robustness for different scenarios. To the well know Maximum Coverage Location Problem from Church and Revelle [1] an alternative perspective is added in which the choice behavior of the server does not only depend on the elapsed time from the demand point looking to the center, but also includes the waiting time for service conditioned by a waiting queue.N/

A regret model applied to the facility location problem with limited capacity facilities

This article addresses issues related to location and allocation problems. Herein, we intend to demonstrate the influence of congestion, through the random number generation, of such systems in final solutions. An algorithm is presented which, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained with regard to its robustness for different scenarios. Taking as our point of departure the Facility Location Problem proposed by Balinski [27], an alternative perspective is added associating regret values to particular solutions.N/

The SNS logistics network design : location and vehicle routing.

Large-scale emergencies caused by earthquake, tornado, pandemic flu, terrorism attacks and so on can wreak havoc to communities. In order to mitigate the impact of the events, emergency stockpiles of food, water, medicine and other materials have been set up around the US to be delivered to the affected areas during relief operations. One type of stockpile is called the Strategic National Stockpile (SNS). The SNS logistics network is designed to have multiple stages of facilities, each of which is managed by different levels of governmental authorities - federal, state and local authorities. The design of a logistics network for delivery of the SNS materials within a state are explored in this dissertation. There are three major areas of focus in this dissertation: (1) the SNS facility location model, which is used to determine sites for locating Receiving, Staging and Storage (RSS) and Regional Distribution Nodes (RDNs) to form a logistics network to deliver relief material to Points of Demand (PODs), where the materials are directly delivered to the affected population; (2) the SNS Vehicle Routing Problem (VRP), which is used to assist the SNS staff in determining the numbers of various types of trucks, and the routing schedules of each truck to develop an operational plan for delivering the required relief materials to the assigned PODs within the required duration; (3) the location-routing analysis of emergency scenarios, in which the facility location model and the VRP solution are integrated through the use of a computer program to run on several assumed emergency scenarios. Using real data from the department of public health in the Commonwealth of Kentucky, a transshipment and location model is formulated to determine the facility locations and the transshipment quantities of materials; a multiple-vehicle routing model allowing split deliveries and multiple routes per vehicle that must be completed within a required duration is formulated to determine the routing and scheduling of trucks. The facility location model is implemented using Microsoft Solver Foundation and C#. An algorithm combining the Clark and Wright saving algorithm and Simulated Annealing is designed and implemented in C# to solve the VRP. The algorithm can determine whether there is shortage of transportation capacity, and if so, how many of various types of trucks should be added for optimal performance. All the solution algorithms are integrated into a web-based SNS planning tool. In the location-routing analysis of emergency scenarios, a binary location model and an algorithm for solving VRP solution are integrated as a computer program to forecast the feasibility of distribution plans and the numbers of required trucks of various types. The model also compares the costs and benefits of direct and indirect shipment. A large-scale emergency scenario in which a specific type of vaccine is required to be delivered to the entire state of Kentucky is considered. The experiments are designed based on the real data provided by the Kentucky state government. Thus the experimental results provide valuable suggestions for future SNS preparedness planning

Facility location optimization model for emergency humanitarian logistics

Since the 1950s, the number of natural and man-made disasters has increased exponentially and the facility location problem has become the preferred approach for dealing with emergency humanitarian logistical problems. To deal with this challenge, an exact algorithm and a heuristic algorithm have been combined as the main approach to solving this problem. Owing to the importance that an exact algorithm holds with regard to enhancing emergency humanitarian logistical facility location problems, this paper aims to conduct a survey on the facility location problems that are related to emergency humanitarian logistics based on both data modeling types and problem types and to examine the pre- and post-disaster situations with respect to facility location, such as the location of distribution centers, warehouses, shelters, debris removal sites and medical centers. The survey will examine the four main problems highlighted in the literature review: deterministic facility location problems, dynamic facility location problems, stochastic facility location problems, and robust facility location problems. For each problem, facility location type, data modeling type, disaster type, decisions, objectives, constraints, and solution methods will be evaluated and real-world applications and case studies will then be presented. Finally, research gaps will be identified and be addressed in further research studies to develop more effective disaster relief operations

Relief network design problem (RNDP): A scoping review, challenges, and opportunities

The Relief Network Design Problem (RNDP) is particularly important in emergency management. Any uncertain factors caused by natural disasters, the equity measurement in network design, and the adequate analysis of relief behavior will affect the efficiency of the relief network. This paper provides a comprehensive basis to support this view. The scope of the review allowed for exploring all existing literature on RNDP, where screening for titles, abstracts, keywords, and main contents, a total of 629 relevant articles are preserved. To construct the review work, existing research perspectives on the Relief Logistics Network Design Problem (RLNDP) as well as the Relief Transport Network Design Problem (RTNDP) are addressed, and their research focus and main research approaches are discussed. The existing studies on RNDP seem to be reached a bottleneck on how to design a humanitarian relief network. Hence, this paper contributes to the existing body of knowledge by summarizing the literature in the field, identifying gaps, analyzing future challenges, and providing solutions for future research. Specifically, this review reveals that while a large number of studies have considered uncertainty in the network design, they have not considered it at both the management level and the residents' level. In addition, equity is often mentioned, but the definition of humanitarian equity is unclear, as most studies consider equity at the management level. In real disaster relief scenarios, people do not only wait for relief, but self-evacuation is also a main behavior in the relief process, yet there are few studies that consider it in the network design. This review also emphasizes the relief network design structure problem, and the interdependence and coupling of the relief infrastructure transport or logistics facility network with other networks, such as the electric network, energy network, etc., deserves to be focused. In summary, five valuable research highlights are proposed based on a review of the existing literature: (1) Explore uncertainties from both the government management and disaster victim perspectives and integrate them into network design approaches. (2) Define and consider relief equity from both the government management and disaster victim perspectives. (3) Analyze self-evacuation behavior in the emergency relief phase and explore how it affects RNDP. (4) Optimize the transfer point location and relief routing from the perspective of management and humanitarian equity. (5) Strengthen the resilience of disaster relief interdependent network

Hazmats Transportation Network Design Model with Emergency Response under Complex Fuzzy Environment

A bilevel optimization model for a hazardous materials transportation network design is presented which considers an emergency response teams location problem. On the upper level, the authority designs the transportation network to minimize total transportation risk. On the lower level, the carriers first choose their routes so that the total transportation cost is minimized. Then, the emergency response department locates their emergency service units so as to maximize the total weighted arc length covered. In contrast to prior studies, the uncertainty associated with transportation risk has been explicitly considered in the objective function of our mathematical model. Specifically, our research uses a complex fuzzy variable to model transportation risk. An improved artificial bee colony algorithm with priority-based encoding is also applied to search for the optimal solution to the bilevel model. Finally, the efficiency of the proposed model and algorithm is evaluated using a practical case and various computing attributes