IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i6p670-d521468.html
   My bibliography  Save this article

Close-Enough Facility Location

Author

Listed:
  • Alejandro Moya-Martínez

    (Center of Operations Research, University Miguel Hernandez of Elche, Avda. de la Universidad s/n, 03202 Elche Alicante, Spain)

  • Mercedes Landete

    (Center of Operations Research, University Miguel Hernandez of Elche, Avda. de la Universidad s/n, 03202 Elche Alicante, Spain)

  • Juan Francisco Monge

    (Center of Operations Research, University Miguel Hernandez of Elche, Avda. de la Universidad s/n, 03202 Elche Alicante, Spain)

Abstract

This paper introduces the concept of close-enough in the context of facility location. It is assumed that customers are willing to move from their homes to close-enough pickup locations. Given that the number of pickup locations is expanding every day, it is assumed that pickup locations can be placed everywhere. Conversely, the set of potential location for opening facilities is discrete as well as the set of customers. Opening facilities and pickup points entails an installation budget and a distribution cost to transport goods from facilities to customers and pickup locations. The ( p , t ) -Close-Enough Facility Location Problem is the problem of deciding where to locate p facilities among the finite set of candidates, where to locate t pickup points in the plane and how to allocate customers to facilities or to pickup points so that all the demand is satisfied and the total cost is minimized. In this paper, it is proved that the set of initial infinite number of pickup locations is finite in practice. Two mixed-integer linear programming models are proposed for the discrete problem. The models are enhanced with valid inequalities and a branch and price algorithm is designed for the most promising model. The findings of a comprehensive computational study reveal the performance of the different models and the branch and price algorithm and illustrate the value of pickup locations.

Suggested Citation

  • Alejandro Moya-Martínez & Mercedes Landete & Juan Francisco Monge, 2021. "Close-Enough Facility Location," Mathematics, MDPI, vol. 9(6), pages 1-17, March.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:6:p:670-:d:521468
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/6/670/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/6/670/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ivan Contreras & Juan A. Díaz & Elena Fernández, 2011. "Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 41-55, February.
    2. 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).
    3. Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto, 2020. "A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 582-599, July.
    4. Sibel A. Alumur & Bahar Y. Kara & M. Teresa Melo, 2015. "Location and Logistics," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 419-441, Springer.
    5. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2019. "Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 38-63.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    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. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    2. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    3. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Roni, Md.S. & Eksioglu, Sandra D. & Searcy, Erin & Jha, Krishna, 2014. "A supply chain network design model for biomass co-firing in coal-fired power plants," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 115-134.
    5. Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto, 2020. "A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 582-599, July.
    6. Sneha Dhyani Bhatt & Sachin Jayaswal & Ankur Sinha & Navneet Vidyarthi, 2021. "Alternate second order conic program reformulations for hub location under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 304(1), pages 481-527, September.
    7. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    8. Landete, Mercedes & Peiró, Juanjo, 2024. "Some new clique inequalities in four-index hub location models," European Journal of Operational Research, Elsevier, vol. 318(3), pages 768-777.
    9. Martins, C.L. & Melo, M.T. & Pato, M.V., 2019. "Redesigning a food bank supply chain network in a triple bottom line context," International Journal of Production Economics, Elsevier, vol. 214(C), pages 234-247.
    10. Martins, C. L. & Melo, Teresa & Pato, Margarida Vaz, 2016. "Redesigning a food bank supply chain network, Part I: Background and mathematical formulation," Technical Reports on Logistics of the Saarland Business School 10, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    11. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.
    12. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    13. Martello, Silvano & Pinto Paixão, José M., 2012. "A look at the past and present of optimization – An editorial," European Journal of Operational Research, Elsevier, vol. 219(3), pages 638-640.
    14. 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.
    15. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "Benders Decomposition for Large-Scale Uncapacitated Hub Location," Operations Research, INFORMS, vol. 59(6), pages 1477-1490, December.
    16. Hu, Lu & Zhu, Juan Xiu & Wang, Yuan & Lee, Loo Hay, 2018. "Joint design of fleet size, hub locations, and hub capacities for third-party logistics networks with road congestion constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 568-588.
    17. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    18. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    19. Benati, Stefano & Ponce, Diego & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "A branch-and-price procedure for clustering data that are graph connected," European Journal of Operational Research, Elsevier, vol. 297(3), pages 817-830.
    20. Cortinhal, M. J. & Lopes, M. J. & Melo, M. T., 2018. "Impact of partial product outsourcing, transportation mode selection, and single-assignment requirements on the design of a multi-stage supply chain network," Technical Reports on Logistics of the Saarland Business School 15, Saarland University of Applied Sciences (htw saar), Saarland Business School.

    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:gam:jmathe:v:9:y:2021:i:6:p:670-:d:521468. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.