摘要：Authors investigate the p-median location problem on networks and propose a heuristic algorithm whichis based on the probability changing method (a special case of the genetic algorithm) for an approximatesolution to the problem. The ideas of the algorithm are proposed under the assumption that, in the large-scale networks with comparatively small edge lengths, the p-median problem has features similar to theWeber problem. The efficiency of the proposed algorithm and its combinations with the known algorithmswere proved by experiments
