Some interchange algorithms for median location problems

A number of interchange heuristics are described for solving p-median location problems. The robustness of these algorithms is extensively evaluated in terms of optimality and mean percentage errors. The best of the proposed heuristics generated optimal solutions to 307 of 319 median problems solved drawn from six data sets.