We consider the problem of locating a facility in the plane. Customers want the facility to be close to obtain cheaply the service offered by it. But customers also want the facility to be far away to avoid the pollution from it. We model the situation using two criteria: One is the well-known minis
On locating a semi-desirable facility on the continuous plane
β Scribed by Jack Brimberg; Henrik Juel
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 172 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0969-6016
No coin nor oath required. For personal study only.
β¦ Synopsis
The paper considers a bicriteria model for locating a semi-desirable facility on the plane. One criterion is that of minimizing the sum of weighted distances between customers and facility, where distances are given by an arbitrary norm. The other criterion is that of maximizing the weighted Euclidean distance from the facility to the closest customer. The objective is to generate the set of ecient points, from which the decision maker must choose the preferred one. Two reformulations are considered: in one, the sum of weighted distances is minimized, subject to constraints requiring that each customer must have a weighted Euclidean distance to the facility of at least a given parameter; varying the parameter yields the ecient set. In the other, both criteria are viewed as minimization problems and a convex combination of them is minimized. Properties of the reformulations are given, and the reformulations are compared. Finally, a solution procedure is outlined.
π SIMILAR VOLUMES
This paper considers the problem of locating a central facility on a tree network. The central facility takes the form of a subtree of the network and provides service to several demand points located at the nodes of the network. Two types of costs are involved in evaluating a given facility selecti