Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/11341
Title: A PageRank-based heuristic for the minimization of open stacks problem.
Authors: Frinhani, Rafael de Magalhães Dias
Carvalho, Marco Antonio Moreira de
Soma, Nei Yoshihiro
Issue Date: 2018
Citation: FRINHANI, R. de M. D.; CARVALHO, M. A. M. de; SOMA, N. Y. A PageRank-based heuristic for the minimization of open stacks problem. PLoS ONE, v. 13, n. 8, p. 1-24, 2018. Disponível em: <https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0203076>. Acesso em: 19 mar. 2019.
Abstract: The minimization of open stacks problem (MOSP) aims to determine the ideal production sequence to optimize the occupation of physical space in manufacturing settings. Most of current methods for solving the MOSP were not designed to work with large instances, precluding their use in specific cases of similar modeling problems. We therefore propose a PageRank-based heuristic to solve large instances modeled in graphs. In computational experiments, both data from the literature and new datasets up to 25 times fold larger in input size than current datasets, totaling 1330 instances, were analyzed to compare the proposed heuristic with state-of-the-art methods. The results showed the competitiveness of the proposed heuristic in terms of quality, as it found optimal solutions in several cases, and in terms of shorter run times compared with the fastest available method. Furthermore, based on specific graph densities, we found that the difference in the value of solutions between methods was small, thus justifying the use of the fastest method. The proposed heuristic is scalable and is more affected by graph density than by size.
URI: http://www.repositorio.ufop.br/handle/123456789/11341
metadata.dc.identifier.doi: https://doi.org/10.1371/journal.pone.0203076
ISSN: 1545-7885
metadata.dc.rights.license: This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Fonte: o próprio artigo
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_PageRankBased.pdf5,57 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.