In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.
 K. Holmberg, M. Ronnqvist and D. Yuan, “An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing,” European Journal of Operational Research, Vol. 113, No. 3, 1999, pp. 544-559. doi:10.1016/S0377-2217(98)00008-3
 S. Melkote and M. S. Daskin, “Capacitated Facility Loca tion-Network Design Problems,” European Journal of Operational Research, Vol. 129, No. 3, 2001, pp. 481 495. doi:10.1016/S0377-2217(99)00464-6
 R. K. Ahuja, J. B. Orlin, S. Pallottino, M. P. Scaparra and M. G. Scutella, “A Multiexchange Heuristic for the Sin gle-Source Capacitated Facility Location Problem,” Man agement Science, Vol. 50, No. 6, 2004, pp. 749-760. doi:10.1287/mnsc.1030.0193
 I. A. Contreras and J. A. Diaz, “Scatter Search for the Single Source Capacitated Facility Location Problem,” Annals of Operations Research, Vol. 157, No. 1, 2008, pp. 73-89. doi:10.1007/s10479-007-0193-1
 M. Leitner and G. R. Raidl, “A Lagrangian Decomposi tion Based Heuristic for Capacitated Connected Facility Location,” In: S. VoB and M. Caserta, Eds., Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, 13-16 July 2009.
 G. Cornuejols, R. Sridharn and J. Thizy, “A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem,” European Journal and Opertional Research, Vol. 50, No. 3, 1991, pp. 280-297. doi:10.1016/0377-2217(91)90261-S