Close-Enough Facility Location

Alejandro Moya-Martínez, Mercedes Landete and Juan Francisco Monge
Additional contact information
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

Mathematics, 2021, vol. 9, issue 6, 1-17

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.

Keywords: location science; branch and price; pickup points (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/6/670/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/6/670/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:6:p:670-:d:521468

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().