A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Brazilian Journal of Operations & Production Management (Online) |
Texto Completo: | https://bjopm.org.br/bjopm/article/view/V14N2A1 |
Resumo: | 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. |
id |
ABEPRO_251f911b7d64d995a919d9c6bd7c1d52 |
---|---|
oai_identifier_str |
oai:ojs.bjopm.org.br:article/143 |
network_acronym_str |
ABEPRO |
network_name_str |
Brazilian Journal of Operations & Production Management (Online) |
repository_id_str |
|
spelling |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraintsLocation TheoryLimited DistancesCapacity ConstraintsThe 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.Brazilian Association for Industrial Engineering and Operations Management (ABEPRO)2017-07-23info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionPeer-reviewed Articleapplication/pdftext/htmlhttps://bjopm.org.br/bjopm/article/view/V14N2A110.14488/BJOPM.2017.v14.n2.a1Brazilian Journal of Operations & Production Management; Vol. 14 No. 2 (2017): June, 2017; 136-1442237-8960reponame:Brazilian Journal of Operations & Production Management (Online)instname:Associação Brasileira de Engenharia de Produção (ABEPRO)instacron:ABEPROenghttps://bjopm.org.br/bjopm/article/view/V14N2A1/pdfhttps://bjopm.org.br/bjopm/article/view/V14N2A1/htmlCopyright (c) 2017 Brazilian Journal of Operations & Production Managementinfo:eu-repo/semantics/openAccessF. Fernandes, IsaacAloise, DanielJ. Aloise, DarioP. Jeronimo, Thiago2021-07-13T14:14:58Zoai:ojs.bjopm.org.br:article/143Revistahttps://bjopm.org.br/bjopmONGhttps://bjopm.org.br/bjopm/oaibjopm.journal@gmail.com2237-89601679-8171opendoar:2023-03-13T09:45:05.841847Brazilian Journal of Operations & Production Management (Online) - Associação Brasileira de Engenharia de Produção (ABEPRO)false |
dc.title.none.fl_str_mv |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
title |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
spellingShingle |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints F. Fernandes, Isaac Location Theory Limited Distances Capacity Constraints |
title_short |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
title_full |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
title_fullStr |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
title_full_unstemmed |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
title_sort |
A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints |
author |
F. Fernandes, Isaac |
author_facet |
F. Fernandes, Isaac Aloise, Daniel J. Aloise, Dario P. Jeronimo, Thiago |
author_role |
author |
author2 |
Aloise, Daniel J. Aloise, Dario P. Jeronimo, Thiago |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
F. Fernandes, Isaac Aloise, Daniel J. Aloise, Dario P. Jeronimo, Thiago |
dc.subject.por.fl_str_mv |
Location Theory Limited Distances Capacity Constraints |
topic |
Location Theory Limited Distances Capacity Constraints |
description |
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. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-07-23 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Peer-reviewed Article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://bjopm.org.br/bjopm/article/view/V14N2A1 10.14488/BJOPM.2017.v14.n2.a1 |
url |
https://bjopm.org.br/bjopm/article/view/V14N2A1 |
identifier_str_mv |
10.14488/BJOPM.2017.v14.n2.a1 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://bjopm.org.br/bjopm/article/view/V14N2A1/pdf https://bjopm.org.br/bjopm/article/view/V14N2A1/html |
dc.rights.driver.fl_str_mv |
Copyright (c) 2017 Brazilian Journal of Operations & Production Management info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2017 Brazilian Journal of Operations & Production Management |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf text/html |
dc.publisher.none.fl_str_mv |
Brazilian Association for Industrial Engineering and Operations Management (ABEPRO) |
publisher.none.fl_str_mv |
Brazilian Association for Industrial Engineering and Operations Management (ABEPRO) |
dc.source.none.fl_str_mv |
Brazilian Journal of Operations & Production Management; Vol. 14 No. 2 (2017): June, 2017; 136-144 2237-8960 reponame:Brazilian Journal of Operations & Production Management (Online) instname:Associação Brasileira de Engenharia de Produção (ABEPRO) instacron:ABEPRO |
instname_str |
Associação Brasileira de Engenharia de Produção (ABEPRO) |
instacron_str |
ABEPRO |
institution |
ABEPRO |
reponame_str |
Brazilian Journal of Operations & Production Management (Online) |
collection |
Brazilian Journal of Operations & Production Management (Online) |
repository.name.fl_str_mv |
Brazilian Journal of Operations & Production Management (Online) - Associação Brasileira de Engenharia de Produção (ABEPRO) |
repository.mail.fl_str_mv |
bjopm.journal@gmail.com |
_version_ |
1797051460038426624 |