scholarly journals The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Omega ◽  
2019 ◽  
Vol 87 ◽  
pp. 105-116 ◽  
Author(s):  
Zvi Drezner ◽  
Pawel Kalczynski ◽  
Said Salhi
1981 ◽  
Vol 32 (9) ◽  
pp. 803 ◽  
Author(s):  
J. Karkazis ◽  
T. B. Boffey

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.


2014 ◽  
Vol 8 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Zixue Guo ◽  
Meiran Qi

The emergency service facilities location is one of the most important issues in the emergency management. This study focused on the location set covering problem (LSCP) for emergency service facilities under fuzzy environment. On the basis of defining the signed distance of trapezoidal fuzzy number, the ranking rules of trapezoidal fuzzy number are defined, the model of emergency service facilities location with fuzzy restraints is proposed, and the solution algorithm for the emergency service location based on the ordering rules of trapezoidal fuzzy number is given. Finally, a numerical simulation is used to illustrate the application of the method, which shows that the algorithm is feasible and advantageous.


2002 ◽  
Vol 142 (1) ◽  
pp. 138-151 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner ◽  
Said Salhi

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Dandan Hu ◽  
Zhi-Wei Liu ◽  
Wenshan Hu

In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.


2015 ◽  
Vol 744-746 ◽  
pp. 1745-1748 ◽  
Author(s):  
Qing Zhen Sun ◽  
Yan Jia ◽  
Xiao Ying Hou ◽  
Peng Li

In order to solve the location problem of the city disaster emergency rescue facilities, it applied the multi-objective decision method to resolve the problem. Firstly it described the types of emergency facilities in the city and proposed the basic principles of the location decision. Then it analyzed the four factors of the location decision, and it established the multi-objective decision model of the emergency rescue facilities location, which based on the integration of traditional location models. And then it used the linear weighted sum law to solve the model, and can readjust the weights of the goals to reach the satisfying plan. Finally, it applied the model to solve the emergency shelter location problem of the new area in the Zhengzhou. The result shows the feasibility and the effectiveness of the model which used the multi-objective decision method to solve the location problem of the city disaster emergency rescue facilities.


2020 ◽  
Vol 52 (12) ◽  
pp. 1403-1412 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner ◽  
Pawel Kalczynski

1981 ◽  
Vol 32 (9) ◽  
pp. 803-814 ◽  
Author(s):  
J. Karkazis ◽  
T. B. Boffey

Sign in / Sign up

Export Citation Format

Share Document