Volume 15, Number 3, July-September 2009
|Page(s)||509 - 524|
|Published online||30 May 2008|
Long-term planning versus short-term planning in the asymptotical location problem
SISSA, 4 via Beirut, 34014 Trieste, Italy; email@example.com
2 Dipartimento di Matematica, Università di Pisa, 5 Largo B. Pontecorvo, 56127 Pisa, Italy; firstname.lastname@example.org
3 CEREMADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France; email@example.com
4 Dipartimento di Matematica, Università di Pisa, 5 Largo B. Pontecorvo, 56127 Pisa, Italy; firstname.lastname@example.org
Given the probability measure ν over the given region , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving the configuration built at previous steps. We show that the respective optimization problems exhibit qualitatively different asymptotic behavior as , although the optimization costs in both cases have the same asymptotic orders of vanishing.
Mathematics Subject Classification: 90B80 / 90B85 / 49J45 / 46N10 / 60K30
Key words: Location problem / facility location / Fermat-Weber problem / k-median problem / sequential allocation / average distance functional / optimal transportation
© EDP Sciences, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.