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

Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Thiago P. Jeronimo


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.


Location Theory; Limited Distances; Capacity Constraints

Full Text:


DOI: http://dx.doi.org/10.14488/BJOPM.2017.v14.n2.a1

Copyright (c) 2017 Brazilian Journal of Operations & Production Management



Brazilian Association for Industrial Engineering and Operations Management (ABEPRO)

Av. Almirante Barroso, Nº 63 - Sala 417 - Centro - Rio de Janeiro - RJ - BRASIL - CEP: 20031-003

Todos os direitos reservados © 2008 - ABEPRO - Melhor visualizado no Internet Explorer 5.5 ou superior