Variable neighborhood search for the p-median

摘要: Abstract Consider a set L of potential locations for p facilities and U given users. The p-median problem is to locate simultaneously the at in order minimize total transportation cost satisfying demand users, each supplied from its closest facility. This model basic one location theory can also be interpreted terms cluster analysis where users are then replaced by points space. We propose several new Variable Neighborhood Search heuristics compare them with Greedy plus Interchange, two Tabu heuristics.