Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480799 | European Journal of Operational Research | 2010 | 8 Pages |
Abstract
This paper considers the problem of locating a single facility in the presence of a line barrier that occurs randomly on a given horizontal route on the plane. The objective is to locate this new facility such that the sum of the expected rectilinear distances from the facility to the demand points in the presence of the probabilistic barrier is minimized. Some properties of the problem are reported, a solution algorithm is provided with an example problem, and some future extensions to the problem are discussed.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mustafa S. Canbolat, George O. Wesolowsky,