Abstract
Subgradient methods are popular for solving nondifferentiable optimization problems because of their relative ease in implementation, but are not always robust and require a careful design of strategies in order to yield an effective procedure for any given class of problems. In this paper, we present an approach for solving the Euclidean distance multifacility location problem (EMFLP) using conjugate or deflected subgradient based algorithms along with suitable line-search strategies. The subgradient deflection method considered is the Average Direction Strategy (ADS) imbedded within the Variable Target Value Method (VTVM). We also investigate the generation of two types of subgradients to be employed in conjunction with ADS. The first type is a simple valid subgradient that assigns zero values to contributions corresponding to the nondifferentiable terms in the objective function, and so, the subgradient is composed by summing the contributions corresponding to the differentiable terms alone. The second type expends more effort to derive a low-norm member of the subdifferential in order to enhance the prospect of obtaining a descent direction. Furthermore, a special Newton-based line-search that exploits the nondifferentiability of the problem is also designed to be implemented in the developed algorithm in order to study its impact on the convergence behavior. Various combinations of the above strategies are composed and evaluated on a set of test problems. The results show that a modification of the VTVM method along with the first or a certain combination of the two subgradient generation strategies, and the use of a suitable line-search technique, provides promising results. An alternative block-halving step-size strategy used within VTVM in conjunction with the proposed line-search method yields a competitive second choice performance.
Similar content being viewed by others
References
M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd edition, John Wiley and Sons, Inc.: New York, NY, 1993.
P.H. Calamai and A.R. Conn, “A second-order method for solving the continuous multifacility location problem,” in G.A. Watson (Ed.), Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics 912, pp. 1-25, Springer-Verlag: Berlin, Heidelberg and New York, 1982.
P.H. Calamai and A.R. Conn, “A projected Newton method for L p norm location problems,” Mathematical Programming, vol. 38, pp. 75-109, 1987.
P.H. Calamai and C. Charalambous, “Solving multifacility location problems involving Euclidean distances,” Naval Research Logistics, vol. 27,no. 4, pp. 609-620, 1980.
C. Charalambous, “Acceleration of the HAP approach for the multifacility location problem,” Naval Research Logistics, vol. 32, pp. 373-389, 1985.
J.A. Chatelon, D.W. Hearn, and T.J. Lowe, “A subgradient algorithm for certain minimax and minisum problems,” Mathematical Programming, vol. 15, pp. 130-145, 1978.
J.W. Eyster, J.A. White, and W.W. Wierwille, “On solving multifacility location problems using a hyperboloid approximation procedure,” AIIE Transactions, vol. 5,no. 1, pp. 1-6, 1973.
R.L. Francis and A.V. Cabot, “Properties of multifacility location problems involving Euclidean distances,” Naval Research Logistics Quarterly, vol. 19, pp. 335-353, 1972.
R.L. Francis, L.F. McGinnis, Jr., and J.A. White, Facility Layout and Location: An Analytical Approach, Prentice-Hall: Englewood Cliffs, NJ, 1991.
H. Juel, “On a rational stopping rule for facilities location algorithms,” Naval Research Logistics Quarterly, vol. 31, pp. 9-11, 1984.
R.F. Love, “Locating facilities in three-dimensional space by convex programming,” Naval Research Logistics, vol. 16, pp. 503-516, 1969.
R.F. Overton, “A Quadratically convergence method for minimizing a sum of Euclidean norms,” Mathematical Programming, vol. 27, pp. 34-63, 1983.
F. Plastria, “When facilities coincide: Exact optimality conditions in multifacility location,” Journal of Mathematical Analysis and Applications, vol. 169, pp. 476-498, 1992.
M.J.D. Powell, “Restart procedures for the conjugate gradient method,” Mathematical Programming, vol. 12, pp. 241-254, 1977.
F. Rado “The Euclidean multifacility problem,” Operations Research, vol. 36, pp. 485-492, 1988.
J.B. Rosen and G.L. Xue, “On the convergence of the hyperboloid approximation procedure for the perturbed Euclidean multifacility location problem,” Operations Research, vol. 41,no. 6, pp. 1164-1171, 1993.
H.D. Sherali and I. Al-Loughani, “Equivalent primal and dual differentiable reformulations of the Euclidean multifacility location problem,” vol. 30,no. 11, pp. 1065-1074, 1999.
H.D. Sherali, G. Choi, and C.H. Tuncbilek, “A variable target value method for nondifferentiable optimization,” Report HDS96-2, Department of Industrial and Systems Engineering, VPI&SU, Blacksburg, VA 24061, 1996. To appear in Operations Research Letters.
H.D. Sherali and O. Ulular, “A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems,” Applied Mathematics and Optimization, vol. 20, pp. 193-221, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sherali, H.D., Al-Loughani, I. Solving Euclidean Distance Multifacility Location Problems Using Conjugate Subgradient and Line-Search Methods. Computational Optimization and Applications 14, 275–291 (1999). https://doi.org/10.1023/A:1026440104273
Issue Date:
DOI: https://doi.org/10.1023/A:1026440104273