نتایج جستجو برای: Backup covering location

تعداد نتایج: 282050  

Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same ti...

2007
Kevin M. Curtin Fang Qiu

This paper presents a new method for determining efficient spatial distributions of police patrol areas. This method employs a traditional maximal covering formulation and an innovative backup covering formulation to provide alternative optimal solutions to police decision makers, and to address the lack of objective quantitative methods for police area design in the literature or in practice. ...

Journal: :journal of optimization in industrial engineering 2010
hassan shavandi

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

Journal: :International Journal of Services and Operations Management 2018

2009
Ayfer Başar Bülent Çatay Tonguç Ünlüyurt

The location planning of emergency service stations is crucial, especially in the populated cities with heavy traffic conditions such as Istanbul. In this paper, we propose a Backup Double Covering Model (BDCM), a variant of the well-known Maximal Covering Location Problem, that requires two types of services to plan the emergency service stations. The objective of the model is to maximize the ...

2007
ELLIOT ANSHELEVICH ADRIANA KARAGIOZOVA

We define a problem called Simplex Matching and show that it is solvable in polynomial time. While Simplex Matching is interesting in its own right as a nontrivial extension of nonbipartite min-cost matching, its main value lies in many (seemingly very different) problems that can be solved using our algorithm. For example, suppose that we are given a graph with terminal nodes, nonterminal node...

Journal: : 2021

İtfaiye istasyonları kentsel alanda can ve mal güvenliğini sağlayan acil hizmet birimleridir. Bu hizmetin ihtiyaca hızlı yanıt verecek şekilde yüksek düzeyi ile sunulması kamu güvenliği açısından çok önemlidir. Ancak, imar mevzuatında itfaiye istasyonlarının planlanmasına yönelik herhangi bir hükme yer verilmediğinden, planlarında uygulamada sayısına, büyüklüklerine konumlarına ilişkin kararlar...

Hamideh Nikzad Jafar Bagherinejad Mahdi Bashiri

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran amir ebrahimi zade hassan hosseininasab department of industrial engineering, yazd university yazd iran

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید