Optimizing fire station locations for the Istanbul metropolitan municipality

Copyright @ 2013 INFORMSThe Istanbul Metropolitan Municipality (IMM) seeks to determine locations for additional fire stations to build in Istanbul; its objective is to make residences and historic sites reachable by emergency vehicles within five minutes of a fire station’s receipt of a service request. In this paper, we discuss our development of a mathematical model to aid IMM in determining these locations by using data retrieved from its fire incident records. We use a geographic information system to implement the model on Istanbul’s road network, and solve two location models—set-covering and maximal-covering—as what-if scenarios. We discuss 10 scenarios, including the situation that existed when we initiated the project and the scenario that IMM implemented. The scenario implemented increases the city’s fire station coverage from 58.6 percent to 85.9 percent, based on a five-minute response time, with an implementation plan that spans three years

Optimizing fire station locations for the Istanbul metropolitan municipality

Copyright @ 2013 INFORMSThe Istanbul Metropolitan Municipality (IMM) seeks to determine locations for additional fire stations to build in Istanbul; its objective is to make residences and historic sites reachable by emergency vehicles within five minutes of a fire station’s receipt of a service request. In this paper, we discuss our development of a mathematical model to aid IMM in determining these locations by using data retrieved from its fire incident records. We use a geographic information system to implement the model on Istanbul’s road network, and solve two location models—set-covering and maximal-covering—as what-if scenarios. We discuss 10 scenarios, including the situation that existed when we initiated the project and the scenario that IMM implemented. The scenario implemented increases the city’s fire station coverage from 58.6 percent to 85.9 percent, based on a five-minute response time, with an implementation plan that spans three years

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

Coverage reduction: a mathematical model

This paper deals with a mathematical model for reduction of the lack of coverage (LC) involving multiple coverage in presence of partial covering. The model proposes a new structure of assignment of facilities in a facility location system to cover in greater proportion of the demand territory, avoiding assignment of several facilities in the same space of the territory. A comparison between the engendered solution and its representation is carried out through known indicators to measure the improvement of the solution. The results of our proposed model are contrast and better compared to defined referred models in order to evaluate the reduction of LC

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 importance of market size in the consumer service professional football: the Belgian case

The problem with Belgian football competition is that in the long run, and as reality shows us in the short term, the contemporary situation will lead to market failures and the elimination of some of the clubs. The solution proposed in this paper is the creation of a new professional competition with fewer teams combined with territorial exclusivity in a centre with a potential number of consumers that reach a certain absolute or relative threshold.sports economics, soccer

An efficient genetic algorithm for large-scale planning of robust industrial wireless networks

An industrial indoor environment is harsh for wireless communications compared to an office environment, because the prevalent metal easily causes shadowing effects and affects the availability of an industrial wireless local area network (IWLAN). On the one hand, it is costly, time-consuming, and ineffective to perform trial-and-error manual deployment of wireless nodes. On the other hand, the existing wireless planning tools only focus on office environments such that it is hard to plan IWLANs due to the larger problem size and the deployed IWLANs are vulnerable to prevalent shadowing effects in harsh industrial indoor environments. To fill this gap, this paper proposes an overdimensioning model and a genetic algorithm based over-dimensioning (GAOD) algorithm for deploying large-scale robust IWLANs. As a progress beyond the state-of-the-art wireless planning, two full coverage layers are created. The second coverage layer serves as redundancy in case of shadowing. Meanwhile, the deployment cost is reduced by minimizing the number of access points (APs); the hard constraint of minimal inter-AP spatial paration avoids multiple APs covering the same area to be simultaneously shadowed by the same obstacle. The computation time and occupied memory are dedicatedly considered in the design of GAOD for large-scale optimization. A greedy heuristic based over-dimensioning (GHOD) algorithm and a random OD algorithm are taken as benchmarks. In two vehicle manufacturers with a small and large indoor environment, GAOD outperformed GHOD with up to 20% less APs, while GHOD outputted up to 25% less APs than a random OD algorithm. Furthermore, the effectiveness of this model and GAOD was experimentally validated with a real deployment system

Comparison of Emergency Medical Services Delivery Performance using Maximal Covering Location and Gradual Cover Location Problems

Ambulance location is one of the critical factors that determine the efficiency of emergency medical services delivery. Maximal Covering Location Problem is one of the widely used ambulance location models. However, its coverage function is considered unrealistic because of its ability to abruptly change from fully covered to uncovered. On the contrary, Gradual Cover Location Problem coverage is considered more realistic compared to Maximal Cover Location Problem because the coverage decreases over distance. This paper examines the delivery of Emergency Medical Services under the models of Maximal Covering Location Problem and Gradual Cover Location Problem. The results show that the latter model is superior, especially when the Maximal Covering Location Problem has been deemed fully covered

Detecting Repetitions and Periodicities in Proteins by Tiling the Structural Space

The notion of energy landscapes provides conceptual tools for understanding the complexities of protein folding and function. Energy Landscape Theory indicates that it is much easier to find sequences that satisfy the "Principle of Minimal Frustration" when the folded structure is symmetric (Wolynes, P. G. Symmetry and the Energy Landscapes of Biomolecules. Proc. Natl. Acad. Sci. U.S.A. 1996, 93, 14249-14255). Similarly, repeats and structural mosaics may be fundamentally related to landscapes with multiple embedded funnels. Here we present analytical tools to detect and compare structural repetitions in protein molecules. By an exhaustive analysis of the distribution of structural repeats using a robust metric we define those portions of a protein molecule that best describe the overall structure as a tessellation of basic units. The patterns produced by such tessellations provide intuitive representations of the repeating regions and their association towards higher order arrangements. We find that some protein architectures can be described as nearly periodic, while in others clear separations between repetitions exist. Since the method is independent of amino acid sequence information we can identify structural units that can be encoded by a variety of distinct amino acid sequences