Solving k-obnoxious facility location problem on a plane
نویسندگان
چکیده
منابع مشابه
Algorithm for Obnoxious Facility Location Problem
This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...
متن کاملA Multi-Objective Obnoxious Facility Location Modelon a Plane
In this paper a Vertex Covering Obnoxious Facility Location model on a Plane has been designed with a combination of three interacting criteria as follows: 1) Minimize the overall importance of the various existing facility points; 2) Maximize the minimum distance from the facility to be located to the existing facility points; 3) Maximize the number of existing facility points covered. Area re...
متن کاملSolving Facility Location Problem on Cluster Computing
Computation of facility location problem for every location in the country is not easy simultaneously. Solving the problem is described by using cluster computing. A technique is to design parallel algorithm by using local search with single swap method in order to solve that problem on clusters. Parallel implementation is done by the use of portable parallel programming, Message Passing Interf...
متن کاملStrategy-Proof Mechanism for Obnoxious Facility Location on a Line
In the problem of obnoxious facility location, an obnoxious facility is located in an area. To maximize the social welfare, e.g., the sum of distances from all the agents to the facility, we have to get the true locations of each agent. However, each agent may misreport his/her location to stay far away from the obnoxious facility. In this paper, we design strategy-proof mechanisms on locating ...
متن کاملOn Some Optimization Problems in Obnoxious Facility Location
In this paper we study the following general MaxMinoptimization problem concerning undesirable (obnoxious) facility location: Given a set of n sites S inside a convex region P , construct m garbage deposit sites Vm such that the minimum distance between these sites Vm and the union of S and Vm, Vm∪S, is maximized. We present a general method using Voronoi diagrams to approximately solve two suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Management
سال: 2018
ISSN: 2578-1944
DOI: 10.24294/tm.v1i2.605