A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach

Abstract For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alternate location–allocation algorithm consists of a location phase and an allocation phase. The task of the location phase is to solve finitely many single-source Weber problems (SWP), which are reduced by the heuristic of nearest center reclassification for the customers in the previous allocation phase. This paper considers the more general and practical case – the MWP with constraints (CMWP). In particular, a variational inequality approach is contributed to solving the involved constrained SWP (CSWP), and thus a new heuristic algorithm for CMWP is presented. The involved CSWP in the location phases are reformulated into some linear variational inequalities, whose special structures lead to a new projection–contraction (PC) method. Global convergence of the PC method is proved under mild assumptions. The new heuristic algorithm using the PC method in the location phases approaches to the heuristic solution of CMWP efficiently, which is verified by the preliminary numerical results reported in this paper.

[1]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

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

[3]  Alfredo N. Iusem,et al.  A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space , 1998, SIAM J. Optim..

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

[5]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

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

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

[8]  B. Martinet.  Brève communication. Régularisation d'inéquations variationnelles par approximations successives , 1970 .

[9]  B. He,et al.  A MODIFIED PROJECTION AND CONTRACTION METHOD FOR A CLASS OF LINEAR COMPLEMENTARITY PROBLEMS , 2006 .

[10]  Jack Brimberg,et al.  Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances , 1993, Oper. Res..

[11]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[12]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[13]  Bingsheng He,et al.  A new method for a class of linear variational inequalities , 1994, Math. Program..

[14]  K. Rosing.  An Optimal Method for Solving the (Generalized) Multi-Weber Problem , 1992 .

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

[16]  Christian Michelot,et al.  A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms , 1988 .

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

[18]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[19]  C. Michelot,et al.  Geometrical properties of the Fermat-Weber problem , 1985 .

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

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

[22]  L. Cooper.  Location-Allocation Problems , 1963 .

[23]  H. Uzawa,et al.  Preference, production, and capital: Iterative methods for concave programming , 1989 .

[24]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

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

[26]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .