An Enhancement of the Drezner—Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
暂无分享,去创建一个
In this note, we examine the algorithm of Drezner and Wesolowsky for locating a facility with maximin rectilinear distance to a given set of demand points. The concept of the closest-point constraint is introduced as a technique for increasing the efficiency of the algorithm. This potential increase in efficiency is demonstrated by an example.
[1] Zilla Sinuany-Stern,et al. THE ONE‐DIMENSIONAL SINGLE FACILITY MAXIMIN DISTANCE LOCATION PROBLEM , 1983 .
[2] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[3] Zvi Drezner,et al. THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES , 1983 .
[4] George O. Wesolowsky. THE WEBER PROBLEM WITH RECTANGULAR DISTANCES AND RANDOMLY DISTRIBUTED DESTINATIONS , 1977 .