A global optimal approach to facility location in the presence of forbidden regions

Authors:
Ronald G. McGarvey;Tom M. Cavalier
Affiliations:
RAND, 201 N. Craig Street, Pittsburgh, PA;The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 310 Leonhard Building, University Park, PA
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 2
Cited 3

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Determining the minimum-area encasing rectangle for an arbitrary closed curve

Communications of the ACM

Constrained location of competitive facilities in the plane

Computers and Operations Research
The multi-facility location-allocation problem with polyhedral barriers

Computers and Operations Research
The center location-dependent relocation problem with a probabilistic line barrier

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the planar 1-median problem with convex polygonal forbidden regions. A new facility is to be located to minimize the sum of weighted distances to a set of existing facilities such that the new facility is not located within any forbidden region, and no travel occurs through forbidden regions. A solution procedure using the 'Big Square Small Square' branch-and-bound method is developed, and used to find a global optimum.