A Solution Procedure for a Rectilinear Distance Minimax Round Trip Location Problem

摘要

The problem considered is that of finding the location of a facility in the plane so that the maximum rectilinear round trip distance between the facility and N pairs of existing facilities in the plane will be minimized. The round trip distance is the total distance travelled starting from the new facility via a pair of existing facilities and back to the new facility. A solution procedure is developed for finding all optimal locations to the problem. The derivation of the procedure is based on solving a linear program which is equivalent to the minimax location problem in question. (Author)