Efficient location for a semi-obnoxious facility

Efficient location for a semi-obnoxious facility

0.00 Avg rating0 Votes
Article ID: iaor20042497
Country: Netherlands
Volume: 123
Issue: 1
Start Page Number: 173
End Page Number: 188
Publication Date: Oct 2003
Journal: Annals of Operations Research
Authors: ,
Keywords: obnoxious facilities
Abstract:

This paper deals with a location model for the placement of a semi-obnoxious facility in a continuous plane with the twin objectives of maximizing the distance to the nearest inhabitant and minimizing the sum of distances to all the users (or the distance to the farthest user) in a unified manner. For special cases, the formulation includes (1) elliptic maximin and rectangular minisum criteria problem, and (2) rectangular maximin and minimax criteria problem. Polynomial-time algorithms for finding the efficient set and the tradeoff curve are presented.

Reviews

Required fields are marked *. Your email address will not be published.