Abstract
This paper considers the Single Source Capacitated Facility Location Problem (SSCFLP). We propose a Scatter Search approach to provide upper bounds for the optimal solution of the problem. The proposed approach uses GRASP to initialize the Reference Set. Solutions of the Reference Set are combined using a procedure that consists of two phases: (1) the initialization phase and (2) the improvement phase. During the initialization phase each client is assigned to an open facility to obtain a solution that is then improved with the improvement phase. Also, a tabu search algorithm is applied. In order to evaluate the proposed approach we use different sets of test problems. According to the results obtained we observe that the method provides good quality solutions with reasonable computational effort.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R., Orlin, J., Pallottino, S., Scaparra, M., & Scutellà, M. (2004). A multi-exchange heuristic for the single-source capacitated facility location problem. Management Science, 50(6), 749–760.
Barceló, J., & Casanovas, J. (1984). A heuristic algorithm for the capacitated plant location problem. European Journal of Operational Research, 15(2), 212–226.
Barceló, J., Fernández, E., Hallefjord, A., & Jörnsten, K. (1990). Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. Operations Research Spektrum, 12(12), 79–88.
Barceló, J., Fernández, E., & Jörnsten, K. (1991). Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research, 53(1), 38–45.
Beasley, J. (1993). Lagrangean heuristics for location problems. European Journal of Operational Research, 65(3), 383–399.
Cortinhal, M., & Captivo, M. (2003). Upper and lower bounds for the single source capacitated location problem. European Journal of Operational Research, 151(2), 333–351.
Darby-Dowman, K., & Lewis, H. (1988). Lagrangian relaxation and the single source capacitated facility location problem. Journal of the Operational Research Society, 39(11), 1035–1040.
Delmaire, H., Díaz, J., Fernández, E., & Ortega, M. (1999a). Comparing new heuristics for the pure integer capacitated plant location problem. Investigación Operativa, 1–3, 217–242.
Delmaire, H., Díaz, J., Fernández, E., & Ortega, M. (1999b). Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. Information Systems and Operational Research, 37(3), 194–225.
Díaz, J., & Fernández, E. (2002). A branch-and-price algorithm for the single-source capacitated plant location problem. Journal of the Operational Research Society, 53(7), 728–740.
Feo, T., & Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.
Glover, F. (1997). A template for scatter search and path relinking. In J. Hao, E. Lutton, E. Rolland & M. Schoenauer (Eds.), Lecture notes in computer science (Vol. 1363, pp. 13–54).
Glover, F. (1999). Scatter search and path relinking, In D. Corne, M. Dorigo & F. Glover (Eds.), New ideas in optimization (pp. 297–316).
Hindi, K., & Pieńkosz, K. (1999). Efficient solution of large scale, single-source, capacitated plant location problem. Journal of the Operational Research Society, 50(3), 268–274.
Holmberg, K., Rönnqvist, M., & Yuan, D. (1999). An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research, 113(3), 544–559.
Klincewics, J., & Luss, H. (1986). A Lagrangian relaxation heuristic for the capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37(5), 495–500.
Laguna, M., & Martí, R. (2003). Scatter search: methodology and implementations in C. Boston: Kluwer Academic.
Martí, R. (2006). Scatter search: wellsprings and challenges. European Journal of Operational Research, 169(2), 351–358.
Mirchandani, P. B., & Francis, R. L. e. (1990). Discrete location theory. Wiley: New York.
Neebe, A., & Rao, M. (1983). An algorithm for the fixed-charge assigning users to source problem. Journal of the Operational Research Society, 34(11), 1107–1113.
Pirkul, H. (1987). Efficient algorithms for the capacitated concentrator problem. Computers & Operations Research, 14(3), 197–208.
Rönnqvist, M., Tragantalerngsak, S., & Holt, J. (1999). A repeated matching heuristic for the single-source capacitated facility location problem. European Journal of Operational Research, 116(1), 51–68.
Sridharan, R. (1993). A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research, 66(3), 305–312.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Contreras, I.A., Díaz, J.A. Scatter search for the single source capacitated facility location problem. Ann Oper Res 157, 73–89 (2008). https://doi.org/10.1007/s10479-007-0193-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0193-1