Location of a facility minimizing nuisance to or from a planar network

Authors:
Tammy Drezner;Zvi Drezner;Carlton H. Scott
Affiliations:
College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, USA;College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, USA;Paul Merage School of Business, University of California-Irvine, Irvine, CA 92697, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 0

Introduction to numerical analysis: 2nd edition

Introduction to numerical analysis: 2nd edition
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
Locating An Undesirable Facility by Generalized Cutting Planes

Mathematics of Operations Research
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

Operations Research
A General Global Optimization Approach for Solving Location Problems in the Plane

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we investigate the location of a facility anywhere inside a planar network. Two equivalent problems are analyzed. In one problem it is assumed that the links of the network create a nuisance or hazard and the objective is to locate a facility where the total nuisance is minimized. An equivalent problem is locating an obnoxious facility where the total nuisance generated by the facility and inflicted on the links of the network is minimized. Exact and approximate solution methods for its solution are proposed and tested on a set of planar networks with up to 40,000 links yielding good results.