A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation.

Simple item page
dc.contributor.authorOliveira, Paganini Barcellos de
dc.contributor.authorCamargo, Ricardo Saraiva de
dc.contributor.authorMiranda Junior, Gilberto de
dc.contributor.authorMartins, Alexandre Xavier
dc.date.accessioned2022-02-17T18:35:39Z
dc.date.available2022-02-17T18:35:39Z
dc.date.issued2021pt_BR
dc.description.abstractThis 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.identifier.citationOLIVEIRA, 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.doihttps://doi.org/10.1016/j.cie.2020.106964pt_BR
dc.identifier.issn0360-8352
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/14529
dc.identifier.uri2https://www.sciencedirect.com/science/article/abs/pii/S0360835220306379pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectDiscrete locationpt_BR
dc.subjectBenders decomposition methodpt_BR
dc.subjectBenders optimality cutspt_BR
dc.titleA computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_ComputacionalStudyDecomposition.pdf
Size:
1.17 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DEENP - Artigos publicados em periódicos