A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints

  • Isaac F. Fernandes Federal University of Rio Grande do Norte
  • Daniel Aloise Federal University of Rio Grande do Norte
  • Dario J. Aloise
  • Thiago P. Jeronimo
Keywords: Location Theory, Limited Distances, Capacity Constraints

Abstract

The objective in terms of the facility location problem with limited distances is to minimize the sum of distance functions from the facility to its clients, but with a limit on each of these distances, from which the corresponding function becomes constant. The problem is applicable in situations where the service provided by the facility is insensitive after given threshold distances. In this paper, we propose a polynomial-time algorithm for the discrete version of the problem with capacity constraints regarding the number of served clients. These constraints are relevant for introducing quality measures in facility location decision processes as well as for justifying the facility creation.
Published
2017-07-23
How to Cite
F. Fernandes, I., Aloise, D., J. Aloise, D., & P. Jeronimo, T. (2017). A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints. Brazilian Journal of Operations & Production Management, 14(2), 136-144. https://doi.org/https://doi.org/10.14488/BJOPM.2017.v14.n2.a1
Section
Articles