Mass transportation and the consistency of the empirical optimal conditional locations

We consider the problem of finding the optimal locations of new facilities given the locations of existing facilities and clients. We analyze the general situation where the locations of existing facilities are deterministic while the locations of clients are stochastic with the same unknown marginal distribution. We show how this conditional location-allocation problem can be modeled as a variation of the standard Monge-Kantorovich mass transference problem. We provide a probabilistic formulation of the optimal locations of the new facilities and derive consistent estimators of these theoretical locations from a sample of identically distributed random clients. The integrity of our method is illustrated through some simulation experiments and a real case study.

[1]  Paolo Toth,et al.  Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..

[2]  C. Villani Topics in Optimal Transportation , 2003 .

[3]  Michael McAsey,et al.  Optimal Locations and the Mass Transport Problem , 2000 .

[4]  M. Eisen,et al.  Probability and its applications , 1975 .

[5]  A. Volgenant Linear and semi-assignment problems: A core oriented approach , 1996, Comput. Oper. Res..

[6]  Jim Freeman Probability Metrics and the Stability of Stochastic Models , 1991 .

[7]  S. Rachev The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications , 1985 .

[8]  Frank Morgan,et al.  Hexagonal Economic Regions Solve the Location Problem , 2002, Am. Math. Mon..

[9]  Mtw,et al.  Mass Transportation Problems: Vol. I: Theory@@@Mass Transportation Problems: Vol. II: Applications , 1999 .

[10]  Carlos Matrán,et al.  Optimal Transportation Plans and Convergence in Distribution , 1997 .

[11]  Mario Milman,et al.  Monge Ampère equation : applications to geometry and optimization : NSF-CBMS Conference on the Monge Ampère Equation : Applications to Geometry and Optimization, July 9-13, 1997, Florida Atlantic University , 1999 .

[12]  Christine Thomas-Agnan,et al.  Spatial point process models for location-allocation problems , 2009, Comput. Stat. Data Anal..

[13]  W. Gangbo,et al.  The geometry of optimal transportation , 1996 .

[14]  Guy Bouchitté,et al.  Asymptotique d'un problème de positionnement optimal , 2002 .

[15]  S. Rachev,et al.  Mass transportation problems , 1998 .

[16]  R. Serfling Approximation Theorems of Mathematical Statistics , 1980 .

[17]  G. Burton TOPICS IN OPTIMAL TRANSPORTATION (Graduate Studies in Mathematics 58) By CÉDRIC VILLANI: 370 pp., US$59.00, ISBN 0-8218-3312-X (American Mathematical Society, Providence, RI, 2003) , 2004 .

[18]  G. Buttazzo,et al.  ASYMPTOTICS OF AN OPTIMAL COMPLIANCE-LOCATION PROBLEM , 2005, math/0503426.

[19]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.