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

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

0.00 Avg rating0 Votes
Article ID: iaor199983
Country: Netherlands
Volume: 90
Issue: 1
Start Page Number: 56
End Page Number: 70
Publication Date: Apr 1996
Journal: European Journal of Operational Research
Authors: ,
Abstract:

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.

Reviews

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