A Trajectory Approach to the Round-Trip Location Problem

This paper treats the round-trip location problem proposed by Chan and Hearn. The object of the problem is to find the facility location that minimizes the maximum weighted round-trip distance between the facility and N pairs of demand points. The algorithm proposed here is based on the numerical solution of differential equations. Unlike the Chan and Hearn algorithm, which is based on linear programming and is applicable only to rectangular distances, this method is equally applicable to Euclidean and general (l_p) distances.