Advertisement

Computational Optimization and Applications

, Volume 51, Issue 3, pp 1275–1295 | Cite as

A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand

  • Jianlin Jiang
  • Xiaoming YuanEmail author
Article

Abstract

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.

Keywords

Facility location Barzilai-Borwein gradient method Weiszfeld procedure Regional demand Farthest distance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barzilai, J., Borwein, J.M.: Two point step size gradient methods. IMA J. Numer. Anal. 8, 141–148 (1988) MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bennett, C.D., Mirakhor, A.: Optimal facility location with respect to several regions. J. Reg. Sci. 14, 131–136 (1974) CrossRefGoogle Scholar
  3. 3.
    Birgin, E.G., Martinez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods for convex sets. SIAM J. Optim. 10, 1196–1211 (2000) MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Brimberg, J., Wesolowsky, G.O.: Minisum location with closest Euclidean distances. Ann. Oper. Res. 111, 151–165 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Brimberg, J., Wesolowsky, G.O.: Locating facilities by minimax relative to closest points of demand areas. Comput. Oper. Res. 29, 625–636 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Carrizosa, E., Munoz, M., Puerto, J.: The Weber problem with regional demand. Eur. J. Oper. Res. 104, 358–365 (1998) zbMATHCrossRefGoogle Scholar
  7. 7.
    Chandrasekaran, R., Tamir, A.: Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem. Math. Program. 44, 293–295 (1989) MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Cooper, L.: Heuristic methods for location-allocation problems. SIAM Rev. 6, 37–53 (1964) MathSciNetCrossRefGoogle Scholar
  9. 9.
    Dai, Y.H., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100, 21–47 (2005) MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22, 1–10 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Dai, Y.H., Zhang, H.C.: Adaptive two-point stepsize gradient algorithm. Numer. Algorithms 27, 377–385 (2001) MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Dai, Y.H., Yuan, J.Y., Yuan, Y.X.: Modified two-point stepsize gradient methods for unconstrained optimization. Comput. Optim. Appl. 22, 103–109 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Dai, Y.H., Hager, W.W., Zhang, H.C.: The cyclic Barzilai-Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26, 604–627 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer, New York (1995) Google Scholar
  15. 15.
    Drezner, Z., Wesolowsky, G.O.: Optimal location of a facility relative to area demands. Nav. Res. Logist. Q. 27, 199–206 (1980) MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Drezner, Z., Wesolowsky, G.O.: Location models with groups of demand points. Inf. Syst. Oper. Res. 38, 359–372 (2000) Google Scholar
  17. 17.
    Fletcher, R.: Low storage methods for unconstrained optimization. Lect. Appl. Math., 26, 165–179 (1999) MathSciNetGoogle Scholar
  18. 18.
    Fletcher, R.: On the Barzilai-Borwein method. In: Qi, L.Q., Teo, K., Yang, X.Q. (eds.) Optimization and Control with Applications (Applied Optimization), pp. 235–256. Springer, New York (2001) Google Scholar
  19. 19.
    Friedlander, A., Martinez, J.M., Molina, B., Raydan, M.: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36, 275–289 (1999) MathSciNetCrossRefGoogle Scholar
  20. 20.
    Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, Boston (1990) zbMATHGoogle Scholar
  21. 21.
    Grippo, L., Sciandrone, M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comput. Optim. Appl. 23, 143–169 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Hager, W.W., Zhang, H.C.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17, 526–557 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  23. 23.
    Hager, W.W., Mair, B.A., Zhang, H.C.: An affine-scaling interior-point CBB method for box-constrained optimization. Math. Program. 119, 1–32 (2009) MathSciNetzbMATHCrossRefGoogle Scholar
  24. 24.
    Hansen, P., Peeters, D., Thisse, J.F.: An algorithm for a constrained Weber problem. Manag. Sci. 28, 1285–1295 (1982) zbMATHCrossRefGoogle Scholar
  25. 25.
    Jiang, J.L., Xu, Y.: Minisum location problem with farthest Euclidean distances. Math. Methods Oper. Res. 64, 285–308 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Jiang, J.L., Yuan, X.M.: A heuristic algorithm for constrained multi-source Weber problem—the variational inequality approach. Eur. J. Oper. Res. 187, 357–370 (2008) MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Kuhn, H.W.: A note on Fermat’s problem. Math. Program. 4, 98–107 (1973) zbMATHCrossRefGoogle Scholar
  28. 28.
    Kuhn, H.W., Kuenne, R.E.: An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics. J. Reg. Sci. 4, 21–33 (1962) CrossRefGoogle Scholar
  29. 29.
    Love, R.F.: A computational procedure for optimally locating a facility with respect to several rectangular regions. J. Reg. Sci. 12, 233–242 (1972) CrossRefGoogle Scholar
  30. 30.
    Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models and Methods. North-Holland, Amsterdam (1988) zbMATHGoogle Scholar
  31. 31.
    Michelot, C., Lefebvre, O.: A primal-dual algorithm for the Fermat-Weber problem involving mixed gauges. Math. Program. 39, 319–335 (1987) MathSciNetzbMATHCrossRefGoogle Scholar
  32. 32.
    Nickel, S., Puerto, J.: An approach to location models involving sets as existing facilities. Math. Oper. Res., 28, 693–715 (2003) MathSciNetzbMATHCrossRefGoogle Scholar
  33. 33.
    Ostresh, L.M.: An efficient algorithm for solving the two-center location-allocation problem. J. Reg. Sci. 15, 209–216 (1975) CrossRefGoogle Scholar
  34. 34.
    Ostresh, L.M.: On the convergence of a class of iterative methods for solving the Weber location problem. Oper. Res. 26, 597–609 (1978) MathSciNetzbMATHCrossRefGoogle Scholar
  35. 35.
    Rado, F.: The Euclidean multifacility location problem. Oper. Res. 36, 485–492 (1988) MathSciNetzbMATHCrossRefGoogle Scholar
  36. 36.
    Raydan, M.: On the Barzilai and Borwein choice of step length for the gradient method. IMA J. Numer. Anal. 13, 321–326 (1993) MathSciNetzbMATHCrossRefGoogle Scholar
  37. 37.
    Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimzation problem. SIAM J. Optim. 7, 26–33 (1997) MathSciNetzbMATHCrossRefGoogle Scholar
  38. 38.
    Raydan, M., Svaiter, B.F.: Relaxed steepest descent and Cauchy-Barzilai-Borwein method. Comput. Optim. Appl. 21, 155–167 (2002) MathSciNetzbMATHCrossRefGoogle Scholar
  39. 39.
    Stone, R.E.: Some average distance results. Transp. Sci. 25, 83–91 (1991) CrossRefGoogle Scholar
  40. 40.
    Suzuki, A., Drezner, Z.: The p-center location problem in an area. Location Sci. 4, 69–82 (1996) zbMATHCrossRefGoogle Scholar
  41. 41.
    Vardi, Y., Zhang, C.H.: A modified Weiszfeld algorithm for the Fermat-Weber location problem. Math. Program., 90, 559–566 (2001) MathSciNetzbMATHCrossRefGoogle Scholar
  42. 42.
    Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math. J., 43, 355–386 (1937) Google Scholar
  43. 43.
    Wesolowsky, G.O., Love, R.F.: Location of facilities with rectangular distances among point and area destinations. Nav. Res. Logist. Q. 18, 83–90 (1971) zbMATHCrossRefGoogle Scholar
  44. 44.
    Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM Journal on Optimization 14, 1043–1056 (2004) MathSciNetzbMATHCrossRefGoogle Scholar
  45. 45.
    Zhang, H.C., Hager, W.W.: PCBB: a projected cyclic Barzilai-Borwein algorithm for box constrained optimization. In: Hager, W.W., Huang, S.J., Pardalos, P.M., Prokopyev, O.A. (eds.) Multiscale Optimization Methods and Applications, pp. 387–392. Springer, New York (2005) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Mathematics, College of ScienceNanjing University of Aeronautics and AstronauticsNanjingChina
  2. 2.Department of MathematicsHong Kong Baptist UniversityHong KongChina

Personalised recommendations