European Journal of Operational Research, ( ISI ), No (127), Year (2006-1) , Pages (440-462)
Title : Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f ( Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f )
Authors: - - , Hossein Taghizadeh Kakhki ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
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.
