Efficiencies of a sequential algorithm and an intuitive selection method in a planar location problem

Efficiencies of a sequential algorithm and an intuitive selection method in a planar location problem

0.00 Avg rating0 Votes
Article ID: iaor199273
Country: United Kingdom
Start Page Number: 445
End Page Number: 456
Publication Date: Nov 1991
Journal: Operations Research Letters
Authors:
Abstract:

The paper considers the problem of determining the locations of n public facilities in such a way that the total sum of distances F between all people and their nearest facilities be minimized. Using the geographical optimization method, the locations which gives us the minimum value of F can be found. On the other hand, a sequential minimum location i (i=k,...,n) can be obtained under the condition that the first k-1 locations are already determined. The present paper discusses the efficency of this sequential method relative to the minimum solution and also the efficiency of an intuitive selection method which is similar to the sequential method.

Reviews

Required fields are marked *. Your email address will not be published.