Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0928.90043
Hansen, P.; Mladenović, N.
Variable neighborhood search for the $p$-median. (English)
[J] Locat. Sci. 5, No.4, 207-226 (1997). ISSN 0966-8349

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

MSC 2000:: *90B80 Discrete location and assignment

Keywords: heuristics; variable neigborhood search; location; $p$-median

Cited in: Zbl 1085.90007 Zbl 1105.90332

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]