, Volume 49, Issue 1, pp 86–93 | Cite as

Observations on some heuristic methods for the capacitated facility location problem

  • Pritibhushan Sinha
Technical Note


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.


Capacitated facility location problem Heuristics Problem instances 



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.


  1. 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)CrossRefGoogle Scholar
  2. 2.
    Barahona, F., Chudak, F.: Near-optimal solutions to large-scale facility location problems. Discret. Optim. 2, 35–50 (2005)CrossRefGoogle Scholar
  3. 3.
    Barcelo, J., Casanovas, J.: A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15, 212–226 (1984)CrossRefGoogle Scholar
  4. 4.
    Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)CrossRefGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Drezner, Z. (ed.): Facility Location: A Survey of Applications and Methods. Springer, New York (1995)Google Scholar
  7. 7.
    Domschke, W., Drexl, A.: ADD-heuristics’ starting procedures for capacitated plant location problems. Eur. J. Oper. Res. 21, 47–53 (1985)CrossRefGoogle Scholar
  8. 8.
    Geoffrion, A.M., McBride, R.: Lagrangean relaxation applied to capacitated facility location problem. AIIE Trans. 10, 40–47 (1978)Google Scholar
  9. 9.
    Jacobsen, S.K.: Heuristics for the capacitated plant location problem. Eur. J. Oper. Res. 12, 253–261 (1983)CrossRefGoogle Scholar
  10. 10.
    Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146–188 (2000)CrossRefGoogle Scholar
  11. 11.
    Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643–666 (1963)CrossRefGoogle Scholar
  12. 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)Google Scholar
  13. 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)CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2012

Authors and Affiliations

  1. 1.Operations Management & ResearchKolkataIndia

Personalised recommendations