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.
Keywords
, Location theory; p, Median problem; Discrete optimization; Heuristics
@article{paperid:202163,
author = { -, - and Taghizadeh Kakhki, Hossein},
title = {Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f},
journal = {European Journal of Operational Research},
year = {2006},
number = {127},
month = {January},
issn = {0377-2217},
pages = {440--462},
numpages = {22},
keywords = {Location theory; p-Median problem; Discrete optimization; Heuristics},
}
%0 Journal Article
%T Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f
%A -, -
%A Taghizadeh Kakhki, Hossein
%J European Journal of Operational Research
%@ 0377-2217
%D 2006
