Abstract
In this study we investigate the single source location problem with the presence of several possible capacities and the opening (fixed) cost of a facility that is depended on the capacity used and the area where the facility is located. Mathematical models of the problem for both the discrete and the continuous cases using the Rectilinear and Euclidean distances are produced. Our aim is to find the optimal number of open facilities, their corresponding locations, and their respective capacities alongside the assignment of the customers to the open facilities in order to minimise the total fixed and transportation costs. For relatively large problems, two solution methods are proposed namely an iterative matheuristic approach and VNS-based matheuristic technique. Dataset from the literature is adapted to assess our proposed methods. To assess the performance of the proposed solution methods, the exact method is first applied to small size instances where optimal solutions can be identified or lower and upper bounds can be recorded. Results obtained by the proposed solution methods are also reported for the larger instances.
Similar content being viewed by others
References
Akyüs, M. H., Altnel, I. K., & Öncan, T. (2014). Location and allocation based branch and bound algorithms for the capacitated multi-facility weber problem. Annals of Operations Research, 222(1), 45–71.
Aras, N., Altnel, I. K., & Orbay, M. (2007a). New heuristic methods for the capacitated multi-facility weber problem. Naval Research Logistics, 54, 21–32.
Aras, N., Yumusak, S., & Altnel, I. K. (2007b). Solving the capacitated multi-facility weber problem by simulated annealing, threshold accepting and genetic algorithms. In K. F. Doerner, P. G. Gendreau, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Progress in complex systems optimization: Metaheuristics (pp. 91–112). Berlin: Springer.
Aras, N., Orbay, M., & Altnel, I. K. (2008). Efficient heuristics for the rectilinear distance capacitated multi-facility weber problem. Journal of the Operational Research Society, 59, 64–79.
Arostegui, M. A, Jr., Kadipasaoglu, S. N., & Khumawala, B. M. (2008). An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103, 742–754.
Aydin, N., & Murat, A. (2013). A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem. International Journal of Production Economics, 145, 173–183.
Brimberg, J., & Mladenović, N. (1996). A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies of Locational Analysis, 10, 1–12.
Brimberg, J., & Salhi, S. (2005). A continuous location-allocation problem with zone-dependent fixed cost. Annals of Operations Research, 136, 99–115.
Brimberg, J., Hansen, P., Mladenović, N., & Taillard, E. D. (2000). Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Operations Research, 48, 444–460.
Brimberg, J., Mladenović, N., & Salhi, S. (2004). The multi-source weber problem with constant opening cost. Journal of the Operational Research Society, 55, 640–646.
Brimberg, J., Hansen, P., Mladenović, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1–12.
Brimberg, J., Drezner, Z., Mladenović, N., & Salhi, S. (2014). A new local search for continuous location problems. European Journal of Operational Research, 232, 256–265.
Chen, C. H., & Ting, C. J. (2008). Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transportation Research Part E: Logistics and Transportation Review, 44(6), 1099–1122.
Chernov, N., Stoyan, Y., & Romanova, T. (2010). Mathematical model and efficient algorithms for objects packing problem. Computational Geometry: Theory and Applications, 43, 535–553.
Contreras, A. I., & Díaz, J. A. (2008). Scatter search for the single source capacitated facility location problem. Annals of Operations Research, 157(1), 73–89.
Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6, 37–53.
Cooper, L. (1972). The transportation-location problem. Operations Research, 20, 94–108.
Correia, I., & Captivo, M. E. (2003). A Lagrangean heuristic for a modular capacitated location problem. Annals of Operations Research, 122, 141–161.
Correia, I., Gouveia, L., & Saldanha-da Gama, F. (2010a). Discretized formulations for capacitated location problems with modular distribution costs. European Journal of Operational Research, 204, 237–244.
Correia, I., Nickel, S., & Saldanha-da Gama, F. (2010b). Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B, 44, 1047–1066.
Daskin, M. S. (2008). What you should know about location modelling. Naval Research Logistics, 55, 283–294.
Drezner, T., Drezner, Z., & Salhi, S. (2006). A multi objective heuristic approach for the casualty collection points location problem. Journal of the Operational Research Society, 57, 727–734.
Drezner, Z., & Hamacher, H. (2002). Facility location: Applications and theory. New York: Springer.
Eiselt, H. A., & Marianov, V. (Eds.). (2011). Foundations of location analysis (Vol. 155). New York: Springer.
Farahani, R. Z., Masoud Hekmatfar, M., Fahimnia, B., & Kazemzadeh, N. (2014). Hierarchical facility location problem: Models, classifications, techniques, and applications. Computers and Industrial Engineering, 68, 104–117.
Gadegaard, S. L., Klose, A., & Nielsen, L. R. (2016). A bi-objective approach to discrete cost-bottleneck location problems. Annals of Operations Research,. https://doi.org/10.1007/s10479-016-2360-8.
Gamal, M. D. H., & Salhi, S. (2001). Constructive heuristics for the uncapacitated location-allocation problem. Journal of the Operational Research Society, 51, 1233–1240.
Gamal, M. D. H., & Salhi, S. (2003). A cellular heuristic for the multisource weber problem. Computers and Operations Research, 30, 1609–1624.
Gong, D., Gen, M., Yamazaki, G., & Xu, W. (1997). Hybrid evolutionary method for capacitated location-allocation problem. Computers and Industrial Engineering, 33, 577–580.
Guastaroba, G., & Speranza, M. G. (2014). A heuristic for bilp problems: The single source capacitated facility location problem. European Journal of Operational Research, 238, 438–450.
Hale, T., & Moberg, C. (2003). Location science research: A review. Annals of Operations Research, 123, 21–35.
Hansen, P., & Mladenović, N. (1997). Variable neighbourhood search for the p-median. Location Science, 5(4), 207–225.
Hansen, P., & Mladenović, N. (2001). Variable neighbourhood search: Principles and applications. European Journal of Operational Research, 130(3), 449–467.
Hansen, P., Mladenović, N., & Taillard, E. D. (1998). Heuristic of the multisource weber problem as a p-median problem. Operation Research Letters, 22, 55–62.
Hansen, P., Mladenović, N., & Perez, J. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175(1), 367–407.
Ho, S. C. (2015). An iterated Tabu search heuristic for the single source capacitated facility location problem. Applied Soft Computing, 27, 169–178.
Hosseininezhad, S. J., Salhi, S., & Jabalameli, M. S. (2015). A cross entropy-based heuristic for the capacitated multi-source weber problem with facility fixed cost. Computers and Industrial Engineering, 83, 151–158.
Irawan, C. A., Salhi, S., Luis, M., & Azizi, N. (2017). The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approaches. European Journal of Operational Research, 263, 94–107.
Klose, A., & Drexl, A. (2005). Facility location models for distribution system design. European Journal of Operational Research, 162, 4–29.
Lin, C. K. Y. (2009). Stochastic single-source capacitated facility location model with service level requirements. International Journal of Production Economics, 117, 439–451.
Luis, M., Salhi, S., & Nagy, G. (2009). Region-rejection based heuristics for the capacitated multi-source weber problem. Computers and Operations Research, 36, 2007–2017.
Luis, M., Salhi, S., & Nagy, G. (2011). A guided reactive grasp for the capacitated multi-source weber problem. Computers and Operations Research, 38, 1014–1024.
Luis, M., Salhi, S., & Nagy, G. (2015). A constructive method and a guided hybrid grasp for the capacitated multi-source weber problem in the presence of fixed cost. Journal of Algorithms and Computational Technology, 9, 215–232.
Manzour-al Ajdad, S. M. H., Torabi, S. A., & Eshghi, K. (2012). Single-source capacitated multi-facility weber problem—An iterative two phase heuristic algorithm. Computers and Operations Research, 39, 1465–1476.
Manzour, H., Torabi, A., & Pishvaee, M. S. (2013). New heuristic methods for the single-source capacitated multi facility weber problem. International Journal of Advanced Manufacturing Technology, 69, 1569–1579.
Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13, 182–196.
Mohammadi, N., Malek, M. R., & Alesheikh, A. A. (2010). A new GA based solution for capacitated multi source weber problem. International Journal of Computational Intelligence Systems, 3, 514–521.
Öncan, T. (2013). Heuristics for the single source capacitated multi-facility weber problem. Computers and Industrial Engineering, 64, 959–971.
Rahmani, A., & MirHassani, S. A. (2014). A hybrid firefly-genetic algorithm for the capacitated facility location problem. Information Sciences, 283, 70–78.
Salhi, S. (2017). Heuristic search: The emerging science of problem solving. Basel: Springer.
Salhi, S., & Nagy, G. (2009). Local improvement in planar facility location using vehicle routing. Annals of Operations Research, 167, 287–296.
Sherali, H. D., & Nordai, F. L. (1988). Np-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Mathematics of Operations Research, 13, 32–49.
Yang, Z., Chu, F., & Chen, H. (2012). A cut-and-solve based algorithm for the single source capacitated facility location problem. European Journal of Operational Research, 221(3), 521–532.
Zainuddin, Z. M., & Salhi, S. (2007). A perturbation-based heuristic for the capacitated multisource weber problem. European Journal of Operational Research, 179, 1194–1207.
Acknowledgements
We would like to thank the referees for their interesting suggestions that improved both the content as well as the presentation of the paper. The third author is supported in part by the Spanish Ministry of Economy and Competitiveness Research Project MTM2015-70260-P.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Irawan, C.A., Luis, M., Salhi, S. et al. The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem. Ann Oper Res 275, 367–392 (2019). https://doi.org/10.1007/s10479-018-3014-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-3014-9