An alternative heuristic for medianoid and centroid problems in the plane

This paper develops two heuristics for solving the centroid problem on a plane with discrete demand points. The methods are based on the alternating step well known in location methods. Extensive computational testing with the heuristics reveals that they converge rapidly, giving good solutions to problems that are up to twice as large as those reported in the literature. The testing also provides some managerial insight into the problem and its solution.