Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-23T12:23:47.510Z Has data issue: false hasContentIssue false
  • English
  • Français

An ex-post bound on the greedy heuristic for the uncapacitated facility location problem

Published online by Cambridge University Press:  12 October 2006

Jean-Michel Thizy
Jean-Michel Thizy*
Affiliation:
GEMO, ESDES, Lyon & School of Management, University of Ottawa, Ottawa, Ontario, Canada; . This article was submitted while the author was on a sabbatical leave at the Industrial Engineering & Computer Sciences Division of the École Nationale Supérieure des Mines de Saint-Etienne.
Get access

Abstract

A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal value.

Type
Research Article
Information
RAIRO - Operations Research , Volume 40 , Issue 2: ROADEF 03 , April 2006 , pp. 143 - 167
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ahn, S., Cooper, C., Cornuéjols, G. and Frieze, A., Probabilistic Analysis of a Relaxation for the k-Median Problem. Math. Oper. Res. 13 (1988) 1–31. CrossRef
Chvátal, V., Greedy Heuristic, A for the Set-Covering Problem. Math. Oper. Res. 4 (1979) 233–235. CrossRef
Cornuéjols, G., Fisher, M.L. and Nemhauser, G.L., On the Uncapacitated Location Problem. Ann. Discrete Math. 1 (1977) 163–178. CrossRef
Cornuéjols, G., Fisher, M.L. and Nemhauser, G.L., Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science 23 (1977) 789–810. CrossRef
Cornuéjols, G., Fisher, M.L. and Nemhauser Note, G.L. on Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science 25 (1979) 808–809. CrossRef
G. Cornuéjols and J.-M. Thizy, Location Problems, Set Covering Problems and the Greedy Algorithm, Working paper 25-80-81, Graduate School of Industrial Administration, Carnegie-Mellon University (April 1981), also available as Working Paper 02-51, School of Management, University of Ottawa (2002).
G. Cornuéjols and J.-M. Thizy, New Results on the Greedy Algorithm for Plant Location and Set Covering Problems, presented at the CORS-TIMS-ORSA Joint National Meeting, Toronto, Ontario, May 4, 1981.
Cornuéjols, G. and Thizy, J.-M., Primal Approach, A to the Simple Plant Location Problem. SIAM J. Algebraic Discrete Methods 3 (1982) 504–510. CrossRef
G. Cornuéjols, G.L. Nemhauser and L.A. Wolsey, The Uncapacitated Facility Location Problem, in: Discrete Location Theory, P.B. Mirchandani and R.M. Francis Eds., John Wiley and Sons, New–York (1990) 119–171.
El-Shaieb, A.M., New Al, Agorithm for Locating Sources Among Destinations. Management Science 20 (1973) 221–231. CrossRef
Erlenkotter, D., Dual-based Procedure, A for Uncapacitated Facility Location. Oper. Res. 26 (1978) 992–1009. CrossRef
S. Even, Graph Algorithms. Computer Science Press, Potomac, Maryland (1979).
M.L. Fisher, G.L. Nemhauser and L.A. Wolsey, An Analysis of Approximations for Maximizing Submodular Set Functions-II, Mathematical Programming Study 8 (1978) 73–87. CrossRef
M.L. Fisher and L.A. Wolsey, On the Greedy Heuristic for Covering and Packing Problems, SIAM J. Algebraic Discrete Methods 3 (1982) 584–591. CrossRef
Guignard, M. and Spielberg, K., Algorithms for exploiting the Structure of the Simple Plant Location Problem. Ann. Discrete Math. 1 (1977) 247–271. CrossRef
Johnson, D.S., Approximation Algorithms for Combinatorial Problems. J. Comput. System Sci. 9 (1974) 256-298. CrossRef
R.L. Karg and G.L. Thompson, A Heuristic Approach to Solving Traveling Salesman problems, Management Sci. 10 (1964) 225–248. CrossRef
P. Krolak, W. Felts and G. Marble, A Man-Machine Approach toward Solving the Traveling Salesman Problem. Communications of the Association for Computing Machinery 14 (1971), 327–334.
A.A. Kuehn and M.J. Hamburger, A Heuristic Program for Locating Warehouses, Management Sci. 9 (1963) 643–666.
Nemhauser, G.L., Wolsey, L.A. and Fisher, M.L., Analysis, An of Approximations for Maximizing Submodular Set Functions-I. Math. Program. 14 (1978) 265–294. CrossRef
L. Schrage, Implicit Representation of Variable Upper Bounds in Linear Programming, Math. Program. Stud. 4 (1975) 118–132. CrossRef
Simão, H.P. and Thizy, J.-M., Simplex Al, Agorithm for the Canonical Representation of the Uncapacitated Plant Location Problem. Oper. Res. Lett. 8 (1989) 279–286. CrossRef
J.-M. Thizy, Location Problems: Properties and Algorithms, Ph.D. thesis, Graduate School of Industrial Administration, Carnegie Mellon University (1981).
J.-M. Thizy, Worst-case analysis of the uncapacitated facility location problem with a budget constraint, Working Paper, School of Management, University of Ottawa, to appear.
Wolsey, L.A., An analysis of the Greedy Algorithm for the Submodular Set Covering Problem'. Combinatorica 2 (1982) 417–425. CrossRef