Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Location of Multiple Obnoxious Facilities

ZVI DREZNER and GEORGE O. WESOLOWSKY
Transportation Science
Vol. 19, No. 3 (August 1985), pp. 193-202
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/25768175
Page Count: 10
  • More info
  • Cite this Item
Location of Multiple Obnoxious Facilities
Preview not available

Abstract

This problem deals with the location of facilities that are obnoxious in the sense that nearness of the facility to fixed points, which may represent population centers or other installations, is undesirable. Two model formulatons are given. In the first formulation we minimize the maximum weighted distance in the system subject to constraints which require that the distances between the facilities and fixed points must exceed specified values. In the second formulation, the smallest weighted "facility-to-fixed-point" distance in the system must be maximized, given that every fixed point must be within "reach" of the closest facility. Certain useful duality relationships are established between these problems. A one-dimensional problem is solved using an algorithm that incorporates a version of the set covering problem.

Page Thumbnails

  • Thumbnail: Page 
193
    193
  • Thumbnail: Page 
194
    194
  • Thumbnail: Page 
195
    195
  • Thumbnail: Page 
196
    196
  • Thumbnail: Page 
197
    197
  • Thumbnail: Page 
198
    198
  • Thumbnail: Page 
199
    199
  • Thumbnail: Page 
200
    200
  • Thumbnail: Page 
201
    201
  • Thumbnail: Page 
202
    202