𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bicriteria model for locating a semi-desirable facility in the plane

✍ Scribed by Jack Brimberg; Henrik Juel

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
645 KB
Volume
106
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

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 minisum criterion; in the other we want to minimize the weighted sum of Euclidean distances raised to a negative power. The second criterion is analyzed in some detail, and we state some properties of this part of the model. In the bicriteria model we minimize the weighted sum of the two criteria, with weights adding to one. We outline a method for determining the efficient frontier of facility locations, and provide an illustrative numerical example.

πŸ“œ SIMILAR VOLUMES

On locating a semi-desirable facility on
On locating a semi-desirable facility on the continuous plane
✍ Jack Brimberg; Henrik Juel πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

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 Euclide

A general model for the undesirable sing
A general model for the undesirable single facility location problem
✍ J.J. SaameΓ±o RodrΓ­guez; C. Guerrero GarcΓ­a; J. MuΓ±oz PΓ©rez; E. MΓ©rida Casermeiro πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 408 KB

In this paper, a finite set in which an optimal solution for a general Euclidean problem of locating an undesirable facility in a polygonal region, is determined and can be found in polynomial time. The general problem we propose leads us, among others, to several well-known problems such as the max