A mathematical model for locating k-obnoxious facilities on a plane

U.K. Bhattacharya

International Journal of Operational Research, 2018, vol. 31, issue 3, 384-402

Abstract: This paper proposes a new mathematical model for locating k-obnoxious facilities Here a vertex covering k-obnoxious facilities location problem on a plane has been modelled by combining it as a combination of three interacting criteria as follows: 1) maximise the minimum distances between any existing point and any variable point as well as between any pair of variable points; 2) maximise the number of existing points covered by various respective variable points; 3) minimise the overall importance of the various existing points associated to the various variable facility points. A nonlinear programming iterative algorithm for locating k-obnoxious facilities has been developed. The algorithm developed here is a generalised iterative algorithm. It has been proved that the optimal solution obtained by the algorithm is the non-dominated solution of the original multi-objective problem. Rectilinear distance norm has been considered as the distance measure as it is more appropriate to the various realistic situations.

Keywords: multiple-criteria analysis; obnoxious facility location; utility approach; non-dominated solution. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=89738 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:31:y:2018:i:3:p:384-402

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().