Skip to main content
SpringerLink
Log in

Observations on some heuristic methods for the capacitated facility location problem

  • Technical Note
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

We consider a few types of heuristics, namely, add-drop-interchange, Lagrangean relaxation-based and random rounding heuristics for the capacitated facility location problem. Some instances of the problem are constructed and performance, with respect to such instances, of the heuristics is studied. It is observed that, performance of the heuristics is often not satisfactory. The instances presented in this article may be used as some critical instances to test heuristics for the problem.

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

References

  1. Avella, P., Boccia, M., Sforza, A., Vasilev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15, 597–615 (2009)

    Article  Google Scholar 

  2. Barahona, F., Chudak, F.: Near-optimal solutions to large-scale facility location problems. Discret. Optim. 2, 35–50 (2005)

    Article  Google Scholar 

  3. Barcelo, J., Casanovas, J.: A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15, 212–226 (1984)

    Article  Google Scholar 

  4. Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)

    Article  Google Scholar 

  5. Cornuejols, G., Sridharan, R., Thizy, J.M.: A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50, 280–297 (1991)

    Article  Google Scholar 

  6. Drezner, Z. (ed.): Facility Location: A Survey of Applications and Methods. Springer, New York (1995)

    Google Scholar 

  7. Domschke, W., Drexl, A.: ADD-heuristics’ starting procedures for capacitated plant location problems. Eur. J. Oper. Res. 21, 47–53 (1985)

    Article  Google Scholar 

  8. Geoffrion, A.M., McBride, R.: Lagrangean relaxation applied to capacitated facility location problem. AIIE Trans. 10, 40–47 (1978)

    Google Scholar 

  9. Jacobsen, S.K.: Heuristics for the capacitated plant location problem. Eur. J. Oper. Res. 12, 253–261 (1983)

    Article  Google Scholar 

  10. Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146–188 (2000)

    Article  Google Scholar 

  11. Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643–666 (1963)

    Article  Google Scholar 

  12. Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. Proc. of the 29th ACM Symposium on Theory of Computing 265–274 (1997)

  13. Sinha, P.: Performance of an add-drop-interchange heuristic for the capacitated facility location problem. Int. J. Appl. Manag. Sci. 1, 388–400 (2009)

    Article  Google Scholar 

Download references

Acknowledgment

We thank the reviewer very much for the suggestions to improve the article. We thank all who have helped directly and indirectly in writing it.

Author information

Authors and Affiliations

  1. Operations Management & Research, 6 A J C Bose Road; Thakurpukur, Kolkata, 700063, West Bengal, India

    Pritibhushan Sinha

Authors
  1. Pritibhushan Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pritibhushan Sinha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sinha, P. Observations on some heuristic methods for the capacitated facility location problem. OPSEARCH 49, 86–93 (2012). https://doi.org/10.1007/s12597-012-0064-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0064-7

Keywords

Search

Navigation