A regret model applied to the maximum coverage location problem with queue discipline

Detalhes bibliográficos
Autor(a) principal: Nunes, Pedro Portugal de Sousa
Data de Publicação: 2013
Outros Autores: Silva, Francisco, Lourenço, Helena Ramalhinho
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.3/5069
Resumo: This article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions. It is presented an algorithm that, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained in regard to its robustness for different scenarios. To the well know Maximum Coverage Location Problem from Church and Revelle [1] an alternative perspective is added in which the choice behavior of the server does not only depend on the elapsed time from the demand point looking to the center, but also includes the waiting time for service conditioned by a waiting queue.
id RCAP_91fc2318db009f6d0b670f6f1e504edf
oai_identifier_str oai:repositorio.uac.pt:10400.3/5069
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 regret model applied to the maximum coverage location problem with queue disciplineAllocationCoverageHeuristicLocationRegret ModelThis article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions. It is presented an algorithm that, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained in regard to its robustness for different scenarios. To the well know Maximum Coverage Location Problem from Church and Revelle [1] an alternative perspective is added in which the choice behavior of the server does not only depend on the elapsed time from the demand point looking to the center, but also includes the waiting time for service conditioned by a waiting queue.Universidade dos AçoresRepositório da Universidade dos AçoresNunes, Pedro Portugal de SousaSilva, FranciscoLourenço, Helena Ramalhinho2019-04-30T16:51:36Z2013-122013-12-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.3/5069engNunes, Pedro P.; Silva, Francisco J. F.; Lourenço, Helena R. (2013). A regret model applied to the maximum coverage location problem with queue discipline, “Working Paper Series”, nº 9/13, 34 pp.. Ponta Delgada: Universidade dos Açores, CEEAplA-A.info: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:RCAAP2022-12-20T14:33:20Zoai:repositorio.uac.pt:10400.3/5069Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T16:27:21.435098Repositó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 regret model applied to the maximum coverage location problem with queue discipline
title A regret model applied to the maximum coverage location problem with queue discipline
spellingShingle A regret model applied to the maximum coverage location problem with queue discipline
Nunes, Pedro Portugal de Sousa
Allocation
Coverage
Heuristic
Location
Regret Model
title_short A regret model applied to the maximum coverage location problem with queue discipline
title_full A regret model applied to the maximum coverage location problem with queue discipline
title_fullStr A regret model applied to the maximum coverage location problem with queue discipline
title_full_unstemmed A regret model applied to the maximum coverage location problem with queue discipline
title_sort A regret model applied to the maximum coverage location problem with queue discipline
author Nunes, Pedro Portugal de Sousa
author_facet Nunes, Pedro Portugal de Sousa
Silva, Francisco
Lourenço, Helena Ramalhinho
author_role author
author2 Silva, Francisco
Lourenço, Helena Ramalhinho
author2_role author
author
dc.contributor.none.fl_str_mv Repositório da Universidade dos Açores
dc.contributor.author.fl_str_mv Nunes, Pedro Portugal de Sousa
Silva, Francisco
Lourenço, Helena Ramalhinho
dc.subject.por.fl_str_mv Allocation
Coverage
Heuristic
Location
Regret Model
topic Allocation
Coverage
Heuristic
Location
Regret Model
description This article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions. It is presented an algorithm that, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained in regard to its robustness for different scenarios. To the well know Maximum Coverage Location Problem from Church and Revelle [1] an alternative perspective is added in which the choice behavior of the server does not only depend on the elapsed time from the demand point looking to the center, but also includes the waiting time for service conditioned by a waiting queue.
publishDate 2013
dc.date.none.fl_str_mv 2013-12
2013-12-01T00:00:00Z
2019-04-30T16:51:36Z
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.3/5069
url http://hdl.handle.net/10400.3/5069
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Nunes, Pedro P.; Silva, Francisco J. F.; Lourenço, Helena R. (2013). A regret model applied to the maximum coverage location problem with queue discipline, “Working Paper Series”, nº 9/13, 34 pp.. Ponta Delgada: Universidade dos Açores, CEEAplA-A.
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.publisher.none.fl_str_mv Universidade dos Açores
publisher.none.fl_str_mv Universidade dos Açores
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_ 1799130728324136960

Registros relacionados