Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/14529
Registro completo de metadados
Campo Dublin Core | Valor | Idioma |
---|---|---|
dc.contributor.author | Oliveira, Paganini Barcellos de | - |
dc.contributor.author | Camargo, Ricardo Saraiva de | - |
dc.contributor.author | Miranda Junior, Gilberto de | - |
dc.contributor.author | Martins, Alexandre Xavier | - |
dc.date.accessioned | 2022-02-17T18:35:39Z | - |
dc.date.available | 2022-02-17T18:35:39Z | - |
dc.date.issued | 2021 | pt_BR |
dc.identifier.citation | OLIVEIRA, P. B. de et al. A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation. Computers & Industrial Engineering, v. 151, artigo 106964, 2021. Disponível em: <https://www.sciencedirect.com/science/article/abs/pii/S0360835220306379>. Acesso em: 12 set. 2021. | pt_BR |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/jspui/handle/123456789/14529 | - |
dc.description.abstract | This work presents a computational study for two variants of a dynamic or multi-period two-level uncapacitated facility location problem. In this problem, first-level plants serve different demand patterns of scattered clients over a planning horizon via second-level facilities. In the first variant, second-level facilities can be supplied by only one of the plants (single assignment); whereas, in the second, they can be served by more than one of the first-level plants (multiple allocation). As the demands vary over time, the different operating settings for plants and facilities, and client assignments need to be sought in each period to serve demands at minimal installation and transportation costs. Since both problem variants arise naturally in the context of logistics systems, it is of interest to have solution methods at hand for practitioners and researchers. To provide such a tool, this work presents an efficient decomposition approach to solve the two problem variants. It relies on Benders decomposition reformulations combined with a greedy randomized adaptive search procedure and different Benders cut separation procedures. The devised solution framework outperformed CPLEX and its Benders built-in algorithm on solving two different challenging large-scale instance sets. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.subject | Discrete location | pt_BR |
dc.subject | Benders decomposition method | pt_BR |
dc.subject | Benders optimality cuts | pt_BR |
dc.title | A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.identifier.uri2 | https://www.sciencedirect.com/science/article/abs/pii/S0360835220306379 | pt_BR |
dc.identifier.doi | https://doi.org/10.1016/j.cie.2020.106964 | pt_BR |
Aparece nas coleções: | DEENP - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_ComputacionalStudyDecomposition.pdf Restricted Access | 1,2 MB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.