An efficient algorithm for facility location in the presence of forbidden regions

This paper investigates a constrained form of the classical Weber problem. Specifically, we consider the problem of locating a new facility in the presence of convex polygonal forbidden regions such that the sum of the weighted distances from the new facility to n existing facilities is minimized. I...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1996-04, Vol.90 (1), p.56-70
Main Authors: Butt, Steven E., Cavalier, Tom M.
Format: Article
Language:English
Subjects:
Algorithms
Constrained optimization
Facilities
Forbidden regions
Heuristic
Location
Mathematical models
Operations research
Site selection
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates a constrained form of the classical Weber problem. Specifically, we consider the problem of locating a new facility in the presence of convex polygonal forbidden regions such that the sum of the weighted distances from the new facility to n existing facilities is minimized. It is assumed that a forbidden region is an area in the plane where travel and facility location are not permitted and that distance is measured using the Euclidean-distance metric. A solution procedure for this nonconvex programming problem is presented. It is shown that by iteratively solving a series of unconstrained problems, this procedure terminates at a local optimum to the original constrained problem. Numerical examples are presented.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)00297-5