Successive computation of some efficient locations of the Weber problem with barriers
We transform a continuous Weber problem with barriers to a discrete problem by computing some efficient locations, which are considered as promising locations for a new facility. A theorem determining conditions for a location to be efficient is introduced. A method for constructing the weighted coefficients and travel costs modeled by some distance metrics, is derived. This method provides successive computation of some efficient locations. Also, we propose an algorithm for the verification of locations efficiency. Numerical examples are provided using squared Euclidean and Manhattan distance metrics, as well as the implementation details in programming package MATHEMATICA.
efficient locations weber problem with barriers distance metrics mathematica 90b80 90b85