Skip to main content
SpringerLink
Log in

Solving the Simple Plant Location Problem using a Data Correcting Approach

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The Data Correcting Algorithm is a branch and bound type algorithm in which the data of a given problem instance is `corrected' at each branching in such a way that the new instance will be as close as possible to a polynomially solvable instance and the result satisfies an acceptable accuracy (the difference between optimal and current solution). In this paper the data correcting algorithm is applied to determining exact and approximate optimal solutions to the simple plant location problem. Implementations of the algorithm are based on a pseudo-Boolean representation of the goal function of this problem, and a new reduction rule. We study the efficiency of the data correcting approach using two different bounds, the Khachaturov-Minoux bound and the Erlenkotter bound. We present computational results on several benchmark instances, which confirm the efficiency of the data-correcting approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balas, E. and Padberg, M.W. (1972), On the set covering problem, Operations Research 20: 1152-1161.

    Google Scholar 

  • Beasley, J.E. (1993a), Lagrangian heuristics for location problems, European Journal of Operational Research 65: 383-399.

    Google Scholar 

  • Beasley, J.E. (1993b), OR-Library, http://mscmga.ms.ic.ac.uk/info.html

  • Bilde, O. and Krarup, J. (1977), Sharp lower bounds and efficient algorithms for the simple plant location problem, Annals of Discrete Mathematics 1: 79-97.

    Google Scholar 

  • Beresnev, V.L. (1973), On a Problem of mathematical Standardization theory, Upravliajemyje Sistemy 11: 43-54 (in Russian).

    Google Scholar 

  • Beresnev, V.L., Gimadi, E.Kh. and Dementyev, V.T. (1978), Extremal Standardization Problems, Nauka, Novosibirsk (in Russian).

    Google Scholar 

  • Cho, D.C., Johnson, E.L., Padberg. M.W. and Rao M.R. (1983a), On the uncapacitated plant location problem, I: Valid inequalities and facets, Mathematics of Operations Research 8: 579-589.

    Google Scholar 

  • Cho, D.C., Padberg, M.W. and Rao, M.R. (1983b), On the Uncapacitated plant location problem, II: facets and lifting theorems, Mathematics of Operations Research 8: 590-612.

    Google Scholar 

  • Christofides, N. (1975), Graph Theory: An Algorithmic Approach, Academic Press, London.

    Google Scholar 

  • Cornuejols, G., Fisher, M.L. and Nemhauser, G.L. (1977a), On the uncapacitated location problem, Annals of Discrete Mathematics 1: 163-177.

    Google Scholar 

  • Cornuejols, G., Fisher, M.L. and Nemhauser, G.L. (1977b), Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Science 23: 789-810.

    Google Scholar 

  • Cornuejols, G. and Thizy, J.M. (1982), A primal approach to the simple plant location problem, SIAM Journal on Algebraic and Discrete Methods 3: 504-510.

    Google Scholar 

  • Cornuejols, G., Nemhauser, G.L. and Wolsey, L.A. (1990), The uncapacitated facility location problem. In: Mirchandani, P.B. and Francis, R.L. (Eds.) Discrete Location Theory, Wiley-Interscience, New York, pp. 119-171.

    Google Scholar 

  • Erlenkotter, D. (1978), A dual-based procedure for uncapacitated facility location, Operations Research 26: 992-1009.

    Google Scholar 

  • Galvão, R.D. and Raggi, L.A. (1989), A method for solving to optimality uncapacitated location problems, Annals of Operations Research 18: 225-244.

    Google Scholar 

  • Garfinkel, R.S., Neebe, A.W. and Rao, M.R. (1974), An algorithm for the M-median plant location problem, Transportation Science 8, 217-236.

    Google Scholar 

  • Goldengorin, B. (1983), A correcting algorithm for solving some discrete optimization problems, Soviet Math. Doklady 27: 620-623.

    Google Scholar 

  • Goldengorin, B. (1995), Requirements of Standards: Optimization Models and Algorithms, ROR, Hoogezand, The Netherlands.

    Google Scholar 

  • Goldengorin, B., Sierksma, G., Tijssen, G.A. and Tso, M. (1999), The data-correcting algorithm for minimization of supermodular functions, Management Science 45: 1539-1551.

    Google Scholar 

  • Goldengorin, B., Ghosh, D. and Sierksma, G. (2000), Equivalent instances of the simple plant location problem, SOM Research Report-00A54, University of Groningen, The Netherlands.

    Google Scholar 

  • Goldengorin, B., Ghosh, D. and Sierksma, G. (2001), Improving the efficiency of branch and bound algorithms for the simple plant location problem, In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE2001), Lecture Notes in Computer Science 2141: 106-117.

  • Hammer, P.L. (1968), Plant Location - a pseudo-boolean approach, Israel Journal of Technology 6: 330-332.

    Google Scholar 

  • Held, M.P., Wolfe, P. and Crowder, H.P. (1974), Validation of subgradient optimization, Mathematical Programming 6: 62-88.

    Google Scholar 

  • Jones, P.C., Lowe, T.J., Muller, G., Xu, N., Ye, Y. and Zydiak, J.L. (1995), Specially structured uncapacitated facility location problems, Operations Research 43: 661-669.

    Google Scholar 

  • Khachaturov, V.R. (1968), Some problems of the consecutive calculation method and its applications to location problems, Ph.D thesis, Central Economics & Mathematics Institute, Russian Academy of Sciences, Moscow (in Russian).

    Google Scholar 

  • Khumawala, B.M. (1972), An efficient branch and bound algorithm for the warehouse location problem, Management Science 18: B718-B731.

    Google Scholar 

  • Körkel, M. (1989), On the exact solution of large-scale simple plant location problems. European Journal of Operational Research 39: 157-173.

    Google Scholar 

  • Krarup, J. and Pruzan, P.M. (1983), The simple plant location problem: A survey and synthesis, European Journal of Operational Research 12: 36-81.

    Google Scholar 

  • Labbé, M. and Louveaux, F.V. (1997), Location problems. In: Dell'Amico, M. Maffioli, F. and Martello, S. (eds.), Annotated Bibliographies in Combinatorial Optimization, John Wiley & Sons, New York pp. 264-271.

    Google Scholar 

  • Minoux, M. (1977), Accelerated greedy algorithms for maximizing submodular set functions. In: Stoer J. (ed.), Actes Congres IFIP, Springer, Berlin, pp. 234-243.

    Google Scholar 

  • Morris, J.G. (1978), On the extent to which certain fixed charge depot location problems can be solved by LP, Journal of the Operational Research Society 29: 71-76.

    Google Scholar 

  • Mukendi, C. (1975), Sur l’Implantation d’Équipement dans un Réscau: Le Problème de m-Centre, PhD Thesis, University of Grenoble, France.

    Google Scholar 

  • Pentico, D.W. (1976), The assortment problem with nonlinear cost functions, Operations Research 24: 1129-1142.

    Google Scholar 

  • Pentico, D.W. (1988), The discrete two-dimensional assortment problem, Operations Research 36: 324-332.

    Google Scholar 

  • Revelle, C.S. and Laporte, G. (1996), The plant location problem: New models and research prospects, Operations Research 44: 864-874.

    Google Scholar 

  • Schrage, L. (1975), Implicit representation of variable upper bounds in linear programming, Mathematical Programming Study 4: 118-132.

    Google Scholar 

  • Tripathy, A., Süral, H. and Gerchak, Y. (1999), Multidimensional assortment problem with an application, Networks 33, 239-245.

    Google Scholar 

  • Trubin, V.A. (1969), On a method of solution of integer programming problems of a special kind, Soviet Math. Doklady 10: 1544-1546.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economic Sciences, University of Groningen, Groningen, The Netherlands

    Boris Goldengorin, Gert A. Tijssen & Gerard Sierksma

  2. P&QM Area, Indian Institute of Management, Ahmedabad, India

    Diptesh Ghosh

Authors
  1. Boris Goldengorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gert A. Tijssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Diptesh Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerard Sierksma
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goldengorin, B., Tijssen, G.A., Ghosh, D. et al. Solving the Simple Plant Location Problem using a Data Correcting Approach. Journal of Global Optimization 25, 377–406 (2003). https://doi.org/10.1023/A:1022503826877

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022503826877

Search

Navigation