Author(s)

U. K. Bhattacharya

Indian Institute of Management Indore, Rau, Pigdamber, Indore, Madhya Pradesh 453331, India.

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 exist-ing 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 restriction concept has been incor-porated so that the facility to be located should be within certain restricted area. The model developed here is a class of maximal covering problem, that is covering maximum number of points where the facility is within the upper bounds of the corresponding mth feasible region Two types of compromise solution methods have been designed to get a satisfactory solution of the multi-objective problem. A transformed non- linear programming algorithm has been designed for the proposed non-linear model. Rectilinear dis-tance norm has been considered as the distance measure as it is more appropriate to various realistic situa-tions. A numerical example has been presented to illustrate the solution algorithm.

Obnoxious Facility Location, Multi-objective Decision Making, Maximal Covering Problem

Bhattacharya, U. (2011) A Multi-Objective Obnoxious Facility Location Modelon a Plane. American Journal of Operations Research, 1, 39-45. doi: 10.4236/ajor.2011.12006.