Accelerating the convergence in the single-source and multi-source Weber problems

Abstract The modified Weiszfeld method [Y. Vardi, C.H. Zhang, A modified Weiszfeld algorithm for the Fermat–Weber location problem, Mathematical Programming 90 (2001) 559–566] is perhaps the most widely-used algorithm for the single-source Weber problem (SWP). In this paper, in order to accelerate the efficiency for solving SWP, a new numerical method, called Weiszfeld–Newton method, is developed by combining the modified Weiszfeld method with the well-known Newton method. Global convergence of the new Weiszfeld–Newton method is proved under mild assumptions. For the multi-source Weber problem (MWP), a new location-allocation heuristic, Cooper–Weiszfeld–Newton method, is presented in the spirit of Cooper algorithm [L. Cooper, Heuristic methods for location-allocation problems, SIAM Review 6 (1964) 37–53], using the new Weiszfeld–Newton method in the location phase to locate facilities and adopting the nearest center reclassification algorithm (NCRA) in the allocation phase to allocate the customers. Preliminary numerical results are reported to verify the evident effectiveness of Weiszfeld–Newton method for SWP and Cooper–Weiszfeld–Newton method for MWP.

[1]  Xiaoming Yuan,et al.  A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach , 2008, Eur. J. Oper. Res..

[2]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[3]  Saïd Salhi,et al.  A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem , 2003, Ann. Oper. Res..

[4]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[5]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[6]  Boris T. Polyak,et al.  Newton's method and its use in optimization , 2007, Eur. J. Oper. Res..

[7]  Arie Tamir,et al.  Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem , 1989, Math. Program..

[8]  H. Kuhn.  An Efficient Algorithm for the Numerical Solution of the Generalized Weber Problem in Spatial Economics , 1992 .

[9]  Cun-Hui Zhang,et al.  A modified Weiszfeld algorithm for the Fermat-Weber location problem , 2001, Math. Program..

[10]  I. Norman Katz,et al.  Local convergence in Fermat's problem , 1974, Math. Program..

[11]  Leon Cooper,et al.  SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS , 1967 .

[12]  Adi Ben-Israel,et al.  A heuristic method for large-scale multi-facility location problems , 2004, Comput. Oper. Res..

[13]  Nenad Mladenovic,et al.  Degeneracy in the multi-source Weber problem , 1999, Math. Program..

[14]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[15]  Loo Hay Lee,et al.  Multi-source facility location-allocation and inventory problem , 2010, Eur. J. Oper. Res..

[16]  Ioannis K. Argyros,et al.  Weak convergence conditions for Inexact Newton-type methods , 2011, Appl. Math. Comput..

[17]  Said Salhi,et al.  Constructive heuristics for the uncapacitated continuous location-allocation problem , 2001, J. Oper. Res. Soc..

[18]  Lawrence M. Ostresh.  On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem , 1978, Oper. Res..

[19]  Lawrence M. Ostresh.  AN EFFICIENT ALGORITHM FOR SOLVING THE TWO CENTER LOCATION‐ALLOCATION PROBLEM , 1975 .

[20]  Zvi Drezner,et al.  A note on the Weber location problem , 1993, Ann. Oper. Res..

[21]  Christian Michelot,et al.  A primal-dual algorithm for the fermat-weber problem involving mixed gauges , 1987, Math. Program..

[22]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[23]  Jin Yun Yuan,et al.  Quasi-Newton trust region algorithm for non-smooth least squares problems , 1999, Appl. Math. Comput..

[24]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[25]  Harold W. Kuhn,et al.  A note on Fermat's problem , 1973, Math. Program..

[26]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[27]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[28]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[29]  Francisc Radó,et al.  The Euclidean Multifacility Location Problem , 1988, Oper. Res..

[30]  Jack Brimberg,et al.  Accelerating convergence in the Fermat-Weber location problem , 1998, Oper. Res. Lett..

[31]  L. Grippo,et al.  A truncated Newton method with nonmonotone line search for unconstrained optimization , 1989 .

[32]  Masao Fukushima,et al.  A globally convergent Newton method for solving strongly monotone variational inequalities , 1993, Math. Program..

[33]  Paul H. Calamai,et al.  A projection method forlp norm location-allocation problems , 1994, Math. Program..

[34]  Ya Xu,et al.  Minisum location problem with farthest Euclidean distances , 2006, Math. Methods Oper. Res..

[35]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .