Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel

Y. P. Aneja and M. Parlar
Additional contact information
Y. P. Aneja: Faculty of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4
M. Parlar: Faculty of Business, McMaster University, Hamilton, Ontario, Canada L8S 4M4

Transportation Science, 1994, vol. 28, issue 1, 70-76

Abstract: We describe algorithms for optimal single facility location problems with forbidden regions and barriers to travel. The former are those where location is not permitted, but one can travel through them, e.g., a lake. The latter are the regions where neither location nor travel is permitted, e.g., large parks in a city. Using the convexity properties of the objective function, in the first case, we develop an algorithm for finding the optimal solution. The objective function in the barrier case is shown to be non-convex. We use the concept of visibility to create a network with the location point as the source and use Dijkstra's algorithm to compute the shortest distance to all the other demand points. Using simulated annealing we find an approximate optimal solution. Numerical examples illustrate the implementation of the algorithms.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.1.70 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:28:y:1994:i:1:p:70-76

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().