Department of Mathematics
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
We are interested in locations of multiple facilities in the plane with the aim of minimizing the sum of weighted distance between these facilities and regional customers, where the distance between a facility and a regional customer is evaluated by the farthest distance from this facility to the demand region. By applying the well-known location-allocation heuristic, the main task for solving such a problem turns out to solve a number of constrained Weber problems (CWPs). This paper focuses on the computational contribution in this topic by developing a variant of the classical Barzilai-Borwein (BB) gradient method to solve the reduced CWPs. Consequently, a hybrid Cooper type method is developed to solve the problem under consideration. Preliminary numerical results are reported to verify the evident effectiveness of the new method. © Springer Science+Business Media, LLC 2011.
Barzilai-Borwein gradient method, Facility location, Farthest distance, Regional demand, Weiszfeld procedure
Source Publication Title
Computational Optimization and Applications
Link to Publisher's Edition
Jiang, J., & Yuan, X. (2012). A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand. Computational Optimization and Applications, 51 (3), 1275-1259. https://doi.org/10.1007/s10589-010-9392-9