A Monte Carlo simulation-based approach to solve dynamic sectorization problem
| Autor(a) principal: | |
|---|---|
| Data de Publicação: | 2021 |
| Outros Autores: | , |
| Tipo de documento: | Artigo |
| Idioma: | eng |
| Título da fonte: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| Texto Completo: | http://hdl.handle.net/10400.14/36289 |
Resumo: | In this study, two novel stochastic models are introduced to solve the dynamic sectorization problem, in which sectors are created by assigning points to service centres. The objective function of the first model is defined based on the equilibration of the distance in the sectors, while in the second one, it is based on the equilibration of the demands of the sectors. Both models impose constraints on assignments and compactness of sectors. In the problem, the coordinates of the points and their demand change over time, hence it is called a dynamic problem. A new solution method is used to solve the models, in which expected values of the coordinates of the points and their demand are assessed by using the Monte Carlo simulation. Thus, the problem is converted into a deterministic one. The linear and deterministic type of the model, which is originally non-linear is implemented in Python's Pulp library and in this way the generated benchmarks are solved. Information about how benchmarks are derived and the obtained solutions are presented. |
| id |
RCAP_8de208e744247eea87d9ef4291437127 |
|---|---|
| oai_identifier_str |
oai:repositorio.ucp.pt:10400.14/36289 |
| network_acronym_str |
RCAP |
| network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository_id_str |
https://opendoar.ac.uk/repository/7160 |
| spelling |
A Monte Carlo simulation-based approach to solve dynamic sectorization problemSectorizationDynamic problemsStochastic modellingMonte Carlo simulationOptimizationIn this study, two novel stochastic models are introduced to solve the dynamic sectorization problem, in which sectors are created by assigning points to service centres. The objective function of the first model is defined based on the equilibration of the distance in the sectors, while in the second one, it is based on the equilibration of the demands of the sectors. Both models impose constraints on assignments and compactness of sectors. In the problem, the coordinates of the points and their demand change over time, hence it is called a dynamic problem. A new solution method is used to solve the models, in which expected values of the coordinates of the points and their demand are assessed by using the Monte Carlo simulation. Thus, the problem is converted into a deterministic one. The linear and deterministic type of the model, which is originally non-linear is implemented in Python's Pulp library and in this way the generated benchmarks are solved. Information about how benchmarks are derived and the obtained solutions are presented.VeritatiTeymourifar, AydinRodrigues, Ana MariaFerreira, José Soeiro2021-12-29T10:20:40Z2021-09-302021-09-30T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.14/36289eng2517-425810.33544/mjmie.v5i2.179info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-03-13T13:23:22Zoai:repositorio.ucp.pt:10400.14/36289Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T01:56:19.526373Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
| dc.title.none.fl_str_mv |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| title |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| spellingShingle |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem Teymourifar, Aydin Sectorization Dynamic problems Stochastic modelling Monte Carlo simulation Optimization |
| title_short |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| title_full |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| title_fullStr |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| title_full_unstemmed |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| title_sort |
A Monte Carlo simulation-based approach to solve dynamic sectorization problem |
| 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 |
| dc.contributor.author.fl_str_mv |
Teymourifar, Aydin Rodrigues, Ana Maria Ferreira, José Soeiro |
| dc.subject.por.fl_str_mv |
Sectorization Dynamic problems Stochastic modelling Monte Carlo simulation Optimization |
| topic |
Sectorization Dynamic problems Stochastic modelling Monte Carlo simulation Optimization |
| description |
In this study, two novel stochastic models are introduced to solve the dynamic sectorization problem, in which sectors are created by assigning points to service centres. The objective function of the first model is defined based on the equilibration of the distance in the sectors, while in the second one, it is based on the equilibration of the demands of the sectors. Both models impose constraints on assignments and compactness of sectors. In the problem, the coordinates of the points and their demand change over time, hence it is called a dynamic problem. A new solution method is used to solve the models, in which expected values of the coordinates of the points and their demand are assessed by using the Monte Carlo simulation. Thus, the problem is converted into a deterministic one. The linear and deterministic type of the model, which is originally non-linear is implemented in Python's Pulp library and in this way the generated benchmarks are solved. Information about how benchmarks are derived and the obtained solutions are presented. |
| publishDate |
2021 |
| dc.date.none.fl_str_mv |
2021-12-29T10:20:40Z 2021-09-30 2021-09-30T00:00:00Z |
| 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/36289 |
| url |
http://hdl.handle.net/10400.14/36289 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
2517-4258 10.33544/mjmie.v5i2.179 |
| 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órios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
| instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| instacron_str |
RCAAP |
| institution |
RCAAP |
| reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| repository.mail.fl_str_mv |
info@rcaap.pt |
| _version_ |
1833601175169007616 |