A taxonomy for emergency service station location problem

The emergency service station (ESS) location problem has been widely studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. However, there is not any study that systematically classifies different problem types and methodologies to address them. This paper presents a taxonomic framework for the ESS location problem using an operations research perspective. In this framework, we basically consider the type of the emergency, the objective function, constraints, model assumptions, modeling, and solution techniques. We also analyze a variety of papers related to the literature in order to demonstrate the effectiveness of the taxonomy and to get insights for possible research directions

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

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants

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

Developing dynamic maximal covering location problem considering capacitated facilities and solving it using hill climbing and genetic algorithm

The maximal covering location problem maximizes the total number of demands served within a maximal service distance given a fixed number of facilities or budget constraints. Most research papers have considered this maximal covering location problem in only one period of time. In a dynamic version of maximal covering location problems, finding an optimal location of P facilities in T periods is the main concern. In this paper, by considering the constraints on the minimum or maximum number of facilities in each period and imposing the capacity constraint, a dynamic maximal covering location problem is developed and two related models (A, B) are proposed. Thirty sample problems are generated randomly for testing each model. In addition, Lingo 8.0 is used to find exact solutions, and heuristic and meta-heuristic approaches, such as hill climbing and genetic algorithms, are employed to solve the proposed models. Lingo is able to determine the solution in a reasonable time only for small-size problems. In both models, hill climbing has a good ability to find the objective bound. In model A, the genetic algorithm is superior to hill climbing in terms of computational time. In model B, compared to the genetic algorithm, hill climbing achieves better results in a shorter time

Developing a Tool for the Location Optimization of the Alert Aircraft with Changing Threat Anticipation

The threat to the airspace is posed by the outside world in conventional terms as well as hostilities from within the airspace such as hijacked aircraft. Alert aircraft are located with the sole responsibility of responding to any incident. Different regions of the airspace may have different alert states depending on current intelligence input. Due to non-constant states of threat level, the Turkish Air Force must deploy aircraft to cover the more sensitive regions with a greater number of aircraft with a relatively short response time. This research deals with the problem by developing a tool for the location optimization of the alert aircraft. The tool can adapt to changes in threat anticipation while meeting the objectives of the alert network. Thus, a new location model with backup coverage requirements was formulated, and an interactive tool is developed that is capable of generating the aircraft locations for different user-defined threat anticipation

Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway

Everyone needs to be served, and a service network provides a set of services and/or help to please the people involved. No matter who is the service provider, government or retailer, there always been a clash between them and customers. Service providers are trying their best to serve customers as many as possible with a limitation of cost, while the satisfaction of customer might be neglected at the same time. According to find a balance between objectives of both customers and service providers. Three concepts: Availability, Efficient and Accessibility are proposed in this paper corresponding to three classic facility location mathematical models: set covering location model, maximal covering location, and p-median models. In addition, a real-world case study of postal service network in a city in Northern Norway is included under for the purpose of improving the service performance based on the three concepts mentioned above. Excel Solver is applied for simulating all three covering mathematical model

Developing Capacitated p-median Location-allocation Model in the spopt Library to Allow UCL Student Teacher Placements Using Public Transport

Location-allocation is a key tool within the GIS and network analysis toolbox. In this paper we discuss the real world application of a location-allocation case study (approx 800 students, 500 schools) from UCL using public transport. The use of public transportation is key for this case study, as many location-allocation approaches only make use of drive-time or walking-time distances, but the location of UCL in Greater London, UK makes the inclusion of public transport vital for this case study. The location-allocation is implemented as a capacitated p-median location-allocation model, using the spopt library, part of the Python Spatial Analysis Library (PySAL). The capacitated variation of the p-median location-allocation problem is a new addition to the spopt library, which this work will present. The results from the initial version of the capacitated p-median location-allocation problem has shown a marked improvement on public transport travel time, with public transport travel time reduced by 891 minutes overall for an initial sample of 93 students (9.58 minutes per student). Results will be presented below and plans for further improvement shared