Skip to main content
SpringerLink
Log in

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem

  • Conference paper
  • First Online:
Algorithm Engineering (WAE 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2141))

Included in the following conference series:

Abstract

The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve this problem. In this paper we present some techniques that enhance the performance of branch and bound algorithms. Computational experiments show that the new algorithms thus obtained generate less than 60% of the number of subproblems generated by branch and bound algorithms, and in certain cases require less than 10% of the execution times required by conventional branch and bound algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. E. Beasley. OR-Library, http://mscmga.ms.ic.ac.uk/info.html

  2. V. L. Beresnev. On a Problem of Mathematical Standardization Theory. Upravliajemyje Sistemy 11, 43–54, 1973 (in Russian).

    Google Scholar 

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

    Google Scholar 

  4. N. Christofides. Graph Theory: An Algorithmic Approach. Academic Press Inc. Ltd., London, 1975.

    MATH  Google Scholar 

  5. G. Cornuejols, G. L. Nemhauser, and L. A. Wolsey. The Uncapacitated Facility Location Problem. Ch.3, Discrete Location Theory, R. L. Francis and P. B. Mirchandani (eds.), Wiley-Interscience, New York, 1990.

    Google Scholar 

  6. P. M. Dearing, P. L. Hammer, B. Simeone, Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem. Transportation Science 26, 138–148, 1992.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  8. B. Goldengorin, D. Ghosh, and G. Sierksma. Equivalent Instances of the Simple Plant Location Problem. SOM Research Report-00A54, 2000.

    Google Scholar 

  9. P. L. Hammer. Plant Location — A Pseudo-Boolean Approach. Israel Journal of Technology 6, 330–332, 1968.

    Google Scholar 

  10. P. C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye and J. L. Zydiak. Specially Structured Uncapacitated Facility Location Problems. Operations Research 43, 661–669, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. W. Pentico. The Discrete Two-Dimensional Assortment Problem. Operations Research 36, 324–332, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  12. C. S. Revelle and G. Laporte. The Plant Location Problem: New Models and Research Prospects. Operations Research 44, 864–874, 1996.

    Article  MATH  Google Scholar 

  13. A. Tripathy, Süral, and Y. Gerchak. Multidimensional Assortment Problem with an Application. Networks 33, 239–245, 1999.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV, Groningen, The Netherlands

    Boris Goldengorin, Diptesh Ghosh & Gerard Sierksma

Authors
  1. Boris Goldengorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diptesh Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerard Sierksma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, BRICS, 8000, Åarhus, Denmark

    Gerth Stølting Brodal

  2. Dipartimento di Ingegneria Elettrica, Universitá dell’Aquila, Poggio di Roio, 67040, L’Aquila, Italy

    Daniele Frigioni

  3. Dipartimento di Informatica e Sistemistica, Universitá di Roma “La Sapienza”, via Salaria 113, 00198, Roma, Italy

    Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldengorin, B., Ghosh, D., Sierksma, G. (2001). Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds) Algorithm Engineering. WAE 2001. Lecture Notes in Computer Science, vol 2141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44688-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44688-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42500-7

  • Online ISBN: 978-3-540-44688-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation