A new model for location-allocation problem based on sectorization
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.14/36481 |
Resumo: | Many models have been proposed for the location-allocation problem. In this study, based on sectorization concept, we propose a new single-objective model of this problem, in which, there is a set of customers to be assigned to distribution centres (DCs). In sectorization problems there are two important criteria as compactness and equilibrium, which can be defined as constraints as well as objective functions. In this study, the objective function is defined based on the equilibrium of distances in sectors. The concept of compactness is closely related to the accessibility of customers from DCs. As a new approach, instead of compactness, we define the accessibility of customers from DCs based on the covering radius concept. The interpretation of this definition in real life is explained. As another contribution, in the model, a method is used for the selection of DCs, and a comparison is made with another method from the literature, then the advantages of each are discussed. We generate benchmarks for the problem and we solve it with a solver available in Python’s Pulp library. Implemented codes are presented in brief. |
id |
RCAP_a697470e49946eb86e9a3f56e015f0a0 |
---|---|
oai_identifier_str |
oai:repositorio.ucp.pt:10400.14/36481 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A new model for location-allocation problem based on sectorizationLocation-allocation problemSectorizationCovering radiusPythonPulpLinear programmingMany models have been proposed for the location-allocation problem. In this study, based on sectorization concept, we propose a new single-objective model of this problem, in which, there is a set of customers to be assigned to distribution centres (DCs). In sectorization problems there are two important criteria as compactness and equilibrium, which can be defined as constraints as well as objective functions. In this study, the objective function is defined based on the equilibrium of distances in sectors. The concept of compactness is closely related to the accessibility of customers from DCs. As a new approach, instead of compactness, we define the accessibility of customers from DCs based on the covering radius concept. The interpretation of this definition in real life is explained. As another contribution, in the model, a method is used for the selection of DCs, and a comparison is made with another method from the literature, then the advantages of each are discussed. We generate benchmarks for the problem and we solve it with a solver available in Python’s Pulp library. Implemented codes are presented in brief.Veritati - Repositório Institucional da Universidade Católica PortuguesaTeymourifar, AydinRodrigues, Ana MariaFerreira, José Soeiro2022-01-17T15:10:34Z2021-08-122021-08-12T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.14/36481eng2692-5079info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-12T17:41:58Zoai:repositorio.ucp.pt:10400.14/36481Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T18:29:39.146567Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A new model for location-allocation problem based on sectorization |
title |
A new model for location-allocation problem based on sectorization |
spellingShingle |
A new model for location-allocation problem based on sectorization Teymourifar, Aydin Location-allocation problem Sectorization Covering radius Python Pulp Linear programming |
title_short |
A new model for location-allocation problem based on sectorization |
title_full |
A new model for location-allocation problem based on sectorization |
title_fullStr |
A new model for location-allocation problem based on sectorization |
title_full_unstemmed |
A new model for location-allocation problem based on sectorization |
title_sort |
A new model for location-allocation problem based on sectorization |
author |
Teymourifar, Aydin |
author_facet |
Teymourifar, Aydin Rodrigues, Ana Maria Ferreira, José Soeiro |
author_role |
author |
author2 |
Rodrigues, Ana Maria Ferreira, José Soeiro |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Veritati - Repositório Institucional da Universidade Católica Portuguesa |
dc.contributor.author.fl_str_mv |
Teymourifar, Aydin Rodrigues, Ana Maria Ferreira, José Soeiro |
dc.subject.por.fl_str_mv |
Location-allocation problem Sectorization Covering radius Python Pulp Linear programming |
topic |
Location-allocation problem Sectorization Covering radius Python Pulp Linear programming |
description |
Many models have been proposed for the location-allocation problem. In this study, based on sectorization concept, we propose a new single-objective model of this problem, in which, there is a set of customers to be assigned to distribution centres (DCs). In sectorization problems there are two important criteria as compactness and equilibrium, which can be defined as constraints as well as objective functions. In this study, the objective function is defined based on the equilibrium of distances in sectors. The concept of compactness is closely related to the accessibility of customers from DCs. As a new approach, instead of compactness, we define the accessibility of customers from DCs based on the covering radius concept. The interpretation of this definition in real life is explained. As another contribution, in the model, a method is used for the selection of DCs, and a comparison is made with another method from the literature, then the advantages of each are discussed. We generate benchmarks for the problem and we solve it with a solver available in Python’s Pulp library. Implemented codes are presented in brief. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-08-12 2021-08-12T00:00:00Z 2022-01-17T15:10:34Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.14/36481 |
url |
http://hdl.handle.net/10400.14/36481 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2692-5079 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799132016882483200 |