IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v138y2020ics1366554519306970.html
   My bibliography  Save this article

The facility location problem with capacity transfers

Author

Listed:
  • Corberán, Ángel
  • Landete, Mercedes
  • Peiró, Juanjo
  • Saldanha-da-Gama, Francisco

Abstract

This paper explores the concept of capacity transfer in the context of capacitated facility location problems. This is accomplished by assuming that facilities with surplus capacity/production can cooperate with those facing shortage by transferring part of that capacity/production. Such a transfer incurs a cost that nonetheless may be compensated by savings both in the installation costs and in the distribution costs. Mixed-integer mathematical programming models are proposed for the problem. A distinction is made between the case in which the triangle inequality holds for the transfer costs and the case in which it does not. We present compact models, which are enhanced with valid inequalities that are separated in a branch-and-cut fashion. A comprehensive computational study with several hundreds of instances is reported showing the value of transferring capacities. Overall, this work investigates a problem that is at the core of more comprehensive models emerging in the context of logistics network design.

Suggested Citation

  • Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2020. "The facility location problem with capacity transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    • Handle: RePEc:eee:transe:v:138:y:2020:i:c:s1366554519306970
    DOI: 10.1016/j.tre.2020.101943
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554519306970
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.101943?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Pasquale Avella & Maurizio Boccia, 2009. "A cutting plane algorithm for the capacitated facility location problem," Computational Optimization and Applications, Springer, vol. 43(1), pages 39-65, May.
    3. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    4. AGHEZZAF, El-Houssaine, 2005. "Capacity planning and warehouse location in supply chains with uncertain demands," LIDAM Reprints CORE 1808, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    6. Francisco Fernández & MarÍa Fiestras-Janeiro & Ignacio GarcÍa-Jurado & Justo Puerto, 2005. "Competition and Cooperation in Non-Centralized Linear Production Games," Annals of Operations Research, Springer, vol. 137(1), pages 91-100, July.
    7. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    8. Raghavan, S. & Sahin, Mustafa & Salman, F. Sibel, 2019. "The capacitated mobile facility location problem," European Journal of Operational Research, Elsevier, vol. 277(2), pages 507-520.
    9. Albareda-Sambola, Maria & Landete, Mercedes & Monge, Juan F. & Sainz-Pardo, José L., 2017. "Introducing capacities in the location of unreliable facilities," European Journal of Operational Research, Elsevier, vol. 259(1), pages 175-188.
    10. Simon Görtz & Andreas Klose, 2012. "A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 597-610, November.
    11. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    12. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    13. Fiestras-Janeiro, M.G. & García-Jurado, I. & Meca, A. & Mosquera, M.A., 2015. "Cooperation on capacitated inventory situations with fixed holding costs," European Journal of Operational Research, Elsevier, vol. 241(3), pages 719-726.
    14. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    15. Cornuejols, G. & Sridharan, R. & Thizy, J. M., 1991. "A comparison of heuristics and relaxations for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 50(3), pages 280-297, February.
    16. Justo Puerto & Ignacio Garcı´a-Jurado & Francisco R. Fernández, 2001. "On the core of a class of location games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(3), pages 373-385, December.
    17. Jordi Castro & Stefano Nasini & Francisco Saldanha-Da-Gama, 2017. "A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method," Post-Print hal-01745324, HAL.
    18. Cortinhal, Maria Joao & Captivo, Maria Eugenia, 2003. "Upper and lower bounds for the single source capacitated location problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 333-351, December.
    19. Guardiola, Luis A. & Meca, Ana & Puerto, Justo, 2009. "Production-inventory games: A new class of totally balanced combinatorial optimization games," Games and Economic Behavior, Elsevier, vol. 65(1), pages 205-219, January.
    20. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
    21. Mercedes Landete & Gilbert Laporte, 2019. "Facility location problems with user cooperation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 125-145, April.
    22. Xufei Liu & Changhyun Kwon, 2020. "Exact robust solutions for the combined facility location and network design problem in hazardous materials transportation," IISE Transactions, Taylor & Francis Journals, vol. 52(10), pages 1156-1172, October.
    23. Fischetti, Matteo & Ljubić, Ivana & Sinnl, Markus, 2016. "Benders decomposition without separability: A computational study for capacitated facility location problems," European Journal of Operational Research, Elsevier, vol. 253(3), pages 557-569.
    24. E Aghezzaf, 2005. "Capacity planning and warehouse location in supply chains with uncertain demands," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 453-462, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zaharudin, Zati Aqmar & Brint, Andrew & Genovese, Andrea, 2022. "A multi-period model for reorganising urban household waste recycling networks," Socio-Economic Planning Sciences, Elsevier, vol. 84(C).
    2. Saldanha-da-Gama, Francisco, 2022. "Facility Location in Logistics and Transportation: An enduring relationship," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Yingyi Huang & Xinyu Wang & Hongyan Chen, 2022. "Location Selection for Regional Logistics Center Based on Particle Swarm Optimization," Sustainability, MDPI, vol. 14(24), pages 1-10, December.
    4. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    5. Anton-Sanchez, Laura & Landete, Mercedes & Saldanha-da-Gama, Francisco, 2023. "The discrete p-center location problem with upgrading," Omega, Elsevier, vol. 119(C).
    6. Alejandro Moya-Martínez & Mercedes Landete & Juan Francisco Monge, 2021. "Close-Enough Facility Location," Mathematics, MDPI, vol. 9(6), pages 1-17, March.
    7. Rajendran, Suchithra & Srinivas, Sharan, 2020. "Air taxi service for urban mobility: A critical review of recent developments, future challenges, and opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    8. Barbato, Michele & Ceselli, Alberto & Premoli, Marco, 2023. "On the impact of resource relocation in facing health emergencies," European Journal of Operational Research, Elsevier, vol. 308(1), pages 422-435.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Weninger, Dieter & Wolsey, Laurence A., 2023. "Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing," European Journal of Operational Research, Elsevier, vol. 310(1), pages 84-99.
    2. Christensen, Tue Rauff Lind & Klose, Andreas, 2021. "A fast exact method for the capacitated facility location problem with differentiable convex production costs," European Journal of Operational Research, Elsevier, vol. 292(3), pages 855-868.
    3. Sahling, Florian & Kayser, Ariane, 2016. "Strategic supply network planning with vendor selection under consideration of risk and demand uncertainty," Omega, Elsevier, vol. 59(PB), pages 201-214.
    4. Avella, P. & Boccia, M. & Mattia, S. & Rossi, F., 2021. "Weak flow cover inequalities for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 289(2), pages 485-494.
    5. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    6. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    7. Ariane Kayser & Florian Sahling, 2023. "Relocatable modular capacities in risk aware strategic supply network planning under demand uncertainty," Schmalenbach Journal of Business Research, Springer, vol. 75(1), pages 1-35, March.
    8. Fischetti, Matteo & Ljubić, Ivana & Sinnl, Markus, 2016. "Benders decomposition without separability: A computational study for capacitated facility location problems," European Journal of Operational Research, Elsevier, vol. 253(3), pages 557-569.
    9. Guastaroba, G. & Speranza, M.G., 2014. "A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 438-450.
    10. Kınay, Ömer Burak & Saldanha-da-Gama, Francisco & Kara, Bahar Y., 2019. "On multi-criteria chance-constrained capacitated single-source discrete facility location problems," Omega, Elsevier, vol. 83(C), pages 107-122.
    11. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    12. M. Fattahi & M. Mahootchi & S. M. Moattar Husseini, 2016. "Integrated strategic and tactical supply chain planning with price-sensitive demands," Annals of Operations Research, Springer, vol. 242(2), pages 423-456, July.
    13. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    14. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    15. Gilani, Hani & Sahebi, Hadi, 2022. "A data-driven robust optimization model by cutting hyperplanes on vaccine access uncertainty in COVID-19 vaccine supply chain," Omega, Elsevier, vol. 110(C).
    16. Simon Görtz & Andreas Klose, 2012. "A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 597-610, November.
    17. Maria Albareda-Sambola & Elena Fernández & Yolanda Hinojosa & Justo Puerto, 2010. "The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 43-61, July.
    18. Jakubovskis, Aldis, 2017. "Flexible production resources and capacity utilization rates: A robust optimization perspective," International Journal of Production Economics, Elsevier, vol. 189(C), pages 77-85.
    19. Govindan, Kannan & Fattahi, Mohammad, 2017. "Investigating risk and robustness measures for supply chain network design under demand uncertainty: A case study of glass supply chain," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 680-699.
    20. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:138:y:2020:i:c:s1366554519306970. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.