Skip to main content
SpringerLink
Log in

A branch and bound algorithm for the partial coverage capacitated plant location problem

  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In this paper, a branch and bound algorithm for the partial coverage capacitated facility locations problem is developed. We have to fix open a set of warehouses which are economically feasible. It is an extension of the algorithm given by B. M. Khumawala [10] and Sudha Arora and S.R. Arora [2]. The case when the demand of the customer may not be satisfied completely, giving rise to “opportunity demand” is also discussed. This is illustrated with the help of examples and their computational results.

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

Reference

  1. Ling Yun Wu, Xiang Sun Zhang and Ju Liang Zhang, “Capacitated facility location problem with general set up cost”, Computer & Operation Research, 33 (2006) 1226–1241.

    Article  Google Scholar 

  2. Sudha Arora and S.R. Arora “Branch and bound algorithms for the warehouse location problem with the objective function as linear fractional”, Opsearch 43 (2006) pp 18–30.

    Google Scholar 

  3. Eric Gourdin, Martine Lafle and Hande Yamah “Tele-communication and location” in “Facility Location: Application and Theory” Ed. Drezner and Horst W Hamacker. Springer Berlin (2004) 275–302.

  4. F.J. Vasko, D.D. Newhart K.L. Stott Jr. and F.E. Wolf “A large scale application of the partial coverage incapacitated faculty location problem”, Journal of the Operational Research Society 54 (2003) pp 11–20.

    Article  Google Scholar 

  5. A. Klose, “An LP based heuristic for the two stage capacitated facility location problem”, Journal of operational Research, 50 (1999) 157–166.

    Article  Google Scholar 

  6. Z. Drezner “Facility Location: A survey of application and methods”, Springer, New York 1995.

    Book  Google Scholar 

  7. N. Christofides and J E Beasley, “Extensions to a lagragean relaxation approach for the capacitated warehouse location problem.” European Journal of Operational Research, 12 (1983) 19–28.

    Article  Google Scholar 

  8. Robert M Nauss, “An improved algorithm for the capacitated facility location problem.” Journal of Operational Research Society, 29 (1978) 1195–1202.

    Article  Google Scholar 

  9. U. Akinc and Basheer M. Khumawala, “An efficient branch and bound algorithm for the capacitated warehouse location problem.” Management Science, 23 (1978) 585–594.

    Article  Google Scholar 

  10. Basheer M Khumawala, “An efficient branch and bound algorithm for the warehouse location problem”, Management Science, 18 (1972) 718–731.

    Article  Google Scholar 

  11. P.S. Davis and T. L. Ray, “A branch-bound algorithm for the capacitated facilities location problem.” Naval Research Logistic Quarterly, 76 (1969) 331–343.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Deen Dayal Upadhyaya College, University of Delhi, Shivaji Marg, 110015, Karam Pura, Delhi, India

    Sudha Arora

  2. Department of Mathematics, Hansraj College, University of Delhi, 110007, Delhi, India

    S. R. Arora

Authors
  1. Sudha Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. R. Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sudha Arora.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arora, S., Arora, S.R. A branch and bound algorithm for the partial coverage capacitated plant location problem. OPSEARCH 45, 139–154 (2008). https://doi.org/10.1007/BF03398810

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398810

Keywords

Search

Navigation