Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482959 | European Journal of Operational Research | 2006 | 23 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
J. Fathali, H. Taghizadeh Kakhki,