Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 1154.90531
Plastria, Frank; Elosmani, Mohamed
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems. (English)
[J] Top 16, No. 2, 388-406 (2008). ISSN 1134-5764; ISSN 1863-8279/e

Summary: A general family of single facility continuous location-allocation problems is introduced, which includes the decreasingly weighted ordered median problem, the single facility Weber problem with supply surplus, and Weber problems with alternative fast transportation network. We show in this paper that the extension of the well known Weiszfeld iterative decrease method for solving the corresponding location problems with fixed allocation yields an always convergent scheme for the location allocation problems. In a generic way, from each starting point, the limit point will be a locally minimal solution, whereas for each possible exceptional situation, a possible solution is indicated. Some computational results are presented, comparing this method with an alternating location-allocation approach.

MSC 2000:: *90B85 Continuous location

Keywords: planar facility location; location allocation; local decrease method; convergence

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

	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]