Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases

• DOI: 10.1016/j.ejor.2004.05.027
• Publication Date: 2004-08-21T09:11:34Z
• Authors: J. Fathali; H. Taghizadeh Kakhki
• Keywords: Variable neighborhood search

The p-median problem with positive and negative weights has been introduced by Burkard and Krarup [Computing 60 (1998) 193]. In this paper we discuss some special cases of this problem on trees and propose a variable neighborhood search procedure for general networks, which is in fact a modification of the one proposed by Hansen and Mladenovic [Locat. Sci. 5 (1997) 207] for the p-median. We also compare the results with those obtained by a Tabu search procedure.